Vector routing protocols for Delay Tolerant Networks

Authors:
Hyunwoo Kang;Dongkyun Kim
Affiliations:
School of Electrical Engineering and Computer Science, Kyungpook National University, 702-701, Korea.;Kyungpook National University, 702-701, Korea
Venue:
International Journal of Ad Hoc and Ubiquitous Computing
Year:
2010

Citing 8
Cited 1

GPSR: greedy perimeter stateless routing for wireless networks

MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
Energy-efficient computing for wildlife tracking: design tradeoffs and early experiences with ZebraNet

Proceedings of the 10th international conference on Architectural support for programming languages and operating systems
Probabilistic routing in intermittently connected networks

ACM SIGMOBILE Mobile Computing and Communications Review
Using redundancy to cope with failures in a delay tolerant network

Proceedings of the 2005 conference on Applications, technologies, architectures, and protocols for computer communications
Erasure-coding based routing for opportunistic networks

Proceedings of the 2005 ACM SIGCOMM workshop on Delay-tolerant networking
Spray and wait: an efficient routing scheme for intermittently connected mobile networks

Proceedings of the 2005 ACM SIGCOMM workshop on Delay-tolerant networking
Resource and performance tradeoffs in delay-tolerant wireless networks

Proceedings of the 2005 ACM SIGCOMM workshop on Delay-tolerant networking
Routing performance analysis of human-driven delay tolerant networks using the truncated levy walk model

Proceedings of the 1st ACM SIGMOBILE workshop on Mobility models

Performance analysis of epidemic routing in DTNs with limited forwarding times and selfish nodes

International Journal of Ad Hoc and Ubiquitous Computing

Quantified Score

Hi-index	0.00

Visualization

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.