On clustering phenomenon in mobile partitioned networks

According to different kinds of connectivity, we can distinguish three types of mobile ad-hoc networks: dense, sparse and clustered networks. This paper is about modeling mobility in clustered networks, where nodes are concentrated into clusters of dense connectivity, and in between there exists sparse connectivity. The dense and sparse networks are extensively studied and modeled, but not much attention is paid to the clustered networks. In the sparse and clustered networks, an inherently important aspect is the mobility model, both for the design and evaluation of routing protocols. We propose a new mobility model for clustered networks, called Heterogeneous Random Walk. This model is simple, mathematically tractable and most importantly it captures the phenomenon of emerging clusters, observed in real partitioned networks, in an elegant way. We provide a closed-form expression for the stationary distribution of node position and we give a recipe for the "perfect simulation". Moreover, based on the real mobility trace we provide strong evidence for the main macroscopic characteristics of clustered networks captured by the proposed mobility model. For the very first time in the literature we show evidence for the correlation between the spatial speed distribution and the cluster formation. We also present the results of the analysis of real cluster dynamics caused by nodes' mobility.

[1]  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.

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

[3]  Houda Labiod Wireless Ad Hoc and Sensor Networks , 2007 .

[4]  Afonso Ferreira,et al.  Building a reference combinatorial model for MANETs , 2004, IEEE Network.

[5]  Mostafa Ammar,et al.  Hybrid routing in clustered DTNs with message ferrying , 2007, MobiOpp '07.

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

[7]  Anders Lindgren,et al.  Probabilistic Routing in Intermittently Connected Networks , 2004, SAPIR.

[8]  Rabin K. Patra,et al.  Routing in a delay tolerant network , 2004, SIGCOMM '04.

[9]  Ahmed Helmy,et al.  Weighted waypoint mobility model and its impact on ad hoc networks , 2005, MOCO.

[10]  Cauligi S. Raghavendra,et al.  Performance analysis of mobility-assisted routing , 2006, MobiHoc '06.

[11]  FallKevin,et al.  Routing in a delay tolerant network , 2004 .

[12]  Mary Baker,et al.  Analysis of a Metropolitan-Area Wireless Network , 2002, Wirel. Networks.

[13]  Ahmed Helmy,et al.  Modeling Time-Variant User Mobility in Wireless Mobile Networks , 2007, IEEE INFOCOM 2007 - 26th IEEE International Conference on Computer Communications.

[14]  Laurent Viennot,et al.  A Note on Models, Algorithms, and Data Structures for Dynamic Communication Networks , 2002 .

[15]  Cauligi S. Raghavendra,et al.  Spray and wait: an efficient routing scheme for intermittently connected mobile networks , 2005, WDTN '05.

[16]  Jean-Yves Le Boudec Understanding the simulation of mobility models with Palm calculus , 2007, Perform. Evaluation.

[17]  Cauligi S. Raghavendra,et al.  Spray and Focus: Efficient Mobility-Assisted Routing for Heterogeneous and Correlated Mobility , 2007, Fifth Annual IEEE International Conference on Pervasive Computing and Communications Workshops (PerComW'07).

[18]  Chita R. Das,et al.  Clustered Mobility Model for Scale-Free Wireless Networks , 2006, Proceedings. 2006 31st IEEE Conference on Local Computer Networks.

[19]  Amin Vahdat,et al.  Epidemic Routing for Partially-Connected Ad Hoc Networks , 2009 .

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

[21]  David Kotz,et al.  Extracting a Mobility Model from Real User Traces , 2006, Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications.

[22]  G. Grimmett,et al.  Probability and random processes , 2002 .

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

[24]  Sven Bittner,et al.  The area graph-based mobility model and its impact on data dissemination , 2005, Third IEEE International Conference on Pervasive Computing and Communications Workshops.

[25]  James A. Davis,et al.  Wearable computers as packet transport mechanisms in highly-partitioned ad-hoc networks , 2001, Proceedings Fifth International Symposium on Wearable Computers.

[26]  Timur Friedman,et al.  Evaluating Mobility Pattern Space Routing for DTNs , 2005, Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications.

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

[28]  William G. Gibson,et al.  Monte Carlo simulation of diffusion in a spatially nonhomogeneous medium: correction to the Gaussian steplength , 2004 .

[29]  Arun Venkataramani,et al.  DTN routing as a resource allocation problem , 2007, SIGCOMM '07.

[30]  Cecilia Mascolo,et al.  Adaptive routing for intermittently connected mobile ad hoc networks , 2005, Sixth IEEE International Symposium on a World of Wireless Mobile and Multimedia Networks.

[31]  Mingyan Liu,et al.  Building realistic mobility models from coarse-grained traces , 2006, MobiSys '06.

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

[33]  M. Penrose,et al.  Large deviations for discrete and continuous percolation , 1996, Advances in Applied Probability.

[34]  Isaac Balberg Continuum Percolation , 2009, Encyclopedia of Complexity and Systems Science.

[35]  Tracy Camp,et al.  A survey of mobility models for ad hoc network research , 2002, Wirel. Commun. Mob. Comput..

[36]  Tristan Henderson,et al.  CRAWDAD: a community resource for archiving wireless data at Dartmouth , 2005, CCRV.

[37]  D. Stoyan,et al.  Stochastic Geometry and Its Applications , 1989 .

[38]  D. Stoyan,et al.  Stochastic Geometry and Its Applications , 1989 .

[39]  Li Li,et al.  Practical Routing in Delay-Tolerant Networks , 2007, IEEE Trans. Mob. Comput..

[40]  J. Elgin The Fokker-Planck Equation: Methods of Solution and Applications , 1984 .

[41]  Ellen W. Zegura,et al.  A message ferrying approach for data delivery in sparse mobile ad hoc networks , 2004, MobiHoc '04.

[42]  K. Vahala Handbook of stochastic methods for physics, chemistry and the natural sciences , 1986, IEEE Journal of Quantum Electronics.