Community Based Routing in Social Delay Tolerant Networks

Since communication devices are carried by people in a great number of delay tolerant networks, delay tolerant networks are one kind of social networks to some extent. Analyzing social properties has become an important issue in designing efficient routing protocols. In this paper, a more accurate and comprehensive metric for detecting the quality of the relationships between nodes is proposed considering contact time, contact frequency and contact regularity. Then an overlapping hierarchical community detection method is designed based on this new metric and a tree structure is built. Furthermore, we exploit the overlapping community structure and the tree structure to provide message forwarding path from source node to destination node. Simulation results show that our routing method based on overlapping hierarchical community detection (ROCD)achieves better delivery rate than the classic routing protocols SimBet and Bubble Rap without affecting the average delay.

[1]  K. Psounis,et al.  Efficient Routing in Intermittently Connected Mobile Networks: The Single-Copy Case , 2008, IEEE/ACM Transactions on Networking.

[2]  Ying Zhu,et al.  A Survey of Social-Based Routing in Delay Tolerant Networks: Positive and Negative Social Effects , 2013, IEEE Communications Surveys & Tutorials.

[3]  Pan Hui,et al.  BUBBLE Rap: Social-Based Forwarding in Delay-Tolerant Networks , 2011 .

[4]  M E J Newman,et al.  Finding and evaluating community structure in networks. , 2003, Physical review. E, Statistical, nonlinear, and soft matter physics.

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

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

[7]  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.

[8]  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.

[9]  Thomas F. La Porta,et al.  On Exploiting Transient Social Contact Patterns for Data Forwarding in Delay-Tolerant Networks , 2013, IEEE Transactions on Mobile Computing.

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

[11]  Boleslaw K. Szymanski,et al.  Overlapping community detection in networks: The state-of-the-art and comparative study , 2011, CSUR.

[12]  Howard Falk.  Applications, Architectures, and Protocol Design Issues for Mobile Social Networks: A Survey , 2011, Proc. IEEE.

[13]  Eytan Modiano,et al.  Proceedings of the 8th ACM international symposium on Mobile ad hoc networking and computing , 2007, MobiCom 2007.

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

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

[16]  Song Guo,et al.  On Social Delay-Tolerant Networking: Aggregation, Tie Detection, and Routing , 2014, IEEE Transactions on Parallel and Distributed Systems.

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

[18]  Zygmunt J. Haas,et al.  Performance Analysis of Epidemic Routing for Delay-Tolerant Networks , 2014 .

[19]  Zheng Guo,et al.  Prediction Assisted Single-Copy Routing in Underwater Delay Tolerant Networks , 2010, 2010 IEEE Global Telecommunications Conference GLOBECOM 2010.

[20]  Margaret Martonosi,et al.  Erasure-coding based routing for opportunistic networks , 2005, WDTN '05.

[21]  Lixin Gao,et al.  Estimation based erasure-coding routing in delay tolerant networks , 2006, IWCMC '06.