Efficient Data Forwarding in Mobile Social Networks with Diverse Connectivity Characteristics

Mobile Social Network (MSN) with diverse connectivity characteristics is a combination of opportunistic network and mobile ad hoc network. Since the major difficulty of data forwarding is the opportunistic part, techniques designed for opportunistic networks are commonly used to forward data in MSNs. However, this may not be the best solution since they do not consider the ubiquitous existences of Transient Connected Components (TCCs), where nodes inside a TCC can reach each other by multi-hop wireless communications. In this paper, we first identify the existence of TCCs and analyze their properties based on five real traces. Then, we propose TCC-aware data forwarding strategies which exploit the special characteristics of TCCs to increase the contact opportunities and then improve the performance of data forwarding. Trace-driven simulations show that our TCC-aware data forwarding strategies outperform existing data forwarding strategies in terms of data delivery ratio and network overhead.

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

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

[3]  M. Newman.  Random Graphs as Models of Networks , 2002, cond-mat/0202208.

[4]  Alex Pentland,et al.  Sensing the "Health State" of a Community , 2012, IEEE Pervasive Computing.

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

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

[7]  Kevin C. Almeroth,et al.  Delay Tolerant Mobile Networks (DTMNs): Controlled Flooding in Sparse Mobile Networks , 2005, NETWORKING.

[8]  Christophe Diot,et al.  Impact of Human Mobility on Opportunistic Forwarding Algorithms , 2007, IEEE Transactions on Mobile Computing.

[9]  Paolo Toth,et al.  Knapsack Problems: Algorithms and Computer Implementations , 1990 .

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

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

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

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

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

[15]  Guohong Cao,et al.  On exploiting transient contact patterns for data forwarding in Delay Tolerant Networks , 2010, The 18th IEEE International Conference on Network Protocols.

[16]  Yonggang Wen,et al.  Community detection in weighted networks: Algorithms and applications , 2013, 2013 IEEE International Conference on Pervasive Computing and Communications (PerCom).

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

[18]  Arun Venkataramani,et al.  R3: robust replication routing in wireless networks with diverse connectivity characteristics , 2011, MobiCom '11.

[19]  Stratis Ioannidis,et al.  Optimal and scalable distribution of content updates over a mobile social network , 2009, IEEE INFOCOM 2009.

[20]  Fan Chung Graham,et al.  A Random Graph Model for Power Law Graphs , 2001, Exp. Math..

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

[22]  Christophe Diot,et al.  Dissemination in opportunistic social networks: the role of temporal communities , 2012, MobiHoc '12.

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

[24]  Marcelo Dias de Amorim,et al.  The strength of vicinity annexation in opportunistic networking , 2013, 2013 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS).

[25]  Bruce A. Reed,et al.  The Size of the Giant Component of a Random Graph with a Given Degree Sequence , 1998, Combinatorics, Probability and Computing.

[26]  Alex Pentland,et al.  Social fMRI: Investigating and shaping social mechanisms in the real world , 2011, Pervasive Mob. Comput..

[27]  Yang Zhang,et al.  V-PADA: Vehicle-Platoon-Aware Data Access in VANETs , 2011, IEEE Transactions on Vehicular Technology.

[28]  J. Navarro-Pedreño.  Numerical Methods for Least Squares Problems , 1996 .

[29]  Hermann Hellwagner,et al.  A hybrid MANET-DTN routing scheme for emergency response scenarios , 2013, 2013 IEEE International Conference on Pervasive Computing and Communications Workshops (PERCOM Workshops).