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

4th International Conference on Wireless Communication and Sensor Networks, WCSN 2008

作者： Sau, B. Mukhopadhyaya, K. Advanced Computing and Microelectronics Unit Indian Statistical Institute Kolkata India Department of Mathematics Jadavpur University Kolkata India Government of India India

ISBN: (纸本)9781424433261

Centralized localization dissipates a lot of energy in pooling the proximity information of the individual nodes. In contrast a distributed algorithm usually uses only local information at each node. Most localization algorithms available in the literature are are anchor based or they estimate the position of the sensors at the cost of losing accuracy. In this paper, we propose an anchor-free length-based distributed localization technique under a restricted model which solves a specialized case of this problem. The model assumes that all known distances between the sensors are less than the communication range of the sensors and all unknown distances are greater. We also assume that communication range is at least twice as much as the sensing range. Every point in the field of interest is assumed to be covered by some sensor. Each sensor localizes some of its neighbours with information from its neighbours. Each node communicates information for localization to its neighbours only;thus reducing traffic over the network. We also show that, the time required to localize all sensors uniquely under this model is linear in the number of sensors. © 2008 IEEE.

关键词： Sensor networks

来源：评论

学校读者我要写书评

暂无评论

Throughput optimization for multirate multicasting through association control in ieee 802.11 wlan 1

引用

14th EAI International Conference on Heterogeneous Networking for Quality, Reliability, Security and Robustness, Qshine 2018

作者： Bhaumick, Dhrubajyoti Ghosh, Sasthi C. Advanced Computing and Microelectronics Unit Indian Statistical Institute 203 B. T. Road KolkataWest Bengal700108 India

ISBN: (数字)9783030144135

ISBN: (纸本)9783030144128

Multicasting in wireless local area network is an efficient way to deliver message from a source user to a specified group of destination users simultaneously. In unirate multicasting, all users belonging to a particular group receive their services at the same basic rate. This may underutilize network resources as users requirements are generally heterogeneous in nature. To resolve this limitation, multirate multicasting is introduced, where different users belonging to a particular group may receive their services at different rates. Often dense deployment of access points (APs) is required for coverage and capacity improvement. Thus an station (STA) may come under the coverage range of several APs and hence there may exists many possible associations between the STAs and the APs. Hence finding an efficient association is very important as individual throughput of the STAs as well as the overall system throughput depend on it. We have developed an efficient algorithm to find an appropriate association for multirate multicasting. The objective is to maximize overall system throughput while respecting the user fairness. Through simulations, we have evaluated and compared the performance of our proposed algorithm with other well-known metrics such as received signal strength indicator, minimum hop-distance, in-range STA number and normalized cost. Results show that the proposed algorithm significantly improves the overall system throughput in comparison to these metrics. © ICST institute for Computer Sciences, Social Informatics and Telecommunications Engineering 2019.

关键词： Multicasting

来源：评论

学校读者我要写书评

暂无评论

A fast digital-geometric approach for granulometric image analysis 2

A fast digital-geometric approach for granulometric image an...

引用

2nd International Conference on Recent Advances on Information Technology, RAIT 2014

作者： Bera, Sahadev Biswas, Arindam Bhattacharya, Bhargab B. Advanced Computing and Microelectronics Unit Indian Statistical Institute Kolkata India Department of Information Technology Bengal Engineering and Science University Howrah India

ISBN: (纸本)9788132218555

A simple algorithm for automated analysis of granulometric images consisting of touching or overlapping convex objects such as coffee bean, food grain, is presented. The algorithm is based on certain underlying digital-geometric features embedded in their snapshots. Using the concept of an outer isothetic cover and geometric convexity, the separator of two overlapping objects is identified. The objects can then be isolated by removing the isothetic covers and the separator. The technique needs only integer computation and its termination time can be controlled by choosing a resolution parameter. Experimental results on coffee beans and other images demonstrate the efficiency and robustness of the proposed method compared to earlier watershed-based algorithms. © Springer India 2014.

关键词： Image analysis

来源：评论

学校读者我要写书评

暂无评论

MAB based Network Selection mechanism for URLLC users in RIS assisted network 21

MAB based Network Selection mechanism for URLLC users in RIS...

引用

21st IEEE International Symposium on Network computing and Applications, NCA 2022

作者： Deb, Souvik Ghosh, Shankar Kumar Ghosh, Sasthi C. Indian Statistical Institute Advanced Computing & Microelectronics Unit Kolkata India Shiv Nadar Institution of Eminence Department of CSE NCR Delhi India

ISBN: (纸本)9798350397307

