On Social Delay-Tolerant Networking: Aggregation, Tie Detection, and Routing

Social-based routing protocols have shown their promising capability to improve the message delivery efficiency in Delay Tolerant Networks (DTNs). The efficiency greatly relies on the quality of the aggregated social graph that is determined by the metrics used to measure the strength of social connections. In this paper, we propose an improved metrics that leads to high-quality social graph by taking both frequency and duration of contacts into consideration. Furthermore, to improve the performance of social-based message transmission, we systematically study the community evolution problem that has been little investigated in the literation. Distributed algorithms based on the obtained social graph are developed such that the overlapping communities and bridge nodes (i.e., connecting nodes between communities) can be dynamically detected in an evolutionary social network. Finally, we take all the results above into our social-based routing design. Extensive trace-driven simulation results show that our routing algorithm outperforms existing social-based forwarding strategies significantly.

[1]  Guohong Cao,et al.  User-centric data dissemination in disruption tolerant networks , 2011, 2011 Proceedings IEEE INFOCOM.

[2]  Jie Wu,et al.  Social feature-based multi-path routing in delay tolerant networks , 2012, 2012 Proceedings IEEE INFOCOM.

[3]  Alex Pentland,et al.  Reality mining: sensing complex social systems , 2006, Personal and Ubiquitous Computing.

[4]  Mads Haahr,et al.  Social network analysis for routing in disconnected delay-tolerant MANETs , 2007, MobiHoc '07.

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

[6]  Elena Pagani,et al.  CRAWDAD dataset unimi/pmtr (v.2008-12-01) , 2008 .

[7]  T. Nepusz,et al.  Fuzzy communities and the concept of bridgeness in complex networks. , 2007, Physical review. E, Statistical, nonlinear, and soft matter physics.

[8]  Jure Leskovec,et al.  Statistical properties of community structure in large social and information networks , 2008, WWW.

[9]  Jie Wu,et al.  An Efficient Prediction-Based Routing in Disruption-Tolerant Networks , 2012, IEEE Transactions on Parallel and Distributed Systems.

[10]  Marco Conti,et al.  Opportunistic networking: data forwarding in disconnected mobile ad hoc networks , 2006, IEEE Communications Magazine.

[11]  Saleem N. Bhatti,et al.  CRAWDAD dataset st_andrews/sassy (v.2011-06-03) , 2011 .

[12]  Vinton G. Cerf,et al.  Delay-tolerant networking: an approach to interplanetary Internet , 2003, IEEE Commun. Mag..

[13]  Jörg Ott,et al.  The ONE simulator for DTN protocol evaluation , 2009, SIMUTools 2009.

[14]  Santo Fortunato,et al.  Community detection in graphs , 2009, ArXiv.

[15]  Pan Hui,et al.  How Small Labels Create Big Improvements , 2006, Fifth Annual IEEE International Conference on Pervasive Computing and Communications Workshops (PerComW'07).

[16]  Li Su,et al.  Contact duration aware evaluation for content dissemination delay in mobile social network , 2015, Wirel. Commun. Mob. Comput..

[17]  Thrasyvoulos Spyropoulos,et al.  Know Thy Neighbor: Towards Optimal Mapping of Contacts to Social Graphs for DTN Routing , 2010, 2010 Proceedings IEEE INFOCOM.

[18]  Jie Wu,et al.  On Multicopy Opportunistic Forwarding Protocols in Nondeterministic Delay Tolerant Networks , 2012, IEEE Transactions on Parallel and Distributed Systems.

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

[20]  Ke Xu,et al.  A Survey of Social-Aware Routing Protocols in Delay Tolerant Networks: Applications, Taxonomy and Design-Related Issues , 2014, IEEE Communications Surveys & Tutorials.

[21]  Mostafa H. Ammar,et al.  PeopleRank: Social Opportunistic Forwarding , 2010, 2010 Proceedings IEEE INFOCOM.

[22]  P. Jaccard,et al.  Etude comparative de la distribution florale dans une portion des Alpes et des Jura , 1901 .

[23]  Kevin R. Fall,et al.  A delay-tolerant network architecture for challenged internets , 2003, SIGCOMM '03.

[24]  Jörg Ott,et al.  The ONE simulator for DTN protocol evaluation , 2009, SimuTools.

[25]  Aidong Zhang,et al.  Bridging centrality: graph mining from element level to group level , 2008, KDD.

[26]  Pan Hui,et al.  Distributed community detection in delay tolerant networks , 2007, MobiArch '07.

[27]  Jie Wu,et al.  TOUR: Time-sensitive Opportunistic Utility-based Routing in delay tolerant networks , 2013, 2013 Proceedings IEEE INFOCOM.

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

[29]  Aidong Zhang,et al.  Bridging Centrality: Identifying Bridging Nodes in Scale-free Networks , 2006 .

[30]  Jeremie Leguay,et al.  CRAWDAD dataset upmc/rollernet (v.2009-02-02) , 2009 .

[31]  Jie Wu,et al.  LocalCom: A Community-based Epidemic Forwarding Scheme in Disruption-tolerant Networks , 2009, 2009 6th Annual IEEE Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks.