Holes Detection in Anisotropic Sensornets: Topological Methods

Wireless sensor networks (WSNs) are tightly linked with the practical environment in which the sensors are deployed. Sensor positioning is a pivotal part of main location-dependent applications that utilize sensornets. The global topology of the network is important to both sensor network applications and the implementation of networking functionalities. This paper studies the topology discovery with an emphasis on boundary recognition in a sensor network. A large mass of sensor nodes are supposed to scatter in a geometric region, with nearby nodes communicating with each other directly. This paper is thus designed to detect the holes in the topological architecture of sensornets only by connectivity information. Existent edges determination methods hold the high costs as assumptions. Without the help of a large amount of uniformly deployed seed nodes, those schemes fail in anisotropic WSNs with possible holes. To address this issue, we propose a solution, named PPA based on Poincare-Perelman Theorem, to judge whether there are holes in WSNs-monitored areas. Our solution can properly detect holes on the topological surfaces and connect them into meaningful boundary cycles. The judging method has also been rigorously proved to be appropriate for continuous geometric domains as well as discrete domains. Extensive simulations have been shown that the algorithm even enables networks with low density to produce good results.

[1]  Gaetano Borriello,et al.  Location Systems for Ubiquitous Computing , 2001, Computer.

[2]  Leonidas J. Guibas,et al.  Locating and Bypassing Holes in Sensor Networks , 2006, Mob. Networks Appl..

[3]  Jie Gao,et al.  MAP: Medial axis based geometric routing in sensor networks , 2007, Wirel. Networks.

[4]  Young-Jin Kim,et al.  Geographic routing made practical , 2005, NSDI.

[5]  Leonidas J. Guibas,et al.  GLIDER: gradient landmark-based distributed routing for sensor networks , 2005, Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies..

[6]  Stefan Funke,et al.  Topological hole detection in wireless sensor networks and its applications , 2005, DIALM-POMC '05.

[7]  Abubakr Muhammad,et al.  Coverage and hole-detection in sensor networks via homology , 2005, IPSN 2005. Fourth International Symposium on Information Processing in Sensor Networks, 2005..

[8]  Stefan Funke,et al.  Hole detection or: "how much geometry hides in connectivity?" , 2006, SCG '06.

[9]  Feng Li,et al.  UNFOLD: uniform fast on-line boundary detection for dynamic 3D wireless sensor networks , 2011, MobiHoc '11.

[10]  Sándor P. Fekete,et al.  Neighborhood-Based Topology Recognition in Sensor Networks , 2004, ALGOSENSORS.

[11]  Brad Karp,et al.  GPSR: greedy perimeter stateless routing for wireless networks , 2000, MobiCom '00.

[12]  Louise E. Moser,et al.  An analysis of the optimum node density for ad hoc mobile networks , 2001, ICC 2001. IEEE International Conference on Communications. Conference Record (Cat. No.01CH37240).

[13]  P. Davies The American heritage dictionary of the English language , 1981 .

[14]  Edsger W. Dijkstra,et al.  A note on two problems in connexion with graphs , 1959, Numerische Mathematik.

[15]  Ivan Stojmenovic,et al.  Routing with Guaranteed Delivery in Ad Hoc Wireless Networks , 1999, DIALM '99.

[16]  Sándor P. Fekete,et al.  Deterministic boundary recognition and topology extraction for large sensor networks , 2005, SODA '06.

[17]  Tarek F. Abdelzaher,et al.  Range-free localization schemes for large scale sensor networks , 2003, MobiCom '03.

[18]  Deborah Estrin,et al.  Complex Behavior at Scale: An Experimental Study of Low-Power Wireless Sensor Networks , 2002 .

[19]  William Morris The American Heritage dictionary of the English language , 1969 .

[20]  Josef Stoer,et al.  Numerische Mathematik 1 , 1989 .

[21]  L. S. Pontryagin,et al.  General Topology I , 1990 .