A Socially Aware Routing Based on Local Contact Information in Delay-Tolerant Networks

In delay-tolerant networks, network topology changes dynamically and there is no guarantee of continuous connectivity between any two nodes. These features make DTN routing one of important research issues, and the application of social network metrics has led to the design of recent DTN routing schemes. In this paper, we propose an efficient routing scheme by using a node's local contact history and social network metrics. Each node first chooses a proper relay node based on the closeness to the destination node. A locally computed betweenness centrality is additionally utilized to enhance the routing efficiency. Through intensive simulation, we finally demonstrate that our algorithm performs efficiently compared to the existing epidemic or friendship routing scheme.

[1]  Timur Friedman,et al.  Evaluating Mobility Pattern Space Routing for DTNs , 2005, Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications.

[2]  Young-Sik Jeong,et al.  An Efficient Routing Scheme Based on Social Relations in Delay-Tolerant Networks , 2014 .

[3]  Amin Vahdat,et al.  Epidemic Routing for Partially-Connected Ad Hoc Networks , 2009 .

[4]  L. Freeman.  Centrality in social networks conceptual clarification , 1978 .

[5]  Pan Hui,et al.  BUBBLE Rap: Social-Based Forwarding in Delay-Tolerant Networks , 2008, IEEE Transactions on Mobile Computing.

[6]  Young-Sik Jeong,et al.  Betweenness of Expanded Ego Networks in Sociality-Aware Delay Tolerant Networks , 2013 .

[7]  Vinton G. Cerf,et al.  Delay-Tolerant Networking Architecture , 2007, RFC.

[8]  Cauligi S. Raghavendra,et al.  Spray and wait: an efficient routing scheme for intermittently connected mobile networks , 2005, WDTN '05.

[9]  Anders Lindgren,et al.  Probabilistic Routing in Intermittently Connected Networks , 2004, SAPIR.

[10]  Vijay Erramilli,et al.  Diversity of forwarding paths in pocket switched networks , 2007, IMC '07.

[11]  Peter V. Marsden,et al.  Egocentric and sociocentric measures of network centrality , 2002, Soc. Networks.

[12]  Anders Lindgren,et al.  Probabilistic routing in intermittently connected networks , 2003, MOCO.

[13]  Anis Yazidi,et al.  An Adaptive Approach to Learning the Preferences of Users in a Social Network Using Weak Estimators , 2012, J. Inf. Process. Syst..

[14]  Cristina Comaniciu,et al.  Beyond traditional DTN routing: social networks for opportunistic communication , 2011, IEEE Communications Magazine.

[15]  David Kotz,et al.  Localized Bridging Centrality for Distributed Network Analysis , 2008, 2008 Proceedings of 17th International Conference on Computer Communications and Networks.

[16]  Wanlei Zhou,et al.  SpringerBriefs in Computer Science , 2015 .

[17]  D. K. Lobiyal,et al.  Performance evaluation of data aggregation for cluster-based wireless sensor network , 2013, Human-centric Computing and Information Sciences.

[18]  Boleslaw K. Szymanski,et al.  Friendship Based Routing in Delay Tolerant Mobile Social Networks , 2010, 2010 IEEE Global Telecommunications Conference GLOBECOM 2010.

[19]  Martin Everett,et al.  Ego network betweenness , 2005, Soc. Networks.

[20]  Mads Haahr,et al.  Social Network Analysis for Information Flow in Disconnected Delay-Tolerant MANETs , 2009, IEEE Transactions on Mobile Computing.

[21]  Ioannis Stavrakakis,et al.  On the Local Approximations of Node Centrality in Internet Router-Level Topologies , 2013, IWSOS.