DTN Routing Algorithm for Networks with Nodes Social Behavior

Andrzej Marek Dziekoński, Radoslaw Olgierd Schoeneich


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.


DTN, routing algorithm, social behavior

Full Text:



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.

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

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

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

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

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

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

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

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.

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.

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

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

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

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

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.

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

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

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

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

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.

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.

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

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.

A. Keranen; J. Ott; T.Karkkainen (2009); The ONE simulator for DTN protocol evaluation, roc. of the SimuTools: DOI: 10.4108/ICST.SIMUTOOLS2009.5674.

DOI: https://doi.org/10.15837/ijccc.2016.4.1454

Copyright (c) 2017 Andrzej Marek Dziekoński, Radoslaw Olgierd Schoeneich

Creative Commons License
This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.

CC-BY-NC  License for Website User

Articles published in IJCCC user license are protected by copyright.

Users can access, download, copy, translate the IJCCC articles for non-commercial purposes provided that users, but cannot redistribute, display or adapt:

  • Cite the article using an appropriate bibliographic citation: author(s), article title, journal, volume, issue, page numbers, year of publication, DOI, and the link to the definitive published version on IJCCC website;
  • Maintain the integrity of the IJCCC article;
  • Retain the copyright notices and links to these terms and conditions so it is clear to other users what can and what cannot be done with the  article;
  • Ensure that, for any content in the IJCCC article that is identified as belonging to a third party, any re-use complies with the copyright policies of that third party;
  • Any translations must prominently display the statement: "This is an unofficial translation of an article that appeared in IJCCC. Agora University  has not endorsed this translation."

This is a non commercial license where the use of published articles for commercial purposes is forbiden. 

Commercial purposes include: 

  • Copying or downloading IJCCC articles, or linking to such postings, for further redistribution, sale or licensing, for a fee;
  • Copying, downloading or posting by a site or service that incorporates advertising with such content;
  • The inclusion or incorporation of article content in other works or services (other than normal quotations with an appropriate citation) that is then available for sale or licensing, for a fee;
  • Use of IJCCC articles or article content (other than normal quotations with appropriate citation) by for-profit organizations for promotional purposes, whether for a fee or otherwise;
  • Use for the purposes of monetary reward by means of sale, resale, license, loan, transfer or other form of commercial exploitation;

    The licensor cannot revoke these freedoms as long as you follow the license terms.

[End of CC-BY-NC  License for Website User]

INTERNATIONAL JOURNAL OF COMPUTERS COMMUNICATIONS & CONTROL (IJCCC), With Emphasis on the Integration of Three Technologies (C & C & C),  ISSN 1841-9836.

IJCCC was founded in 2006,  at Agora University, by  Ioan DZITAC (Editor-in-Chief),  Florin Gheorghe FILIP (Editor-in-Chief), and  Misu-Jan MANOLESCU (Managing Editor).

Ethics: This journal is a member of, and subscribes to the principles of, the Committee on Publication Ethics (COPE).

Ioan  DZITAC (Editor-in-Chief) at COPE European Seminar, Bruxelles, 2015:

IJCCC is covered/indexed/abstracted in Science Citation Index Expanded (since vol.1(S),  2006); JCR2018: IF=1.585..

IJCCC is indexed in Scopus from 2008 (CiteScore2018 = 1.56):

Nomination by Elsevier for Journal Excellence Award Romania 2015 (SNIP2014 = 1.029): Elsevier/ Scopus

IJCCC was nominated by Elsevier for Journal Excellence Award - "Scopus Awards Romania 2015" (SNIP2014 = 1.029).

IJCCC is in Top 3 of 157 Romanian journals indexed by Scopus (in all fields) and No.1 in Computer Science field by Elsevier/ Scopus.


 Impact Factor in JCR2018 (Clarivate Analytics/SCI Expanded/ISI Web of Science): IF=1.585 (Q3). Scopus: CiteScore2018=1.56 (Q2);

SCImago Journal & Country Rank

Editors-in-Chief: Ioan DZITAC & Florin Gheorghe FILIP.