Abstract
In this paper, we address the problem of routing in delay tolerant networks (DTN). In such networks there is no guarantee of finding a complete communication path connecting the source and destination at any time, especially when the destination is not in the same region as the source, which makes traditional routing protocols inefficient in that transmission of the messages between nodes. We propose to combine the routing protocol MaxProp and the model of “transfer by delegation” (custody transfer) to improve the routing in DTN networks and to exploit nodes as common carriers of messages between the network partitioned. To implement this approach and assess those improvements and changes we developed a DTN simulator. Simulation examples are illustrated in the article.
Highlights
Delay tolerant networks are wireless mobile ad hoc often where a communication path between a source node and destination node does not exist, either directly or through established routes by intermediate nodes. This situation occurs if the network is sparse and partitioned into several areas due to high mobility, low density nodes or when the network extends over long distances; In these cases, the traditional routing protocols have been developed for mobile ad hoc networks proved to be insufficient because they require the existence of a dense and connected in order to route the packets, To resolve this problem of routing in delay tolerant networks (DTN) networks, researchers have proposed the use of routing approaches based on the Principe Store-Carry-and-forward [1], such as: The epidemic routing protocol [2]: Messages propagate through the network like an outbreak of disease
Our approach is to combine the two approaches to routing, MaxProp [3] and the model of “transfer by delegation” [1,4,5] to overcome the problems of routing in DTN networks. To evaluate these improvements and changes we have developed a DTN simulator written in Java which is based on our approach
In this work we have developed a DTN simulator written in Java which is based on our approach to evaluate the different routing parameters
Summary
Delay tolerant networks are wireless mobile ad hoc often where a communication path between a source node and destination node does not exist, either directly or through established routes by intermediate nodes This situation occurs if the network is sparse and partitioned into several areas due to high mobility, low density nodes or when the network extends over long distances; In these cases, the traditional routing protocols have been developed for mobile ad hoc networks proved to be insufficient because they require the existence of a dense and connected in order to route the packets, To resolve this problem of routing in DTN networks, researchers have proposed the use of routing approaches based on the Principe Store-Carry-and-forward [1], such as: The epidemic routing protocol [2]: Messages propagate through the network like an outbreak of disease. To evaluate these improvements and changes we have developed a DTN simulator written in Java which is based on our approach
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
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: International Journal of Communications, Network and System Sciences
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.
