Exact distributed Voronoi cell computation in sensor networks
Proceedings of the 6th international conference on Information processing in sensor networks
Sensor replacement using mobile robots
Computer Communications
A Comprehensive Review of Sensor Relocation
GREENCOM-CPSCOM '10 Proceedings of the 2010 IEEE/ACM Int'l Conference on Green Computing and Communications & Int'l Conference on Cyber, Physical and Social Computing
High-Fidelity simulation of large-scale structures
ICCS'05 Proceedings of the 5th international conference on Computational Science - Volume Part II
| Hi-index | 0.00 |
In this paper we study two important problems - coverage-boundarydetection and implementing distributed has tables inad-hoc wireless networks.These problems frequently arise in servicelocation and relocation in wireless networks.For the centralizedcoverage-boundary problem we prove a 驴(n log n) lowerbound for n devices.We show that both problems can be effectivelyreduced to the problem of computing Voronoi overlays, andmaintaining these overlays dynamically.Since the computation ofVoronoi diagrams requires O(n log n) time, our solution is optimalfor the computation of the coverage-boundary.We present efficientdistributed algorithms for computing and dynamically maintainingVoronoi overlays, and prove the stability properties for thelatter - i.e., if the nodes stop moving, the overlay stabilizes to thecorrect Voronoi overlay.Finally, we present experimental resultsin the context of the two selected applications, which validate theperformance of our distributed and dynamic algorithms.