Globs in the primordial soup: the emergence of connected crowds in mobile wireless networks

In many practical scenarios, nodes gathering at points of interest yield sizable connected components (clusters), which sometimes comprise the majority of nodes. While recent analysis of mobile networks focused on the process governing node encounters ("contacts"), this model is not particularly suitable for gathering behavior. In this paper, we propose a model of stochastic coalescence (merge) and fragmentation (split) of clusters. We implement this process as a Markov chain and derive analytically the exact stationary distribution of cluster size. Further, we prove that, as the number of nodes grows, the clustering behavior converges to a mean field, which is obtained as a closed-form expression. This expression translates the empirical merge and split rate of a scenario, a microscopic property, to an important macroscopic property - the cluster size distribution - with surprising accuracy. We validate all results with synthetic as well as real-world mobility traces from conference visitors and taxicabs with several thousand nodes.

[1]  CoalescenceDavid J. Aldous Stochastic Coalescence , 1998 .

[2]  M. Smoluchowski,et al.  Drei Vorträge über Diffusion, Brownsche Molekularbewegung und Koagulation von Kolloidteilchen , 1927 .

[3]  Piet Van Mieghem,et al.  Connectivity in Wireless Ad-hoc Networks with a Log-normal Radio Model , 2006, Mob. Networks Appl..

[4]  Kwan-Wu Chin,et al.  Implementation experience with MANET routing protocols , 2002, CCRV.

[5]  Pan Hui,et al.  Impact of Human Mobility on the Design of Opportunistic Forwarding Algorithms , 2006, Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications.

[6]  E. Jones Routing Strategies for Delay-Tolerant Networks , 2006 .

[7]  Anthony Unwin,et al.  Reversibility and Stochastic Networks , 1980 .

[8]  Pan Hui,et al.  Pocket switched networks and human mobility in conference environments , 2005, WDTN '05.

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

[10]  Ellen W. Zegura,et al.  Understanding the wireless and mobile network space: a routing-centered classification , 2007, CHANTS '07.

[11]  P. B. Dubovski,et al.  Existence, uniqueness and mass conservation for the coagulation-fragmentation equation , 1996 .

[12]  Jehoshua Bruck,et al.  Covering Algorithms, Continuum Percolation, and the Geometry of Wireless Networks. , 2003 .

[13]  Nitin H. Vaidya,et al.  Analysis of TCP Performance over Mobile Ad Hoc Networks , 1999, Wirel. Networks.

[14]  Robert Morris,et al.  Link-level measurements from an 802.11b mesh network , 2004, SIGCOMM 2004.

[15]  Cecilia Mascolo,et al.  Characterising temporal distance and reachability in mobile and online social networks , 2010, CCRV.

[16]  Cecilia Mascolo,et al.  CAR: Context-Aware Adaptive Routing for Delay-Tolerant Mobile Networks , 2009, IEEE Transactions on Mobile Computing.

[17]  J. P. Park The Identification Of Multiple Outliers , 2000 .

[18]  A. A Lushnikov,et al.  Coagulation in finite systems , 1978 .

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

[20]  Vijay Erramilli,et al.  Diversity of forwarding paths in pocket switched networks , 2007, IMC '07.

[21]  M. Smoluchowski,et al.  Drei Vortrage uber Diffusion, Brownsche Bewegung und Koagulation von Kolloidteilchen , 1916 .

[22]  Matthias Grossglauser,et al.  A parsimonious model of mobile partitioned networks with clustering , 2009, 2009 First International Communication Systems and Networks and Workshops.

[23]  Jörg Ott,et al.  Integrating DTN and MANET routing , 2006, CHANTS '06.

[24]  Matthias Grossglauser,et al.  Island Hopping: Efficient Mobility-Assisted Forwarding in Partitioned Networks , 2006, 2006 3rd Annual IEEE Communications Society on Sensor and Ad Hoc Communications and Networks.

[25]  Martin May,et al.  Analyzing the impact of mobility in ad hoc networks , 2006, REALMAN '06.

[26]  David A. Maltz,et al.  A performance comparison of multi-hop wireless ad hoc network routing protocols , 1998, MobiCom '98.

[27]  Bernhard Plattner,et al.  An empirical study of the impact of mobility on link failures in an 802.11 ad hoc network , 2008, IEEE Wireless Communications.

[28]  B. Granovsky,et al.  Asymptotic formula for a partition function of reversible coagulation-fragmentation processes , 2002, math/0207227.

[29]  Olivier Dousse,et al.  ASYMPTOTIC PROPERTIES OF WIRELESS MULTI-HOP NETWORK , 2005 .

[30]  Xu Li,et al.  Performance Evaluation of SUVnet With Real-Time Traffic Data , 2007, IEEE Transactions on Vehicular Technology.

[31]  M. Serrano,et al.  Percolation and epidemic thresholds in clustered networks. , 2006, Physical review letters.

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

[33]  M. Benaïm,et al.  A class of mean field interaction models for computer and communication systems , 2008, 2008 6th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks and Workshops.

[34]  Thomas G. Robertazzi,et al.  Critical connectivity phenomena in multihop radio models , 1989, IEEE Trans. Commun..

[35]  D. Aldous Deterministic and stochastic models for coalescence (aggregation and coagulation): a review of the mean-field theory for probabilists , 1999 .

[36]  Albert-László Barabási,et al.  Understanding the Spreading Patterns of Mobile Phone Viruses , 2009, Science.

[37]  Kyunghan Lee,et al.  Performance evaluation of a DTN as a city-wide infrastructure network , 2009 .

[38]  Thrasyvoulos Spyropoulos,et al.  On Leveraging Partial Paths in Partially-Connected Networks , 2009, IEEE INFOCOM 2009.

[39]  P. Thiran,et al.  Percolation in the signal to interference ratio graph , 2006, Journal of Applied Probability.