Directional forward routing for disruption tolerant networks

Authors:
Xin Wang;Yantai Shu;Zhigang Jin;Huan Chen
Affiliations:
School of Computer Science & Technology, Tianjin University, Tianjin, China;School of Computer Science & Technology, Tianjin University, Tianjin, China;School of Computer Science & Technology, Tianjin University, Tianjin, China;School of Computer Science & Technology, Tianjin University, Tianjin, China
Venue:
APCC'09 Proceedings of the 15th Asia-Pacific conference on Communications
Year:
2009

Citing 8
Cited 0

The Cricket location-support system

MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
Probabilistic routing in intermittently connected networks

ACM SIGMOBILE Mobile Computing and Communications Review
A message ferrying approach for data delivery in sparse mobile ad hoc networks

Proceedings of the 5th ACM international symposium on Mobile ad hoc networking and computing
Routing in a delay tolerant network

Proceedings of the 2004 conference on Applications, technologies, architectures, and protocols for computer communications
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
Spray and wait: an efficient routing scheme for intermittently connected mobile networks

Proceedings of the 2005 ACM SIGCOMM workshop on Delay-tolerant networking
Routing in intermittently connected mobile ad hoc networks and delay tolerant networks: overview and challenges

IEEE Communications Surveys & Tutorials
Delay-tolerant networking: an approach to interplanetary Internet

IEEE Communications Magazine

Quantified Score

Hi-index	0.00

Visualization

Abstract

In Disruption Tolerant Networks, aggressive packet forwarding scheme like flooding has a major drawback in terms of network congestion. In this paper, we proposed a new routing algorithm, called Directional Forward Routing (DFR). DFR caches the position information of neighbors, and selects the appropriate relays according to the directional angles among these neighbors and the destination. Meanwhile, DFR arranges the forwarding sequence and the dropping priority based on their assigned weight. The weight is determined by the Replication Density, Delivery Predictability, and TTL. A unique feature of DFR is that it has an ACK vector exchange mechanism that is used to purge the redundant messages. An extensive simulation of DFR using various scenarios was carried out and its performance was compared to well known DTN routing protocols: Epidemic Routing, Randomized Routing and Spray-and-Wait Routing. Our results show that DFR outperforms them in all scenarios in terms of packet delay and delivery.