In this work, a network selection mechanism for re-configurable intelligent surface (RIS) assisted network has been proposed. The goal of the proposed mechanism is to select appropriate base station (BS) or BS-RIS pair to maximize user throughput while satisfying the delay and reliability constraints of uRLLC users. First, the network selection mechanism for RIS assisted network has been formulated as multi arm bandit (MAB) problem;Then, based on the formulation, a network selection strategy has been proposed. Finally, through extensive system level simulations, it has been shown that the proposed scheme outperforms the existing A3 handover scheme in terms of reliability and user throughput. © 2022 IEEE.

关键词： Interlocking signals

来源：评论

学校读者我要写书评

暂无评论

Mutual Visibility by Fat Robots with Slim Omnidirectional Camera

arXiv

引用

arXiv 2022年

作者： Bose, Kaustav Chakraborty, Abhinav Mukhopadhyaya, Krishnendu Advanced Computing and Microelectronics Unit Indian Statistical Institute Kolkata India Advanced Computing and Microelectronics Unit Indian Statistical Institute Kolkata India Advanced Computing and Microelectronics Unit Indian Statistical Institute Kolkata India

In the existing literature of the MUTUAL VISIBILITY problem for autonomous robot swarms, the adopted visibility models have some idealistic assumptions that are not consistent with practical sensing device implementations. This paper investigates the problem in the more realistic visibility model called opaque fat robots with slim omnidirectional camera. The robots are modeled as unit disks, each having an omnidirectional camera represented as a disk of smaller size. We assume that the robots have compasses that allow agreement in the direction and orientation of both axes of their local coordinate systems. The robots are equipped with visible lights which serve as a medium of communication and also as a form of memory. We present a distributed algorithm for the MUTUAL VISIBILITY problem which is provably correct in the semi-synchronous setting. Our algorithm also provides a solution for LEADER ELECTION which we use as a subroutine in our main algorithm. Although LEADER ELECTION is trivial with two axis agreement in the full visibility model, it is challenging in our case and is of independent interest. Copyright © 2022, The Authors. All rights reserved.

关键词： Visibility

来源：评论

学校读者我要写书评

暂无评论

A new look ahead technique for customized testing in digital microfluidic biochips

A new look ahead technique for customized testing in digital...

引用

2012 IEEE 21st Asian Test Symposium, ATS 2012

作者： Roy, Pranab Rahaman, Hafizur Dasgupta, Parthasarthi Bhattacharya, Bhargab B.B. School of VLSI Technology Bengal Engineering and Science University Shibpur India Indian Institute of Management Calcutta India Advanced Computing and Microelectronics Unit Indian Statistical Institute Calcutta India

ISBN: (纸本)9780769548760

Digital Micro fluidic biochips have been developed as a promising platform for Lab-on-chip systems that manipulate individual droplet of chemicals on a 2D planar array of electrodes. Due to the significance of the correctness of the results - fault tolerance and dependability becomes a major issue for operation of these devices. Therefore, such devices are required to be tested frequently both off-line (e.g., post manufacturing) and concurrently ahead of each assay execution. Under both scenarios, testing is accomplished by routing one or more test droplets across the chip simultaneously and recording their arrival at the destination. In this paper we attempted to solve the problem of customized testing for a given Bioassay layout. We have applied a look ahead strategy for parallel testing using multiple droplets for any given test bench with an objective of minimization of test completion time and optimized utilization of test resources. The test simulations are carried out on test benches of Benchmark suite III and results obtained are found to be encouraging. © 2012 IEEE.

关键词： Routing algorithms

来源：评论

学校读者我要写书评

暂无评论

Two-round discrete voronoi game along a line

Two-round discrete voronoi game along a line

引用

7th International Frontiers in Algorithmics Workshop and the 9th International Conference on Algorithmic Aspects in Information and Management, FAW-AAIM 2013

作者： Banik, Aritra Bhattacharya, Bhaswar B. Das, Sandip Das, Sreeja Advanced Computing and Microelectronics Unit Indian Statistical Institute Kolkata India Department of Statistics Stanford University United States Jadavpur University Kolkata India

ISBN: (纸本)9783642387555

The two-round discrete Voronoi game on a line consists of a finite user set U (with |U | = n), placed along a line , and two players Player 1 (P1) and Player 2 (P2). We assume that the sorted order of users in U along the line is known, and P1 and P2 each has two facilities. P1 places one facility followed by which P2 places another facility and this continues for two rounds. The payoff of P2 is defined as the cardinality of the set of points in U which are closer to a facility owned by P2 than to every facility owned by P1. The payoff of P1 is the number of users in U minus the payoff of P2. The objective of both the players is to maximize their respective payoffs. In this paper we show that, P2 always gets at least n/2 users, i.e., P2 always wins the game and the bound is tight. We also present efficient algorithms to find the optimal strategies of the players in both the rounds. © 2013 Springer-Verlag Berlin Heidelberg.

