LASS: Local-Activity and Social-Similarity Based Data Forwarding in Mobile Social Networks

This paper aims to design an efficient data forwarding scheme based on local activity and social similarity(LASS) for mobile social networks (MSNs). Various definitions of social similarity have been proposed as the criterion for relay selection, which results in various forwarding schemes. The appropriateness and practicality of various definitions determine the performances of these forwarding schemes. A popular definition has recently been proven to be more efficient than other existing ones, i.e., the more common interests between two nodes, the larger social similarity between them. In this work, we show that schemes based on such definition ignore the fact that members within the same community, i.e., with the same interest, usually have different levels of local activity, which will result in a low efficiency of data delivery. To address this, in this paper, we design a new data forwarding scheme for MSNs based on community detection in dynamic weighted networks, called Local-Activity and Social-Similarity, taking into account the difference of members' internal activity within each community, i.e., local activity. To the best of our knowledge, the proposed scheme is the first one that utilizes different levels of local activity within communities. Through extensive simulations, we demonstrate that LASS achieves better performance than state-of-the-art protocols.

[1]  M E J Newman,et al.  Community structure in social and biological networks , 2001, Proceedings of the National Academy of Sciences of the United States of America.

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

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

[4]  Chen-Nee Chuah,et al.  Knowledge-based opportunistic forwarding in vehicular wireless ad hoc networks , 2005, 2005 IEEE 61st Vehicular Technology Conference.

[5]  Cecilia Mascolo,et al.  Adaptive routing for intermittently connected mobile ad hoc networks , 2005, Sixth IEEE International Symposium on a World of Wireless Mobile and Multimedia Networks.

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

[7]  T. Vicsek,et al.  Uncovering the overlapping community structure of complex networks in nature and society , 2005, Nature.

[8]  Brian Gallagher,et al.  MaxProp: Routing for Vehicle-Based Disruption-Tolerant Networks , 2006, Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications.

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

[10]  Jean-Loup Guillaume,et al.  Fast unfolding of communities in large networks , 2008, 0803.0476.

[11]  Andrea Lancichinetti,et al.  Detecting the overlapping and hierarchical community structure in complex networks , 2008, 0802.1218.

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

[13]  David Lazer,et al.  Inferring friendship network structure by using mobile phone data , 2009, Proceedings of the National Academy of Sciences.

[14]  Zhengding Lu,et al.  Community mining on dynamic weighted directed graphs , 2009, CIKM-CNIKM.

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

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

[17]  Andrea Lancichinetti,et al.  Community detection algorithms: a comparative analysis: invited presentation, extended abstract , 2009, VALUETOOLS.

[18]  Jiawei Han,et al.  A Particle-and-Density Based Evolutionary Clustering Method for Dynamic Networks , 2009, Proc. VLDB Endow..

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

[20]  Mason A. Porter,et al.  Communities in Networks , 2009, ArXiv.

[21]  Andrea Lancichinetti,et al.  Benchmarks for testing community detection algorithms on directed and weighted graphs with overlapping communities. , 2009, Physical review. E, Statistical, nonlinear, and soft matter physics.

[22]  Qinghua Li,et al.  Multicasting in delay tolerant networks: a social network perspective , 2009, MobiHoc '09.

[23]  Qinghua Li,et al.  Routing in Socially Selfish Delay Tolerant Networks , 2010, 2010 Proceedings IEEE INFOCOM.

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

[25]  M. Hasler,et al.  Network community-detection enhancement by proper weighting. , 2011, Physical review. E, Statistical, nonlinear, and soft matter physics.

[26]  Nam P. Nguyen,et al.  Overlapping communities in dynamic networks: their detection and mobile applications , 2011, MobiCom.

[27]  Dusit Niyato,et al.  Applications, Architectures, and Protocol Design Issues for Mobile Social Networks: A Survey , 2011, Proceedings of the IEEE.

[28]  Zongpeng Li,et al.  Stochastic optimal multirate multicast in socially selfish wireless networks , 2012, 2012 Proceedings IEEE INFOCOM.

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

[30]  Marián Boguñá,et al.  Popularity versus similarity in growing networks , 2011, Nature.

[31]  Kate Ching-Ju Lin,et al.  Preference-aware content dissemination in opportunistic mobile social networks , 2012, 2012 Proceedings IEEE INFOCOM.

[32]  Athanasios V. Vasilakos,et al.  Understanding user behavior in online social networks: a survey , 2013, IEEE Communications Magazine.

[33]  Jie Wu,et al.  Geocommunity-Based Broadcasting for Data Dissemination in Mobile Social Networks , 2012 .