Optimal and scalable distribution of content updates over a mobile social network

We study the dissemination of dynamic content, such as news or traffic information, over a mobile social network. In this application, mobile users subscribe to a dynamic-content distribution service, offered by their service provider. To improve coverage and increase capacity, we assume that users share any content updates they receive with other users they meet. We make two contributions. First, we determine how the service provider can allocate its bandwidth optimally to make the content at users as "fresh" as possible. More precisely, we define a global fairness objective (namely, maximizing the aggregate utility over all users) and prove that the corresponding optimization problem can be solved by gradient descent. Second, we specify a condition under which the system is highly scalable: even if the total bandwidth dedicated by the service provider remains fixed, the expected content age at each user grows slowly (as log(n)) with the number of users n. To the best of our knowledge, our work is the first to address these two aspects (optimality and scalability) of the distribution of dynamic content over a mobile social network.

[1]  Pan Hui,et al.  A socio-aware overlay for publish/subscribe communication in delay tolerant networks , 2007, MSWiM '07.

[2]  Cecilia Mascolo,et al.  Designing mobility models based on social network theory , 2007, MOCO.

[3]  Jean-Yves Le Boudec,et al.  The Random Trip Model: Stability, Stationary Regime, and Perfect Simulation , 2006, IEEE/ACM Transactions on Networking.

[4]  Robert G. Gallager,et al.  Discrete Stochastic Processes , 1995 .

[5]  Joel Friedman,et al.  A proof of Alon's second eigenvalue conjecture and related problems , 2004, ArXiv.

[6]  Laurent Massoulié,et al.  The diameter of opportunistic mobile networks , 2007, CoNEXT '07.

[7]  Xiaoyan Hong,et al.  A group mobility model for ad hoc wireless networks , 1999, MSWiM '99.

[8]  VojnovicMilan,et al.  The random trip model , 2006 .

[9]  Cecilia Mascolo,et al.  Socially-aware routing for publish-subscribe in delay-tolerant mobile ad hoc networks , 2008, IEEE Journal on Selected Areas in Communications.

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

[11]  Richard J. Gibbens,et al.  Resource pricing and the evolution of congestion control , 1999, at - Automatisierungstechnik.

[12]  Wei Tsang Ooi,et al.  Analysis and implications of student contact patterns derived from campus schedules , 2006, MobiCom '06.

[13]  Krishna P. Gummadi,et al.  Exploiting Social Interactions in Mobile Systems , 2007, UbiComp.

[14]  Christos Gkantsidis,et al.  Random walks in peer-to-peer networks , 2004, IEEE INFOCOM 2004.

[15]  Stephen P. Boyd,et al.  Convex Optimization , 2004, Algorithms and Theory of Computation Handbook.

[16]  Jean-Yves Le Boudec,et al.  Power Law and Exponential Decay of Intercontact Times between Mobile Devices , 2007, IEEE Transactions on Mobile Computing.

[17]  Andreas Krause,et al.  Cost-effective outbreak detection in networks , 2007, KDD '07.

[18]  Donald F. Towsley,et al.  The effect of network topology on the spread of epidemics , 2005, Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies..

[19]  N. Linial,et al.  Expander Graphs and their Applications , 2006 .

[20]  Stephen P. Boyd,et al.  Randomized gossip algorithms , 2006, IEEE Transactions on Information Theory.

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

[22]  Pierre Brémaud,et al.  On the pathwise computation of derivatives with respect to the rate of a point process: The phantom RPA method , 1992, Queueing Syst. Theory Appl..

[23]  Fan Chung,et al.  Spectral Graph Theory , 1996 .

[24]  Vikram Srinivasan,et al.  PeopleNet: engineering a wireless virtual social network , 2005, MobiCom '05.

[25]  M. Benaïm.  Dynamics of stochastic approximation algorithms , 1999 .

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