Characterizing the impact of routing holes on geographic routing

The performance of geographic routing protocols is largely determined by the routing holes from which they must recover. In this paper we examine routing hole characteristics. In simulations of large networks of varying size and placement strategy we investigate (1) the size of routing holes, (2) the number of hops needed to escape from a routing hole, and (3) the likelihood of encountering a routing hole as a function of distance. Our results show the distribution of hops required to map a hole is skewed toward smaller values (/spl les/ 10 hops), and that the majority of holes can be circumvented in 4 hops or less. Interestingly, we find the probability of encountering a routing hole to be greatly affected by the distance in all but uniformly generated networks.

[1]  Ramesh Govindan,et al.  Understanding packet delivery performance in dense wireless sensor networks , 2003, SenSys '03.

[2]  Robert Tappan Morris,et al.  Performance of multihop wireless networks: shortest path is not enough , 2003, CCRV.

[3]  L. Asz.  Random Walks on Graphs: a Survey , 2022 .

[4]  Martin Mauve,et al.  Geographic routing in city scenarios , 2005, MOCO.

[5]  Leonidas J. Guibas,et al.  Locating and bypassing routing holes in sensor networks , 2004, IEEE INFOCOM 2004.

[6]  Brad Karp,et al.  Greedy Perimeter Stateless Routing for Wireless Networks , 2000 .

[7]  Reinhard Diestel,et al.  Graph Theory , 1997 .

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

[9]  David E. Culler,et al.  Taming the underlying challenges of reliable multihop routing in sensor networks , 2003, SenSys '03.

[10]  Scott Shenker,et al.  Geographic routing without location information , 2003, MobiCom '03.

[11]  Brad Karp,et al.  Challenges in geographic routing: sparse networks, obstacles, and traffic provisioning , 2001 .

[12]  Richard J. Lipton,et al.  Random walks, universal traversal sequences, and the complexity of maze problems , 1979, 20th Annual Symposium on Foundations of Computer Science (sfcs 1979).

[13]  Ahmed Helmy,et al.  Modeling and analyzing the impact of location inconsistencies on geographic routing in wireless networks , 2004, MOCO.

[14]  David E. Culler,et al.  Beacon vector routing: scalable point-to-point routing in wireless sensornets , 2005, NSDI.

[15]  Ahmed Helmy.  Small Large-Scale Wireless Networks: Mobility-Assisted Resource Discovery , 2002, ArXiv.

[16]  Yan Zhang,et al.  Geometric ad-hoc routing: of theory and practice , 2003, PODC '03.

[17]  Brad Karp,et al.  GPSR : Greedy Perimeter Stateless Routing for Wireless , 2000, MobiCom 2000.