A Direction Based Geographic Routing Scheme for Intermittently Connected Mobile Networks

In delay tolerant network, a complete routing path from a source to a destination can not be guaranteed at most of the time. Therefore, traditional routing method for ad hoc network is not applicable in these situations. Current approaches for such networks are primarily based on redundant transmissions and single copy direct routing. However, they incur either high overhead due to excessive transmissions or long delays due to the incorrect path choices during forwarding. In this paper, we propose a direction based geographic routing scheme (DIG) for the intermittently connected network. Relying on the geographic location information, the packets are routed in a approximate ideal path to the destination, which significantly reduces the resource required in flooding-based algorithm and lead to decreased delay compared to the direct routing. Theoretical analyzes and simulations show that compared to the epidemic routing and direct routing, DIG provides nearly optimal delay with very low overhead.

[1]  Matthias Grossglauser,et al.  Age matters: efficient route discovery in mobile ad hoc networks using encounter ages , 2003, MobiHoc '03.

[2]  Prosenjit Bose,et al.  Online Routing in Convex Subdivisions , 2000, ISAAC.

[3]  Jörg Widmer,et al.  Network coding for efficient communication in extreme networks , 2005, WDTN '05.

[4]  Peng Ning,et al.  A beacon-less location discovery scheme for wireless sensor networks , 2005, Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies..

[5]  Young-Jin Kim,et al.  Geographic routing made practical , 2005, NSDI.

[6]  Amin Vahdat,et al.  Epidemic Routing for Partially-Connected Ad Hoc Networks , 2009 .

[7]  Thierry Turletti,et al.  Routing in Delay-Tolerant Networks Comprising Heterogeneous Node Populations , 2009, IEEE Transactions on Mobile Computing.

[8]  Donald F. Towsley,et al.  Performance modeling of epidemic routing , 2006, Comput. Networks.

[9]  J. Moy,et al.  OSPF: Anatomy of an Internet Routing Protocol , 1998 .

[10]  Ellen W. Zegura,et al.  A message ferrying approach for data delivery in sparse mobile ad hoc networks , 2004, MobiHoc '04.

[11]  Ivan Stojmenovic,et al.  On delivery guarantees of face and combined greedy-face routing in ad hoc and sensor networks , 2006, MobiCom '06.

[12]  Rabin K. Patra,et al.  Routing in a delay tolerant network , 2004, SIGCOMM '04.

[13]  Margaret Martonosi,et al.  Erasure-coding based routing for opportunistic networks , 2005, WDTN '05.

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

[15]  Arun Venkataramani,et al.  DTN routing as a resource allocation problem , 2007, SIGCOMM '07.

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

[17]  Qun Li,et al.  Communication in disconnected ad hoc networks using message relay , 2003, J. Parallel Distributed Comput..

[18]  Vinton G. Cerf,et al.  Delay-tolerant networking: an approach to interplanetary Internet , 2003, IEEE Commun. Mag..

[19]  David A. Maltz,et al.  Dynamic Source Routing in Ad Hoc Wireless Networks , 1994, Mobidata.

[20]  Devavrat Shah,et al.  Throughput-delay trade-off in wireless networks , 2004, IEEE INFOCOM 2004.

[21]  Ting-Chao Hou,et al.  Transmission Range Control in Multihop Packet Radio Networks , 1986, IEEE Trans. Commun..

[22]  Zygmunt J. Haas,et al.  Resource and performance tradeoffs in delay-tolerant wireless networks , 2005, WDTN '05.

[23]  Zhen Liu,et al.  Capacity, delay and mobility in wireless ad-hoc networks , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

[24]  Paul A. S. Ward,et al.  Practical Routing in Delay-Tolerant Networks , 2005, IEEE Transactions on Mobile Computing.

[25]  Hao Wu,et al.  MDDV: a mobility-centric data dissemination algorithm for vehicular networks , 2004, VANET '04.

[26]  Laurent El Ghaoui,et al.  Convex Optimization Methods for Sensor Node Position Estimation , 2001, INFOCOM.

[27]  K. Psounis,et al.  Efficient Routing in Intermittently Connected Mobile Networks: The Single-Copy Case , 2008, IEEE/ACM Transactions on Networking.

[28]  Anders Lindgren,et al.  Probabilistic Routing in Intermittently Connected Networks , 2004, SAPIR.

[29]  Waylon Brunette,et al.  Data MULEs: modeling and analysis of a three-tier architecture for sparse sensor networks , 2003, Ad Hoc Networks.

[30]  Leonard Kleinrock,et al.  Optimal Transmission Ranges for Randomly Distributed Packet Radio Terminals , 1984, IEEE Trans. Commun..

[31]  Ben Leong,et al.  Path vector face routing: geographic routing with local face information , 2005, 13TH IEEE International Conference on Network Protocols (ICNP'05).

[32]  Robert Tappan Morris,et al.  Geographic Routing Without Planarization , 2006, NSDI.

[33]  Yong Wang,et al.  Energy-efficient computing for wildlife tracking: design tradeoffs and early experiences with ZebraNet , 2002, ASPLOS X.

[34]  Haiying Shen,et al.  GSR: A Geographic Single-copy Routing Scheme in Intermittently Connected Mobile Networks , 2008, ICWN.

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

[36]  David Tse,et al.  Mobility increases the capacity of ad hoc wireless networks , 2002, TNET.

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

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

[39]  Anders Lindgren,et al.  Probabilistic routing in intermittently connected networks , 2003, MOCO.

[40]  Brian Neil Levine,et al.  A survey of practical issues in underwater networks , 2006, MOCO.

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