By Topic

Adaptive Priority Routing with Ack_Mechanism for DTN networks

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Zhigang Jin ; Tianjin Univ., Tianjin, China ; Ximan Zhao ; Yongmei Luo ; Dongxue Zhao

In Disruption Tolerant Networks, simply flooding packet scheme has a major drawback in terms of network congestion. This paper proposes a new routing algorithm, called Adaptive Priority Routing with Ack_mechanism (APRA). APRA arranges the forwarding sequence and the dropping sequence based on their assigned priority. The priority is determined by the TTL, Delivery Predictability, and Replication Density. Meanwhile APRA has an ACK list exchange mechanism that is used to purge the redundant messages. An extensive simulation of APRA 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 APRA outperforms them in all scenarios in terms of packet delay and delivery.

Published in:

Wireless Communications & Signal Processing, 2009. WCSP 2009. International Conference on

Date of Conference:

13-15 Nov. 2009