DTN Routing Algorithm for Networks with Nodes Social Behavior
Andrzej Marek Dziekoński , Radosław Olgierd Schoeneich
AbstractThis article presents routing algorithm in Delay and Disruptive Tolerant Networks (DTN). The main idea of this work is routing method that is based on information about nodes social behavior and their social relations in sparse structure of network. The algorithm takes advantage of friendship relationships between nodes and uses historic information to create groups of friends for each node, which is used in buffer management and forwarding phase of routing. Beside the routing method, mechanisms of collecting and exchanging of maintenance information between nodes is described. The algorithm was tested using The ONE simulation tool especially designed for DTN scenario and compared with miscellaneous popular solutions.
|Journal series||International Journal of Computers Communications & Control, ISSN 1841-9836, (A 20 pkt)|
|Publication size in sheets||0.7|
|Keywords in English||DTN, routing algorithm, social behavior|
|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|| = 15.0, 02-02-2020, ArticleFromJournal|
= 20.0, 02-02-2020, ArticleFromJournal
|Publication indicators||= 2; = 3.0; : 2016 = 0.67; : 2016 = 1.374 (2) - 2016=1.193 (5)|
|Citation count*||3 (2020-02-03)|
* presented citation count is obtained through Internet information analysis and it is close to the number calculated by the Publish or Perish system.