Distributing content updates over a mobile social network

We study the dissemination of content updates, such as news or traffic information, over a mobile social network. In this application, mobile users receive content updates from their service provider. To improve coverage and increase capacity, we assume that they also share such updates, opportunistically, whenever they meet. We show that the service provider can allocate its downlink bandwidth so that it maximizes the aggregate utility over all users, i.e., the social welfare. Moreover, 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.

[1]  Stratis Ioannidis,et al.  On the strength of weak ties in mobile social networks , 2009, SNS '09.

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

[3]  M. Vojnovic,et al.  The Random Trip Model: Stability, Stationary Regime, and Perfect Simulation , 2006, IEEE/ACM Transactions on Networking.

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

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

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

[7]  Jean-Yves Le Boudec,et al.  The age of gossip: spatial mean field regime , 2009, SIGMETRICS '09.

[8]  U. Feige,et al.  Spectral Graph Theory , 2015 .

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

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