检索结果-内蒙古大学图书馆

International Conference on Quality of Service in Heterogeneous Wired/Wireless Networks (QSHINE)

作者： Dhrubajyoti Bhaumick Sasthi C. Ghosh Advanced Computing & Microelectronics Unit Indian Statistical Institute Kolkata India

ISBN: (纸本)9781479940363

This paper deals with the problem of optimal association of stations (STAs) to access points (APs) for mulicast services in IEEE 802.11 WLAN. In a multicast session, all the subscribed STAs receive the multicast data packet at the same data rate (R min ) from their respective serving APs. A higher value of R min improves the multicast throughput by completing the ongoing multicast session in lesser time. This also improves the unicast throughput as the cycle duration is shared by the unicast and multicast sessions. To provide multicast services to the STAs, we need to select a minimum cardinality subset of APs as the system message overhead depends on this cardinality. However, such a minimum cardinality subset of APs may not be possible to activate simultaneously due to the limited number of available orthogonal frequency channels. In this paper, we develop a combined greedy algorithm that selects a subset of APs with minimum cardinality for which a conflict-free frequency assignment exists and finds an association between the STAs and the selected APs that maximizes the R min value. Through simulation we have shown that the proposed algorithm selects significantly less number of APs for different R min values in comparison to the well-known metrics for multicast association like RSSI, minimum hop-distance, normalized-cost and in-range STA number.

关键词： Unicast Radio spectrum management Measurement Multicast communication Local area networks Interchannel interference

来源：评论

学校读者我要写书评

暂无评论

Distributed Data Gathering Scheduling in Multihop Wireless Sensor Networks for Improved Lifetime

Distributed Data Gathering Scheduling in Multihop Wireless S...

引用

International Conference on computing (ICCTA 2007): Theory and Applications

作者： Subhasis Bhattacharjee Nabanita Das Advanced Computing and Microelectronics Unit Indian Statistical Institute Kolkata India

For a multihop sensor network with n sensors, this paper presents an O(n) distributed greedy algorithm for extracting a rooted spanning tree to improve the lifetime of the overall network. It spontaneously determines a data gathering schedule from the sensors towards the base station (the root). No global knowledge about the topology is required for the computation and also each sensor does not need to access the base station directly. Simulation studies show that in terms of system lifetime, the proposed algorithm significantly outperforms the scheduling based on the Minimum Spanning Tree (MST), or the Shortest Path (SP) routing techniques. Performance comparison with PEGASIS [7] shows that the proposed algorithm performs better as more and more nodes die out.

关键词： Spread spectrum communication Wireless sensor networks Processor scheduling Base stations Greedy algorithms Data mining Network topology Computational modeling Scheduling algorithm Routing

来源：评论

学校读者我要写书评

暂无评论

Multihop D2D Communication to Minimize and Balance SAR in 5G

Multihop D2D Communication to Minimize and Balance SAR in 5G

引用

International Communication Systems and Networks and Workshops, COMSNETS

作者： Avirup Das Nabanita Das Advanced Computing & Microelectronics Unit Indian Statistical Institute Kolkata India

ISBN: (数字)9781728131870

ISBN: (纸本)9781728131887

To cope with the exponential growth in wireless traffic to be induced by the advancement of 5G and IoT technologies, higher frequency bands will be in use to achieve high performance. But this will enhance the associated electromagnetic field (EMF) around us and may have harmful effects on all living creatures and the environment, unless necesSARy precautionary measures are followed to limit it. In this paper, we propose an elegant method of band selection with appropriate data rate for multi-hop packet routing, to minimize and also to balance the transmission power and hence the associated EMF effect on us in terms of the Specific Absorption Rate (SAR). Theoretical analysis has been presented for linear networks that results an upper bound on the number of hops permitted for a given spectrum band. Simulation results on random networks show that the proposed technique achieves a 30 - 70% improvement in terms of SAR, compared to the conventional direct communication via base station.

关键词： Routing Wireless communication Spread spectrum communication Receivers Transmitters 5G mobile communication Base stations

