Minimizing Recovery State in Geographic Ad Hoc Routing

Geographic ad hoc networks use position information for routing. They often utilize stateless greedy forwarding and require the use of recovery algorithms when the greedy approach fails. We propose a novel idea based on virtual repositioning of nodes that allows to increase the efficiency of greedy routing and significantly increase the success of the recovery algorithm based on local information alone. We explain the problem of predicting dead ends which the greedy algorithm may reach and bypassing voids in the network, and introduce NEAR, node elevation ad-hoc routing, a solution that incorporates both virtual positioning and routing algorithms that improve performance in ad-hoc networks containing voids. We demonstrate by simulations the advantages of our algorithm over other geographic ad-hoc routing solutions.

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

[2]  G. Sicuranza,et al.  The landmark hierarchy: A new hierarchy for routing in very large networks , 1988 .

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

[4]  Pramod K. Varshney,et al.  A survey of void handling techniques for geographic routing in wireless networks , 2007, IEEE Communications Surveys & Tutorials.

[5]  Tomasz Imielinski,et al.  Mobile Computing , 1996 .

[6]  M. S. Corson,et al.  A highly adaptive distributed routing algorithm for mobile wireless networks , 1997, Proceedings of INFOCOM '97.

[7]  Béla Bollobás,et al.  Random Graphs , 1985 .

[8]  Nitin H. Vaidya,et al.  Location-aided routing (LAR) in mobile ad hoc networks , 1998, MobiCom '98.

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

[10]  Robert Morris,et al.  Location Proxies and Intermediate Node Forwarding for Practical Geographic Forwarding , 2001 .

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

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

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

[14]  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).

[15]  Young-Jin Kim,et al.  Practical and robust geographic routing in wireless networks , 2004, SenSys '04.

[16]  Mi Lu,et al.  A distributed algorithm for the dead end problem of location based routing in sensor networks , 2005, IEEE Transactions on Vehicular Technology.

[17]  Xiaoyan Hong,et al.  LANMAR: landmark routing for large scale wireless ad hoc networks with group mobility , 2000, 2000 First Annual Workshop on Mobile and Ad Hoc Networking and Computing. MobiHOC (Cat. No.00EX444).

[18]  Charles E. Perkins,et al.  Ad-hoc on-demand distance vector routing , 1999, Proceedings WMCSA'99. Second IEEE Workshop on Mobile Computing Systems and Applications.

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

[20]  Martin Mauve,et al.  A routing strategy for vehicular ad hoc networks in city environments , 2003, IEEE IV2003 Intelligent Vehicles Symposium. Proceedings (Cat. No.03TH8683).

[21]  Noriki Uchida,et al.  Packet loss rate control for continuous media over heterogeneous network , 2004, 18th International Conference on Advanced Information Networking and Applications, 2004. AINA 2004..

[22]  Zygmunt J. Haas,et al.  Ad Hoc mobility management with uniform quorum systems , 1999, TNET.

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

[24]  K. Rothermel,et al.  Spatial aware geographic Forwarding for mobile ad hoc networks , 2002 .

[25]  Srdjan Capkun,et al.  Self-organization in mobile ad hoc networks: the approach of Terminodes , 2001, IEEE Commun. Mag..

[26]  David A. Maltz,et al.  A performance comparison of multi-hop wireless ad hoc network routing protocols , 1998, MobiCom '98.

[27]  Charles E. Perkins,et al.  Highly dynamic Destination-Sequenced Distance-Vector routing (DSDV) for mobile computers , 1994, SIGCOMM.

[28]  Ivan Stojmenovic,et al.  A routing strategy and quorum based location update scheme for ad hoc wireless networks , 1999 .

[29]  C C. Chiang,et al.  Routing in Clustered Multihop, Mobile Wireless Networks With Fading Channel , 1997 .

[30]  Yuval Shavitt,et al.  Minimizing Recovery State in Geographic Ad Hoc Routing , 2009, IEEE Trans. Mob. Comput..

[31]  Kai Xu,et al.  TCP-Jersey for wireless IP communications , 2004, IEEE Journal on Selected Areas in Communications.

[32]  Michalis Faloutsos,et al.  Scalable ad hoc routing: the case for dynamic addressing , 2004, IEEE INFOCOM 2004.

[33]  David B. Johnson,et al.  Routing in Ad Hoc Networks of Mobile Hosts , 1994, 1994 First Workshop on Mobile Computing Systems and Applications.

[34]  Shu Du,et al.  Safari: A self-organizing, hierarchical architecture for scalable ad hoc networking , 2008, Ad Hoc Networks.

[35]  Himabindu Pucha,et al.  Performance comparison of scalable location services for geographic ad hoc routing , 2005, Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies..

[36]  Ivan Stojmenovic,et al.  Location based localized alternate, disjoint, multi-path and component routing schemes for wireless networks , 2001, MobiHoc '01.

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

[38]  H. T. Kung,et al.  Geographic routing for wireless networks , 2000 .

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

[40]  Paolo Santi.  The critical transmitting range for connectivity in mobile ad hoc networks , 2005, IEEE Transactions on Mobile Computing.

[41]  Xiaoyan Hong,et al.  LANMAR: landmark routing for large scale wireless ad hoc networks with group mobility , 1988, MobiHoc.

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

[43]  Ivan Stojmenovic,et al.  Position-based routing in ad hoc networks , 2002, IEEE Commun. Mag..