loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
22nd International Conference on Advanced Information Networking and Applications - Workshops (aina workshops 2008)
Geographical Routing in Intermittently Connected Ad Hoc Networks
March 25-March 28
ISBN: 978-0-7695-3096-3
ASCII Text
x 
 
Erik Kuiper, Simin Nadjm-Tehrani, "Geographical Routing in Intermittently Connected Ad Hoc Networks," Advanced Information Networking and Applications Workshops, International Conference on, pp. 1690-1695, 22nd International Conference on Advanced Information Networking and Applications - Workshops (aina workshops 2008), 2008.
 
 
BibTex
x
 
@article{ 10.1109/WAINA.2008.132,
author = {Erik Kuiper and Simin Nadjm-Tehrani},
title = {Geographical Routing in Intermittently Connected Ad Hoc Networks},
journal ={Advanced Information Networking and Applications Workshops, International Conference on},
volume = {0},
year = {2008},
isbn = {978-0-7695-3096-3},
pages = {1690-1695},
doi = {http://doi.ieeecomputersociety.org/10.1109/WAINA.2008.132},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - CONF
JO - Advanced Information Networking and Applications Workshops, International Conference on
TI - Geographical Routing in Intermittently Connected Ad Hoc Networks
SN - 978-0-7695-3096-3
SP1690
EP1695
A1 - Erik Kuiper,
A1 - Simin Nadjm-Tehrani,
PY - 2008
KW - routing
KW - ad hoc networks
KW - intermittent connectivity
KW - delay tolerant networks
VL - 0
JA - Advanced Information Networking and Applications Workshops, International Conference on
ER -
 
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.
Index Terms:
routing, ad hoc networks, intermittent connectivity, delay tolerant networks
Citation:
Erik Kuiper, Simin Nadjm-Tehrani, "Geographical Routing in Intermittently Connected Ad Hoc Networks," ainaw, pp.1690-1695, 22nd International Conference on Advanced Information Networking and Applications - Workshops (aina workshops 2008), 2008
Usage of this product signifies your acceptance of the Terms of Use.