来源：评论

学校读者我要写书评

暂无评论

Faster Placer for Island-Style FPGAs

Faster Placer for Island-Style FPGAs

引用

International Conference on computing: Theory and Applications, ICCTA

作者： Pritha Banerjee Susmita Sur-Kolay Advanced Computing and Microelectronics Unit Indian Statistical Institute Kolkata India

In this paper, we propose a placement method for island-style FPGAs, based on fast yet very good initial placement followed by refinement using ultra-low temperature simulated annealing. The initial placement is the keystone of the method and the steps to obtain it are: top down coarse partitioning, allocation of partitions to regions on FPGA array, placement of logic blocks within each region and finally the IOs. The solutions thus obtained require 66% fewer moves i.e. about 3x speed-up during final iterative refinement by simulated annealing, whereas the quality of solution is on the average within 2% of optimal. The critical path length obtained after routing does not degrade for the set of 9 benchmark circuits

关键词： Field programmable gate arrays Simulated annealing Routing Switches Costs Computational modeling Logic arrays Circuit simulation Phased arrays Iterative algorithms

来源：评论

学校读者我要写书评

暂无评论

Checkpointing Using Mobile Agents in Distributed Systems

Checkpointing Using Mobile Agents in Distributed Systems

引用

International Conference on computing: Theory and Applications, ICCTA

作者： Partha Sarathi Mandal Krishnendu Mukhopadhyaya Advanced Computing and Microelectronics Unit Indian Statistical Institute Kolkata India

Traditional message passing based checkpointing and rollback recovery algorithms perform well for tightly coupled systems. In wide area distributed systems these algorithms may suffer from large overhead due to message passing delay and network traffic. Mobile agents offer an attractive option for designing checkpointing schemes for wide area distributed systems. Network topology is assumed to be arbitrary. Processes are mobile agent enabled. When a process wants to take a checkpoint, it just creates one mobile agent. Concurrent initiations by multiple processes are allowed. Synchronization and creation of a consistent global state (CGS) for checkpointing is managed by the mobile agent(s). In the worst case, for k concurrent initiations among n processes, checkpointing algorithm requires a total of O(kn) hops by all the mobile agents. A mobile agent carries O(n/k) (on the average) size data

关键词： Checkpointing Mobile agents Message passing Network topology Distributed computing Telecommunication traffic System performance Mobile communication Intelligent agent microelectronics

来源：评论

学校读者我要写书评

暂无评论

Channel assignment in mobile networks based on geometric prediction and random coloring

Channel assignment in mobile networks based on geometric pre...

引用

Conference on Local Computer Networks (LCN)

作者： Subhankar Ghosal Sasthi C. Ghosh Advanced Computing & Microelectronics Unit Indian Statistical Institute Kolkata India

ISBN: (纸本)9781467367714

The channel assignment problem in mobile networks can be modeled as a temporal graph coloring problem where a temporal graph represents a sequence of graphlets generated over a regular interval of time. The cost of coloring a graphlet is defined as a function of number of colors used in the current graphlet and the number of color changes from the previous graphlet. A differential coloring technique is proposed which first finds the minimum number of vertices that requires recoloring and then recolor them. A prediction based and a random coloring based approaches are proposed to reduce the cost. In prediction based approach, we predict a graph which is a supergraph of the graph representing the union of current and next k graphlets and then color it. Whereas, in random coloring we color the graphlets individually. We have shown that both approaches perform better than an existing SNAP algorithm.

关键词： Color Image color analysis Channel allocation Prediction algorithms Approximation algorithms Mobile communication Mobile computing

来源：评论

学校读者我要写书评

暂无评论

$Q$-learning Based Network Selection Mechanism for CRNs with Secrecy Provisioning

$Q$-learning Based Network Selection Mechanism for CRNs with...

引用

IEEE International Symposium on Network computing and Applications

作者： Shankar K. Ghosh Sasthi C. Ghosh Advanced Computing & Microelectronics Unit Indian Statistical Institute Kolkata India

