Boundary recognition in sensor networks by topological methods
Top Cited Papers
- 29 September 2006
- proceedings article
- Published by Association for Computing Machinery (ACM)
- p. 122-133
- https://doi.org/10.1145/1161089.1161104
Abstract
Wireless sensor networks are tightly associated with the underlying environment in which the sensors are deployed. The global topology of the network is of great importance to both sensor network applications and the implementation of networking functionalities. In this paper we study the problem of topology discovery, in particular, identifying boundaries in a sensor network. Suppose a large number of sensor nodes are scattered in a geometric region, with nearby nodes communicating with each other directly. Our goal is to find the boundary nodes by using only connectivity information. We do not assume any knowledge of the node locations or inter-distances, nor do we enforce that the communication graph follows the unit disk graph model. We propose a simple, distributed algorithm that correctly detects nodes on the boundaries and connects them into meaningful boundary cycles. We obtain as a byproduct the medial axis of the sensor field, which has applications in creating virtual coordinates for routing. We show by extensive simulation that the algorithm gives good results even for networks with low density. We also prove rigorously the correctness of the algorithm for continuous geometric domains.Keywords
This publication has 14 references indexed in Scilit:
- Hole detection orPublished by Association for Computing Machinery (ACM) ,2006
- Locating and Bypassing Holes in Sensor NetworksMobile Networks and Applications, 2006
- Topological hole detection in wireless sensor networks and its applicationsPublished by Association for Computing Machinery (ACM) ,2005
- MAPPublished by Association for Computing Machinery (ACM) ,2005
- Timing-sync protocol for sensor networksPublished by Association for Computing Machinery (ACM) ,2003
- Nearest common ancestorsPublished by Association for Computing Machinery (ACM) ,2002
- GPSRPublished by Association for Computing Machinery (ACM) ,2000
- An Optimal Algorithm for Euclidean Shortest Paths in the PlaneSIAM Journal on Computing, 1999
- Voronoi diagrams and offset curves of curvilinear polygonsComputer-Aided Design, 1998
- A new algorithm for shortest paths among obstacles in the planeAnnals of Mathematics and Artificial Intelligence, 1991