Stefan Funke
ABSTRACT
The identification of holes in a wireless sensor network is of primary interest since the breakdown of sensor nodes in a larger area often indicates one of the special events to be monitored by the network in the first place (e.g. outbreak of a fire, destruction by an earthquakes etc.). This task of identifying holes is especially challenging since typical wireless sensor networks consist of lightweight, low-capability nodes that are unaware of their geographic location.But there is also a secondary interest in detecting holes in a network: recently routing schemes have been proposed that do not assume knowledge of the geographic location of the network nodes but rather perform routing decisions based on the topology of the communication graph. Holes are salient features of the topology of a communication graph.In the first part of this paper we propose a simple distributed procedure to identify nodes near the boundary of the sensor field as well as near hole boundaries. Our hole detection algorithm is based purely on the topology of the communication graph, i.e. the only information available is which nodes can communicate with each other. In the second part of this paper we illustrate the secondary interest of our hole detection procedure using several examples.
- A. Arora, R. Ramnath, P. Sinha, and et al. Project exscal. In Proc. 1st Int. IEEE Conf. on Distributed Computing in Sensor Systems (DCOSS), 2005. Google Scholar
Digital Library
- P. Bose, P. Morin, I. Stojmenovic, and J. Urrutia. Routing with guaranteed delivery in ad hoc wireless networks. Wireless Networks, 7(6):609--616, 2001. Google ScholarDigital Library
- J. Bruck, J. Gao, and A. Jiang. Map: Medial-axis-based geometric routing in sensor networks. Proc. MobiCom, 2005. Google ScholarDigital Library
- D. De Couto and R. Morris. Location proxies and intermediate node forwarding for practical geographic forwarding, MIT-LCS-TR824, 2001.Google Scholar
- Q. Fang, J. Gao, and L. Guibas. Locating and bypassing routing holes in sensor networks. In 23rd Conf. of the IEEE Communications Society (INFOCOM), 2004. Google ScholarDigital Library
- S. P. Fekete, A. Kröller, D. Pfisterer, S. Fischer, and C. Buschmann. Neighborhood-based topology recognition in sensor networks. In ALGOSENSORS, 2004.Google ScholarCross Ref
- B. Karp and H. T. Kung. GPSR: greedy perimeter stateless routing for wireless networks. In Mobile Computing and Networking, pages 243--254, 2000. Google ScholarDigital Library
- F. Kuhn, R. Wattenhofer, and A. Zollinger. Asymptotically optimal geometric mobile ad-hoc routing. In Proc. DIAL-M, 2002. Google ScholarDigital Library
- Fabian Kuhn and Aaron Zollinger. Ad-hoc networks beyond unit disk graphs. In Proc. DIALM-POMC, pages 69--78, 2003. Google ScholarDigital Library
- T. Moscibroda and R. Wattenhofer. Maximal independent sets in radio networks. In 24th ACM Symp. on the Principles of Distributed Computing (PODC), 2005. Google ScholarDigital Library
- Radhika Nagpal, Howard E. Shrobe, and Jonathan Bachrach. Organizing a global coordinate system from local information on an ad hoc sensor network. In Proc. IPSN, 2003. Google ScholarDigital Library
- L. Guibas Q. Fang, J. Gao, V. de Silva, and L. Zhang. Glider: Gradient landmark-based distributed routing for sensor networks. In 24rd Conf. of the IEEE Communications Society (INFOCOM), 2005.Google ScholarCross Ref
- A. Rao, S. Ratnasamy, C. Papadimitriou, S. Shenker, and I. Stoica. Geographic routing without location information. In Proc. MobiCom, 2003. Google ScholarDigital Library
- E. Royer and C. Toh. A review of current routing protocols for ad-hoc mobile wireless networks. In IEEE Personal Communications, 1999.Google ScholarCross Ref
- Y. Shang, W. Ruml, Y. Zhang, and M. Fromherz. Localization from mere connectivity. In MobiHoc'03, 2003. Google ScholarDigital Library
Index Terms
- Topological hole detection in wireless sensor networks and its applications
Recommendations
Hole detection or: "how much geometry hides in connectivity?"
SCG '06: Proceedings of the twenty-second annual symposium on Computational geometryWireless sensor networks typically consist of small, very simple network nodes without any positioning device like GPS. After an initialization phase, the nodes know with whom they can talk directly, but have no idea about their relative geographic ...
Topological and combinatorial coverage hole detection in coordinate-free wireless sensor networks
Wireless sensor network WSN coverage completeness is an important quality of service QoS. It is frequently assumed that events occurring in the sensor field can always be detected. However, this is not necessarily the case, particularly if there are ...
On Boundary Recognition without Location Information in Wireless Sensor Networks
IPSN '08: Proceedings of the 7th international conference on Information processing in sensor networksBoundary recognition is an important and challenging issue in wireless sensor networks when no coordinates or distances are available. The distinction between inner and boundary nodes of the network can provide valuable knowledge to a broad spectrum of ...
Comments