In near future, the spectrum resources shared by primary networks to spectrum pools are likely to use unlicensed band because of its increasing popularity. Due to the open access nature, in unlicensed band communication, eavesdroppers are capable of overhearing the traffic channels. This may lead to significant throughput degradation. Existing network selection mechanisms for cognitive radio networks (CRNs) do not consider this security threat adequately. In this work, we first propose a Q-learning based throughput estimation mechanism considering the possibility of throughput degradation caused by eavesdroppers. Then, based on estimated throughput values, we formulate the network selection problem in orthogonal frequency division multiple access (OFDMA) based CRNs as an integer linear program (ILP). Next, based on the ILP formulation, we propose a greedy algorithm for network selections in OFDMA based CRNs. Finally, performance of our proposed network selection mechanism has been compared with existing approaches through system level simulations.

关键词： Nickel Throughput Interference Security Base stations Degradation Resource management

来源：评论

学校读者我要写书评

暂无评论

Fast FPGA placement using space-filling curve

Fast FPGA placement using space-filling curve

引用

International Conference on Field Programmable Logic and Applications

作者： P. Banerjee S. Bhattacharjee S. Sur-Kolay S. Das S.C. Nandy Advanced Computing and Microelectronics Unit Indian Statistical Institute Kolkata India

In this paper, we propose a placement method for island-style FPGAs, based on recursive bi-partitioning followed by application of space-filling curves. Experimental results of our method show 55% improvement in cost, when compared to random initial placement of the popular tool VPR. The solutions thus obtained require 44.5% fewer moves during final iterative refinement by ultra-low temperature simulated annealing, whereas the quality of solution is on the average 0.1% better. This establishes the utility of the method for fast reconfiguration of FPGA based co-processors.

关键词： Field programmable gate arrays Programmable logic arrays Switches Circuits Temperature Simulated annealing Filling Routing Phased arrays Reconfigurable logic

来源：评论

学校读者我要写书评

暂无评论

Mutual visibility by robots with persistent memory

arXiv

引用

arXiv 2017年

作者： Bhagat, Subhash Mukhopadhyaya, Krishnendu Advanced Computing and Microelectronics Unit Indian Statistical Institute Kolkata India

This paper addresses the mutual visibility problem for a set of semi-synchronous, opaque robots occupying distinct positions in the Euclidean plane. Since robots are opaque, if three robots lie on a line, the middle robot obstructs the visions of the two other robots. The mutual visibility problem asks the robots to coordinate their movements to form a configuration, within finite time and without collision, in which no three robots are collinear. Robots are endowed with a constant bits of persistent memory. In this work, we consider the FSTATE computational model in which the persistent memory is used by the robots only to remember their previous internal states. Except from this persistent memory, robots are oblivious i.e., they do not carry forward any other information from their previous computational cycles. The paper presents a distributed algorithm to solve the mutual visibility problem for a set of semi-synchronous robots using only 1 bit of persistent memory. The proposed algorithm does not impose any other restriction on the capability of the robots and guarantees collision-free movements for the robots. Copyright © 2017, The Authors. All rights reserved.

关键词： Visibility

来源：评论

学校读者我要写书评

暂无评论

A distributed multiple-slot assignment algorithm for wireless sensor networks

A distributed multiple-slot assignment algorithm for wireles...

引用

International Conference on Computers and Devices for Communication (CODEC)

作者： Arnab Sinha Nabanita Das Advanced Computing and Microelectronics Unit Indian Statistical Institute Kolkata India

In this paper, a distributed scheduling algorithm is proposed for multiple slot assignment in wireless sensor networks for TDMA scheduling that attempts to minimize the frame length, ensuring at least one conflict-free slot for each node. Simulation studies have been done to compare the performance of the proposed algorithm with earlier ones that shows improvement in terms of frame length and message overhead indicating that the proposed algorithm will perform better for dense network.

关键词： Wireless sensor networks Time division multiple access Scheduling algorithm Access protocols Processor scheduling Broadcasting microelectronics Distributed algorithms Network topology Computer networks

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：