Abstract
In delay tolerant networks (DTNs), the network may not be fully connected at any instant of time, but connections occurring between nodes at different times make the network connected through the entire time continuum. In such a case, traditional routing methods fail to operate because there are no contemporaneous end-to-end paths between sources and destinations. This study examines the routing in DTNs where connections arise in a periodic nature. We analyze various levels of periodicity in order to meet the requirements of different network models. We propose different routing algorithms for different kinds of periodic connections. Our proposed routing methods guarantee the earliest delivery time and minimum hop-count, simultaneously. We evaluate our routing schemes via extensive simulation experiments and compare them to some other popular routing approaches proposed for DTNs. Our evaluations show the feasibility and effectiveness of our schemes as viable routing methods for delay tolerant networks.
Highlights
In delay tolerant networks (DTNs) [1] an end-to-end path between a source and destination is not guaranteed to exist at any time instant
The greedy approach taken by the algorithm produces routes that are suboptimal in hop count. We address this problem with our min-hop earliest delivery routing (MHED) algorithm, which finds paths that guarantee the earliest delivery and are minimal in hop count
We analyzed our algorithms in terms of transmission count, path length, delivery time, and routing tree stability
Summary
In delay tolerant networks (DTNs) [1] an end-to-end path between a source and destination is not guaranteed to exist at any time instant. We propose an algorithm based on Dijkstra’s shortest path algorithm, with customizations to meet the requirements of this simple connection model This algorithm guarantees the earliest delivery (ED), and is optimal in terms of time. We provide the most general version of our ED routing algorithm using this connection model It computes future contact times and exploits the connection periods. Rather than a wait phase, it has a focus phase, in which single copies are forwarded to maximize a utility function Another alternative is Encounter-based Routing [18], which uses contact history when selecting nodes to spray. We can calculate perfect shortest routes given source, destination, packet generation/arrival time, and connection establishment time between nodes.
Sign-in/Register to view highlights & summary Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: EURASIP Journal on Wireless Communications and Networking
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
