A probabilistic home-based routing scheme for delay tolerant networks

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 guara...

Full description

Saved in:
Bibliographic Details
Published in:Wireless networks 2019-10, Vol.25 (7), p.4037-4048
Main Authors: Alhasanat, Abdullah, Alhasanat, Mohanad, Althunibat, Saud, Matrouk, Khaled
Format: Article
Language:English
Subjects:
Ad hoc networks
Algorithms
Communications Engineering
Communications traffic
Computer Communication Networks
Computer simulation
Electrical Engineering
Engineering
Epidemics
Flooding
IT in Business
Networks
Routing
Traffic delay
Wireless networks
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
ISSN:1022-0038
1572-8196
DOI:10.1007/s11276-018-01934-z