Please use this identifier to cite or link to this item:
|Title:||DRACo: Distributed, robust and asynchronous coverage in wireless sensor networks|
|Citation:||Ai, X., Srinivasan, V., Tham, C.-K. (2007). DRACo: Distributed, robust and asynchronous coverage in wireless sensor networks. 2007 4th Annual IEEE Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks, SECON : 530-539. ScholarBank@NUS Repository. https://doi.org/10.1109/SAHCN.2007.4292865|
|Abstract:||Coverage and lifetime are both important performance criteria in wireless sensor networks. Unfortunately, improving one of these metrics conies at the expense of the other metric. In this paper, we investigate the design of algorithms which provide the maximum possible coverage subject to a Iiletime guarantee. We assume that nodes are randomly scattered in a sensor field and the goal is to partition these nodes into K sets, At any given time, nodes belonging to only one of these sets actively sense the field. A key challenge is to achieve this partition in a distributed manner with purely local information and yet provide near optimal coverage. In this paper, we propose DRACo for this purpose. We formally prove that DRACo converges when executed in a synchronous manner. We prove that our algorithm and the optimal solution are both Nash equilibrium for an appropriately defined game. Via extensive simulations, we show that DRACo achieves near optimal coverage performance. Moreover, we show that DRACo is robust to network dynamics and can converge even when executed asynchronously. Our simulations indicate that the convergence speed of DRACo is almost constant with the number of nodes N and K. © 2007 IEEE.|
|Source Title:||2007 4th Annual IEEE Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks, SECON|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on May 21, 2018
WEB OF SCIENCETM
checked on May 1, 2018
checked on May 12, 2018
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.