Journal
WIRELESS NETWORKS
Volume 25, Issue 7, Pages 4037-4048Publisher
SPRINGER
DOI: 10.1007/s11276-018-01934-z
Keywords
Mobile adhoc networks; Delay tolerant networks; Social routing
Ask authors/readers for more resources
In traditional Mobile Adhoc Networks routing algorithms, the existence of a sustainable path between the source and destination is a crucial issue. These algorithms are shown to be unsuccessful in Delay Tolerant Networks (DTNs) since the network is almost disrupted, and then such a path is not guaranteed. Although Store-and-Forward routing approach has provided an adequate solution for these networks, it suffers from the large end-to-end delay and the additional traffic and communication costs incurring the network. This study presents an efficient single-copy home-based routing scheme for DTNs. Two different scenarios, referred as blind and semi-blind, are considered based on the amount of available knowledge about the destination. Simulation results presented in this paper demonstrate that the performance of the proposed scheme is closely approaching the unrestricted flooding algorithm, the Epidemic. Moreover, the proposed scheme provides a low communication cost, an outstanding end-to-end delay and a high successful delivery ratio as compared to state-of-art algorithms.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available