Scoop: decentralized and opportunistic multicasting of information streams
MobiCom '11 Proceedings of the 17th annual international conference on Mobile computing and networking
A density-aware routing scheme in delay tolerant networks
Proceedings of the 27th Annual ACM Symposium on Applied Computing
Dynamic DTN Routing Strategies Based on Knowledge
Wireless Personal Communications: An International Journal
| Hi-index | 0.00 |
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 Adaptive Randomized Epidemic Routing (ARER). ARER dynamically adjusts the forwarding probability for each message according to a new metric, Replications Density. Meanwhile, ARER arranges the forwarding sequence and the dropping priority based on their assigned weight. The weight is determined by the Replication Density, the delivery predictability, and TTL. An extensive simulation of ARER 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 ARER outperforms them in all scenarios in terms of packet delay and delivery.