Abstract
The paper presents a routing algorithm based on the use of the mobility of the nodes in the Delay and Disruptive Tolerant Networks (DTN). DTN are characterized by temporary or permanent lack of a continuous path between the source and the destination node. The communication is done by ferrying the message by intermediate nodes based on store-carry-forward paradigm. Our routing algorithm is based on the ability to use information about node mobility and their contacts. We assume that the greater mobility of node results in higher number of contacts with other nodes and higher probability in message delivery to the destination. The proposed algorithm was simulated using The One simulation tool. We compare the performance of our algorithm and other popular routing algorithms.
Highlights
Internet network over the past several years achieved a huge success in the communication between devices
5 Conclusions Proper and efficient data transfer is a key issue for Disruptive Tolerant Networks (DTN)
Existing algorithms based on the “flooding” technique can reach a high probability of message delivery
Summary
Internet network over the past several years achieved a huge success in the communication between devices. The solution allows for far less number of transmissions compared to the Epidemic routing and is faster and more efficient than the algorithms based on the transfer of one or more copies of messages in the network. Presented in this work replication algorithm achieves high probability of message delivery while maintaining low overhead.
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
Free) 
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 call
