Disseminating real-time messages in opportunistic mobile social networks: A ranking perspective

There has been a significant body of work on evaluating node criticality in information networks. However, most of the existing works are developed for static networks and are not applicable to dynamic settings where connectivities among nodes change frequently over time. In this paper, we treat an opportunistic mobile social network as a time-evolving, dynamic graph, and propose a scheme to ascertain the information dissemination capability for each node based on its contact history. In particular, we analyze the node importance in spreading or forwarding real-time messages which are assumed to become less important or even stale over time. To this end, we take a dynamic walk counting approach to calculate all possible temporal-spatial routes associated with each node, by using the down-weighting method. Since the age of a message increases with time, the old walks are discounted to represent the fading influence on the target node. Extensive experiments are conducted based on 4 real-world trace datasets, and the results show that, our analytical result is effective at ranking the node criticality in disseminating or acquiring real-time messages in opportunistic mobile social networks.

[1]  Ryan A. Rossi,et al.  Modeling dynamic behavior in large evolving graphs , 2013, WSDM.

[2]  Pan Hui,et al.  Wireless Epidemic Spread in Dynamic Human Networks , 2008, BIOWIRE.

[3]  Peter Grindrod,et al.  A Matrix Iteration for Dynamic Network Summaries , 2013, SIAM Rev..

[4]  Cecilia Mascolo,et al.  Exploiting temporal complex network metrics in mobile malware containment , 2010, 2011 IEEE International Symposium on a World of Wireless, Mobile and Multimedia Networks.

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

[6]  Nathan Eagle,et al.  Persistence and periodicity in a dynamic proximity network , 2012, ArXiv.

[7]  Mohan Kumar,et al.  Opportunities in Opportunistic Computing , 2010, Computer.

[8]  Jari Saramäki,et al.  Temporal Networks , 2011, Encyclopedia of Social Network Analysis and Mining.

[9]  Mark C. Parsons,et al.  Communicability across evolving networks. , 2011, Physical review. E, Statistical, nonlinear, and soft matter physics.

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

[11]  Mark Newman,et al.  Networks: An Introduction , 2010 .

[12]  Marco Conti,et al.  Routing Issues in Opportunistic Networks , 2009, Middleware for Network Eccentric and Mobile Applications.

[13]  Feng Xia,et al.  A Survey on Routing and Data Dissemination in Opportunistic Mobile Social Networks , 2013, ArXiv.

[14]  Philip S. Yu,et al.  GraphScope: parameter-free mining of large time-evolving graphs , 2007, KDD '07.

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