Vector routing protocols for Delay Tolerant Networks
by Hyunwoo Kang, Dongkyun Kim
International Journal of Ad Hoc and Ubiquitous Computing (IJAHUC), Vol. 6, No. 1, 2010

Abstract: In Delay Tolerant Networks (DTNs) with frequent network partitioning, routing packets is a challenge, because the successful establishment of an end-to-end path between source and destination nodes is not guaranteed. Typical routing protocols for DTNs depend on data replications over multiple paths for reliable data delivery. Since they invoke a lot of replicated packets, we propose three efficient Vector Routing protocols based on the vector of node movements in order to reduce the number of such replications: Flooding-based, History-based and Location-aware Vector Routing protocols. Using ns-2 simulation with two different mobility models, we verify that Vector Routing protocols show better performance than other existing protocols in terms of less amount of traffic incurred without loss of packet delivery ratio.

Online publication date: Fri, 02-Jul-2010

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Ad Hoc and Ubiquitous Computing (IJAHUC):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com