Predicting missing contacts in mobile social networks

Experimentally measured contact traces, such as those obtained in a conference setting by using short range wireless sensors, are usually limited with respect to the practical number of sensors that can be deployed as well as available human volunteers. Moreover, most previous experiments in this field are partial since not everyone participating in the experiment is expected to carry a sensor device. Previously collected contact traces have significantly contributed to development of more realistic human mobility models. This in turn has influenced proposed routing algorithms for Delay Tolerant Networks where human contacts play a vital role in message delivery. By exploiting time-spatial properties of contact graphs as well as popularity and social information of mobile nodes, we propose a novel method to reconstruct the missing parts of contact graphs where only a subset of nodes are able to sense human contacts.

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

[2]  Jure Leskovec,et al.  Predicting positive and negative links in online social networks , 2010, WWW '10.

[3]  D. Goldberg,et al.  Assessing experimentally derived interactions in a small world , 2003, Proceedings of the National Academy of Sciences of the United States of America.

[4]  Vijay Sivaraman,et al.  Experimental study of mobility in the soccer field with application to real-time athlete monitoring , 2010, 2010 IEEE 6th International Conference on Wireless and Mobile Computing, Networking and Communications.

[5]  Piyush Gupta,et al.  Critical Power for Asymptotic Connectivity in Wireless Networks , 1999 .

[6]  Anders Lindgren,et al.  Opportunistic content distribution in an urban setting , 2006, CHANTS '06.

[7]  Duncan J. Watts,et al.  Collective dynamics of ‘small-world’ networks , 1998, Nature.

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

[9]  Ahmed Helmy,et al.  Modeling Spatial and Temporal Dependencies of User Mobility in Wireless Mobile Networks , 2008, IEEE/ACM Transactions on Networking.

[10]  Alexander Lazovik,et al.  International Conference on Pervasive Computing and Communications Workshops , 2012 .

[11]  Albert,et al.  Emergence of scaling in random networks , 1999, Science.

[12]  D. Lazer,et al.  Inferring Social Network Structure using Mobile Phone Data , 2006 .

[13]  David Liben-Nowell,et al.  The link-prediction problem for social networks , 2007 .

[14]  Jon M. Kleinberg,et al.  Small-World Phenomena and the Dynamics of Information , 2001, NIPS.

[15]  Kazem Jahanbakhsh,et al.  Predicting missing contacts in mobile social networks , 2011, WOWMOM.

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

[17]  Kazem Jahanbakhsh,et al.  Predicting human contacts in mobile social networks using supervised learning , 2012, SIMPLEX '12.

[18]  Christophe Diot,et al.  Experiences from measuring human mobility using Bluetooth inquiring devices , 2007, MobiEval '07.

[19]  Christophe Diot,et al.  Are you moved by your social network application? , 2008, WOSN '08.

[20]  Kazem Jahanbakhsh,et al.  Social-Greedy: a socially-based greedy routing algorithm for delay tolerant networks , 2010, MobiOpp '10.

[21]  Marcelo Dias de Amorim,et al.  The Accordion Phenomenon: Analysis, Characterization, and Impact on DTN Routing , 2009, IEEE INFOCOM 2009.

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

[23]  Cecilia Mascolo,et al.  A community based mobility model for ad hoc network research , 2006, REALMAN '06.

[24]  Mathew D. Penrose,et al.  Random Geometric Graphs , 2003 .

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

[26]  Chang Wu Yu.  Computing subgraph probability of random geometric graphs with applications in quantitative analysis of ad hoc networks , 2009, IEEE Journal on Selected Areas in Communications.

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

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

[29]  M. McPherson,et al.  Birds of a Feather: Homophily in Social Networks , 2001 .