DTN Routing Algorithm for Networks with Nodes Social Behavior

  • Andrzej Marek Dziekoński Warsaw University of Technology
  • Radoslaw Olgierd Schoeneich Warsaw University of Technology


This 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.

Author Biographies

Andrzej Marek Dziekoński, Warsaw University of Technology
Andrzej Marek Dziekonski (b. 1989) received his B.Sc. in Teleinformatics (2012)from Warsaw University of Technology. Now he is Master degree student of Telecommu-nications at Faculty of Electronics and Information Technology, Warsaw University ofTechnology, Warsaw.
Radoslaw Olgierd Schoeneich, Warsaw University of Technology
Radoslaw Olgierd Schoeneich b. 1981) received his M.Sc.(2005) and PhD (2010) inTelecommunications from Warsaw University of Technology, Poland. Currently, he isassistant professor at Warsaw University of Technology. His current research area focusesupon the routing protocols, data storage, manned and unmanned autonomius messageferries in Delay and Disruptive Tolerant Networks (DTN).


[1] T.Omari; G.Franks; M.Woodside (2005); On the effect of traffic model to the performance valuation of multicast protocols in MANET, Electrical and Computer Engineering, Canadian onference on, IEEE: 404-407.

[2] L. Pelusi; A. Passarella; M. Conti (2006); Opportunistic networking: data forwarding in isconnected mobile ad hoc networks, Communications Magazine, IEEE 44(11):134-141.

[3] S. Corson; J. Macker (1999); Mobile Ad hoc Networking (MANET): Routing Protocol Performance ssues and Evaluation Considerations, IETF RFC 2501, 1-11.

[4] A. Vahdat; d. Becker (2000); Epidemic routing for partially connected ad hoc networks, Technical eport CS-200006, Duke University.

[5] T. Spyropoulos; K. Psounis; C.S. Raghavendra (2005); Spray and Wait: An Efficient Routing cheme for Intermittently Connected Mobile Networks, Proc. of the 2005 ACM SIGCOMM orkshop on Delay-tolerant networking: 252-259

[6] A. Lindgren; A. Doria; E. Davies; and S. Grasic (2012); Probabilistic routing protocol for ntermittently connected networks, IETF RFC 6693, 1-8.

[7] J.Burgess; et al. (2006); MaxProp: Routing for Vehicle-Based Disruption-Tolerant Networks, NFOCOM, 1-11, DOI: 10.1109/INFOCOM.2006.228.

[8] D. Karamshuk; C. Boldrini; M. Conti; A. Passarella (2011); Human Mobility Models for pportunistic Networks, IEEE Communications Magazine, 49(12):157-165.

[9] D. Karamshuk; C. Boldrini; M. Conti; A. Passarella (2012); An Arrival-based Framework for uman Mobility Modeling, Proceedings of the IEEE International Symposium WoWMoM: -9.

[10] A. Passarella; M. Conti; C. Boldrini; R. I.M. Dunbar (2011); Modelling Inter-contact Times n Social Pervasive Networks, Proceedings of the ACM MSWiM: 333-340.

[11] C. Boldrini; M. Conti; A. Passarella (2007); Users Mobility Models for Opportunistic Networks: he Role of Physical Locations. Proceedings of the WRECOM07 : 1-6

[12] C. Boldrini; M. Conti; A. Passarella (2009) The Socialble Traveller: Human Travelling atterns in Social-Based Mobility, Proceedings of the MobiWAC: 34-41.

[13] P. Hui; J. Crowcroft (2007); How small labels create big improvements, Procedeengs ot the EEE PerCom: 65-70.

[14] P. Hui; J. Crowcroft; E. Yoneki (2011); Bubble rap: Social-based forwarding in delaytolerant etworks, Mobile Computing, IEEE Transactions, 10(11): 1576-1589.

[15] W. Gao; Q. Li; B. Zhao; G. Cao (2009); Multicasting in delay tolerant networks: a social etwork perspective networks, Proceedings of the ACM MobiHoc: 299-308.

[16] A. Mei; G.Morabito; P. Santi; J.Stefa (2011); Social-aware stateless forwarding in pocket witched networks, Proceedings of the IEEE INFOCOM: 251-255.

[17] Y. Zhang; J. Zhao (2009); Social network analysis on data diffusion in delay tolerant networks, roceedings of the ACM MobiHoc: 345-346.

[18] W. Gao; G. Cao (2011); User-centric data dissemination in disruption tolerant networks. roceedings of the IEEE INFOCOM: 3119-3127.

[19] F. Fabbri; R. Verdone (2011); A sociability-based routing scheme for delay-tolerant networks, URASIP Wireless Communications and Networking: 1-13.

[20] Y. Zhu; B. Xu; x. Shi; Y. Wang (2013); A survey of social-based routing in Delay Tolerant etworks: positive and negative social effects, IEEE Communications Surveys and Tutorials 15(1):387-401.

[21] E.Bulut; B. K. Szymanski (2010); Friendship based routing in delay tolerant mobile social etworks, Proceedings of the IEEE GLOBECOM, 10.1109/TPDS.2012.83, 23(12): 2254-2265.

[22] E. M. Daly; M. Haahr (2007); Social networks analysis for routing in disconnected delaytolerant anets, Proceedings of the MobiHoc: 32-40.

[23] C. Boldrini; M. Conti; A. Passarella (2012); Less is More: Long Paths do not Help the onvergence of Social-Oblivious Forwarding in Opportunistic Networks. Proceedings of the CM/SIGMOBILE MobiOpp: 1-8.

[24] A. Keranen; J. Ott; T.Karkkainen (2009); The ONE simulator for DTN protocol evaluation, roc. of the SimuTools: DOI: 10.4108/ICST.SIMUTOOLS2009.5674.
How to Cite
DZIEKOŃSKI, Andrzej Marek; SCHOENEICH, Radoslaw Olgierd. DTN Routing Algorithm for Networks with Nodes Social Behavior. INTERNATIONAL JOURNAL OF COMPUTERS COMMUNICATIONS & CONTROL, [S.l.], v. 11, n. 4, p. 457-471, july 2016. ISSN 1841-9844. Available at: <http://univagora.ro/jour/index.php/ijccc/article/view/1454>. Date accessed: 02 mar. 2021. doi: https://doi.org/10.15837/ijccc.2016.4.1454.


DTN, routing algorithm, social behavior