Mobility-based routing algorithm in delay tolerant networks
Marcin Kawecki , Radosław Olgierd Schoeneich
AbstractThe 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.
|Journal series||EURASIP Journal on Wireless Communications and Networking, ISSN 1687-1499, (A 20 pkt)|
|Publication size in sheets||0.5|
|Keywords in English||Disruption tolerant networking, Mobile ad hoc networks, Mobile communication, Routing protocols, Wireless networks|
|ASJC Classification||; ;|
|Project||The Develpment of Digital Communicatios. Project leader: Siuzdak Jerzy,
, Phone: +48 22 234-7868, start date 27-04-2015, end date 31-12-2016, IT/2015/statut, Completed
|Score|| = 20.0, 02-01-2020, ArticleFromJournal|
= 20.0, 02-01-2020, ArticleFromJournal
|Publication indicators||= 5; = 10; = 10.0; : 2016 = 0.935; : 2016 = 1.529 (2) - 2016=1.558 (5)|
|Citation count*||10 (2020-01-01)|
* presented citation count is obtained through Internet information analysis and it is close to the number calculated by the Publish or Perish system.