关键词： Computers

来源：评论

学校读者我要写书评

暂无评论

A generalized theory for formal assertion coverage

A generalized theory for formal assertion coverage

引用

2012 IEEE 21st Asian Test Symposium, ATS 2012

作者： Das, Sourasis Banerjee, Ansuman Dasgupta, Pallab Dept. of Comp. Sc. and Engg. IIT Kharagpur India Advanced Computing and Microelectronics Unit Indian Statistical Institute India

ISBN: (纸本)9780769548760

Coverage of formal property specifications has important ramifications in design verification. Mutation coverage, a well studied approach towards specification coverage, checks whether the specification fails in the presence of a fault. Existing mutation coverage methods are broadly divided into those which inject the fault into a given implementation and those which inject the fault directly into the specification. This paper presents a theory which unifies these contrasting approaches and extends the mutation coverage approach to partial implementations where some components are given, and for the others, we only have component specifications. © 2012 IEEE.

关键词： Specifications

来源：评论

学校读者我要写书评

暂无评论

Fault Secured JPEG-Codec Hardware Accelerator with Piracy Detective Control using Secure Fingerprint Template 36

Fault Secured JPEG-Codec Hardware Accelerator with Piracy De...

引用

36th IEEE International Symposium on Defect and Fault Tolerance in VLSI and Nanotechnology Systems, DFT 2023

作者： Chaurasia, Rahul Reddy Asireddy, Abhinav Sengupta, Anirban Indian Institute of Technology Computer Science and Engineering Indore India Indian Institute of Technology Department of Computer Science and Engineering Indore India Indian Statistical Institute Advanced Computing and Microelectronics Unit Kolkata India

ISBN: (纸本)9798350315004

This paper presents a novel methodology to design fault secured JPEG-compression-decompression (codec) hardware accelerator with piracy detective control using secure fingerprint template of intellectual property (IP) vendor. In the proposed approach, firstly, the fault secured schedule for JPEG-codec design is generated from its behavioral description. Subsequently, in order to enable detective control against piracy, secure digital template corresponding to fingerprint biometric of IP vendor is generated and implanted into the design. In order to do so, firstly, fingerprint features are transformed based on IP vendor specified key-set. Subsequently, the generated secure fingerprint template in the form of encoded hardware security constraints is implanted into the design during behavioral/ high-level synthesis phase of integrated circuit (IC) design. The implanted hardware security constraints thereby ensure the seamless detection and isolation of fake/pirated design versions during piracy detection process, before their conjunction into system on chip (SoC) of electronic systems. The proposed approach achieves the following: i) fault secured hardware accelerator for JPEG-codec with integrated piracy detective control at negligible design cost overhead ii) higher resiliency against tampering attack and iii) lower probability of coincidence (indicating definitive proof of ownership for genuine IP vendor). © 2023 IEEE.

关键词： Fault detection

来源：评论

学校读者我要写书评

暂无评论

Trace-driven Modeling and Verification of a Mobility-Aware Service Allocation and Migration Policy for Mobile Edge computing

Trace-driven Modeling and Verification of a Mobility-Aware S...

引用

IEEE International Conference on Web Services (ICWS)

作者： Kaustabha Ray Ansuman Banerjee Advanced Computing and Microelectronics Unit Indian Statistical Institute

ISBN: (数字)9781728187860

ISBN: (纸本)9781728187877

In recent times, Mobile Edge computing (MEC) has emerged as a new paradigm allowing low-latency access to services deployed on edge nodes offering computation, storage and communication facilities. Vendors deploy their services on MEC servers to improve performance and mitigate network latencies often encountered in accessing cloud services. An allocation policy determines how to allocate service requests from mobile users to MEC servers. A number of proposals for binding user service requests to nearby edge servers enroute have been proposed in literature. However, none of these proposals, to the best of our knowledge, provide quantitative performance guarantees on the quality of service metrics. Indeed, the evolving environment, along with a large allocation configuration space makes proving performance guarantees for such allocation policies a challenging task. To address such issues, we propose a trace driven approach to derive a formal model of allocation policies and perform quantitative verification to produce probabilistic guarantees on performance metrics. We use benchmark real world MEC server and user datasets and a mobility aware allocation and migration policy from recent literature to validate our model. Experimental results show our model's effectiveness in quantitatively reasoning about service allocation performance metrics in MEC systems.

关键词： Measurement Web services Computational modeling Resource management Servers Proposals Edge computing

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：