Mobility-based routing algorithm in delay tolerant networks

Marcin Kawecki , Radosław Olgierd Schoeneich

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.
Author Marcin Kawecki
Marcin Kawecki,,
-
, Radosław Olgierd Schoeneich IT
Radosław Olgierd Schoeneich,,
- The Institute of Telecommunications
Journal seriesEURASIP Journal on Wireless Communications and Networking, ISSN 1687-1499
Issue year2016
Vol81
Pages1-9
Publication size in sheets0.5
Keywords in EnglishDisruption tolerant networking, Mobile ad hoc networks, Mobile communication, Routing protocols, Wireless networks
DOIDOI:10.1186/s13638-016-0578-4
projectThe Develpment of Digital Communicatios. Project leader: Siuzdak Jerzy, , Phone: +48 22 234-7232, start date 27-04-2015, end date 31-12-2016, IT/2015/statut, Completed
WEiTI Działalność statutowa
Languageen angielski
File
2016 Kawecki Schoeneich Mobility-based.pdf / 895.28 KB / 2016 Kawecki Schoeneich Mobility-based.pdf 895.28 KB
Score (nominal)20
ScoreMinisterial score = 20.0, 27-03-2017, ArticleFromJournal
Ministerial score (2013-2016) = 20.0, 27-03-2017, ArticleFromJournal
Publication indicators WoS Impact Factor: 2016 = 1.529 (2) - 2016=1.558 (5)
Citation count*5 (2018-02-19)
Cite
Share Share



* presented citation count is obtained through Internet information analysis and it is close to the number calculated by the Publish or Perish system.
Back