Randomized AB-Face-AB Routing Algorithms in Mobile Ad Hoc Networks

One common design for routing protocols in mobile ad hoc networks is to use positioning information. We combine the class of randomized position-based routing strategies called AB (Above-Below) algorithms with face routing to form AB:FACE2:AB routing algorithms, a new class of hybrid routing algorithms in mobile ad hoc networks. Our experiments on unit disk graphs, and their associated Yao sub-graphs and Gabriel sub-graphs, show that the delivery rates of the AB:FACE2:AB algorithms are significantly better than either class of routing algorithms alone when routing is subject to a threshold count beyond which the packet is dropped. The best delivery rates were obtained on the Yao subgraph. With the appropriate choice of threshold, on non-planar graphs, the delivery rates are equivalent to those of face routing (with no threshold) while, on average, discovering paths to their destinations that are several times shorter.

[1]  Joachim Gudmundsson,et al.  Ordered theta graphs , 2004, CCCG.

[2]  Ivan Stojmenovic,et al.  Position Based Routing Algorithms for Ad Hoc Networks: A Taxonomy , 2004 .

[3]  Fabian Kuhn,et al.  Ad-hoc networks beyond unit disk graphs , 2003, DIALM-POMC '03.

[4]  Lata Narayanan,et al.  A generalization of the FACE ROUTING algorithm to a class of non-planar networks , 2005, The Second Annual International Conference on Mobile and Ubiquitous Systems: Networking and Services.

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

[6]  Prosenjit Bose,et al.  Online Routing in Triangulations , 1999, SIAM J. Comput..

[7]  Lata Narayanan,et al.  Randomized Routing Algorithms in Mobile Ad Hoc Networks , 2004, MWCN.

[8]  Andrew Chi-Chih Yao,et al.  On Constructing Minimum Spanning Trees in k-Dimensional Spaces and Related Problems , 1977, SIAM J. Comput..

[9]  Ivan Stojmenovic,et al.  Loop-Free Hybrid Single-Path/Flooding Routing Algorithms with Guaranteed Delivery for Wireless Networks , 2001, IEEE Trans. Parallel Distributed Syst..

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

[11]  Rahul Jain,et al.  Geographical routing using partial information for wireless ad hoc networks , 2001, IEEE Wirel. Commun..

[12]  Giri Narasimhan,et al.  Approximating Geometric Bottleneck Shortest Paths , 2003, STACS.

[13]  Lali Barrière,et al.  Robust position-based routing in wireless ad hoc networks with irregular transmission ranges , 2003, Wirel. Commun. Mob. Comput..

[14]  Gregory G. Finn,et al.  Routing and Addressing Problems in Large Metropolitan-Scale Internetworks. ISI Research Report. , 1987 .

[15]  Imrich Chlamtac,et al.  A distance routing effect algorithm for mobility (DREAM) , 1998, MobiCom '98.

[16]  Jorge Urrutia,et al.  Compass routing on geometric networks , 1999, CCCG.

[17]  David G. Kirkpatrick,et al.  On the Spanning Ratio of Gabriel Graphs and beta-skeletons , 2002, LATIN.

[18]  Jie Wu,et al.  Internal Node and Shortcut Based Routing with Guaranteed Delivery in Wireless Networks , 2004, Cluster Computing.

[19]  Ivan Stojmenovic,et al.  Power and cost aware localized routing with guaranteed delivery in wireless networks , 2002, Proceedings ISCC 2002 Seventh International Symposium on Computers and Communications.

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

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

[22]  Kaoru Sezaki,et al.  A proposal of geographical routing protocols for location‐aware services , 2004 .

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

[24]  R. Sokal,et al.  A New Statistical Approach to Geographic Variation Analysis , 1969 .

[25]  Xiang-Yang Li,et al.  Power efficient and sparse spanner for wireless ad hoc networks , 2001, Proceedings Tenth International Conference on Computer Communications and Networks (Cat. No.01EX495).