Geographical Routing in Intermittently Connected Ad Hoc Networks
Authors:
- Erik KuiperEKErik Kuiper
- Simin Nadjm-TehraniSNSimin Nadjm-Tehrani
- 1 January 2008
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1690-1695
Abstract
In intermittently connected ad hoc networks standard routing protocols like AODV, DSR and GPSR fail since they generally cannot find a contemporaneous path from source to destination. In this paper we present LAROD, a geographical routing protocol for intermittently connected networks. Combining beacon less geographical routing with store-carry-forward LAROD greedily searches for the shortest way to the destination and when no progress is possible packets are temporarily stored until node mobility has created a new path. In the paper we have shown by a comparative study that LAROD has almost as good delivery rate as an epidemic routing scheme, but at a substantially lower overhead.Keywords
This publication has 9 references indexed in Scilit:
- Dynamic Source Routing in Ad Hoc Wireless Networks2007
- Mobility Models for UAV Group Reconnaissance Applications2006
- Knowledge-Based Opportunistic Forwarding in Vehicular Wireless Ad Hoc Networks2005
- Single-copy routing in intermittently connected mobile networks2005
- Spray and wait2005
- Stationary distributions for the random waypoint mobility modelIEEE Transactions on Mobile Computing, 2004
- Towards realistic mobility models for mobile ad hoc networks2003
- GPSR2000
- Ad-hoc on-demand distance vector routing1999