Geographical Routing With Location Service in Intermittently Connected MANETs
Authors:
- 11 November 2010
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Vehicular Technology
- Vol. 60 (2) , 592-604
Abstract
Combining mobile platforms such as manned or unmanned vehicles and peer-assisted wireless communication is an enabler for a vast number of applications. A key enabler for the applications is the routing protocol that directs the packets in the network. Routing packets in fully connected mobile ad hoc networks (MANETs) has been studied to a great extent, but the assumption on full connectivity is generally not valid in a real system. This case means that a practical routing protocol must handle intermittent connectivity and the absence of end-to-end connections. In this paper, we propose a geographical routing algorithm called location-aware routing for delay-tolerant networks (LAROD), enhanced with a location service, location dissemination service (LoDiS), which together are shown to suit an intermittently connected MANET (IC-MANET). Because location dissemination takes time in IC-MANETs, LAROD is designed to route packets with only partial knowledge of geographic position. To achieve low overhead, LAROD uses a beaconless strategy combined with a position-based resolution of bids when forwarding packets. LoDiS maintains a local database of node locations, which is updated using broadcast gossip combined with routing overhearing. The algorithms are evaluated under a realistic application, i.e., unmanned aerial vehicles deployed in a reconnaissance scenario, using the low-level packet simulator ns-2. The novelty of this paper is the illustration of sound design choices in a realistic application, with holistic choices in routing, location management, and the mobility model. This holistic approach justifies that the choice of maintaining a local database of node locations is both essential and feasible. The LAROD-LoDiS scheme is compared with a leading delay-tolerant routing algorithm (spray and wait) and is shown to have a competitive edge, both in terms of delivery ratio and overhead. For spray and wait, this case involved a new packet-level implementation in ns-2 as opposed to the original connection-level custom simulator.Keywords
This publication has 22 references indexed in Scilit:
- Survey on diversity-based routing in wireless mesh networks: Challenges and solutionsComputer Communications, 2010
- Modeling mobility in disaster area scenariosPerformance Evaluation, 2009
- GeoDTN+Nav: Geographic DTN Routing with Navigator Prediction for Urban Vehicular EnvironmentsMobile Networks and Applications, 2009
- Gossiping on MANETsACM SIGOPS Operating Systems Review, 2007
- Dynamic Source Routing in Ad Hoc Wireless Networks2007
- Evaluating the limitations of and alternatives in beaconingAd Hoc Networks, 2007
- Stationary distributions for the random waypoint mobility modelIEEE Transactions on Mobile Computing, 2004
- BLR: beacon-less routing algorithm for mobile ad hoc networksComputer Communications, 2004
- Contention-based forwarding for mobile ad hoc networksAd Hoc Networks, 2003
- A survey of mobility models for ad hoc network researchWireless Communications and Mobile Computing, 2002