Locating and bypassing routing holes in sensor networks

Many algorithms for routing in sensor networks exploit greedy forwarding strategies to get packets to their destinations. We study a fundamental difficulty such strategies face: the "local minimum phenomena" that can cause packets to get stuck. We give a definition of stuck nodes where packets may get stuck in greedy multi-hop forwarding, and develop a local rule, the TENT rule, for each node in the network to test whether a packet can get stuck at that node. To help the packets get out of stuck nodes, we describe a distributed algorithm, BOUNDHOLE, to build routes around holes, which are connected regions of the network with boundaries consisting of all the stuck nodes. We show that these hole-surrounding routes can be used in many applications such as geographic routing, path migration, information storage mechanisms and identification of regions of interest.

[1]  Roger Wattenhofer,et al.  Asymptotically optimal geometric mobile ad-hoc routing , 2002, DIALM '02.

[2]  Martin Mauve,et al.  A survey on position-based routing in mobile ad hoc networks , 2001, IEEE Netw..

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

[4]  Roger Wattenhofer,et al.  Worst-Case optimal and average-case efficient geometric ad-hoc routing , 2003, MobiHoc '03.

[5]  Deborah Estrin,et al.  Dimensions: why do we need a new data handling architecture for sensor networks? , 2003, CCRV.

[6]  Deborah Estrin,et al.  Geographical and Energy Aware Routing: a recursive data dissemination protocol for wireless sensor networks , 2002 .

[7]  Leonidas J. Guibas,et al.  Geometric spanners for routing in mobile networks , 2005 .

[8]  Andy Hopper,et al.  A new location technique for the active office , 1997, IEEE Wirel. Commun..

[9]  Mani B. Srivastava,et al.  Dynamic fine-grained localization in Ad-Hoc networks of sensors , 2001, MobiCom '01.

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

[11]  Deborah Estrin,et al.  GHT: a geographic hash table for data-centric storage , 2002, WSNA '02.

[12]  Michael Ian Shamos,et al.  Computational geometry: an introduction , 1985 .

[13]  Jörg Liebeherr,et al.  Application-layer multicasting with Delaunay triangulation overlays , 2002, IEEE J. Sel. Areas Commun..

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

[15]  David R. Karger,et al.  A scalable location service for geographic ad hoc routing , 2000, MobiCom '00.