Impact of location heterogeneity on random walk mobility models

This paper investigates random walk mobility models with location heterogeneity, where different locations may have different neighboring regions. With the assumption of totally n locations, we consider two cases, i.e., full-range locations where nodes situated have the capability to shuffle throughout the network and long-range locations where nodes are allowed for moving to positions nearby within a certain range. In the former situation, with the exact expressions derived, we find location heterogeneity has a critical impact on the first hitting time of random walk, varying from Θ(n) to Θ(n3) according to different extent of heterogeneity. The result covers, as two special cases, both the classic independent and identically distributed (i.i.d) mobility and traditional random walk as we vary the number of full-range locations. In the latter one, our asymptotic results on both the first crossing time and cover time suggest that they are inversely proportional to the range of neighboring region r (∝ r-2 and ∝ r-1, respectively). Furthermore, extensive simulation is conducted to verify our observations and enhance the understanding on the effect of network parameters.

[1]  Roberto Beraldi.  Random walk with long jumps for wireless ad hoc networks , 2009, Ad Hoc Networks.

[2]  Zhu Han,et al.  Coalitional Graph Games for Popular Content Distribution in Cognitive Radio VANETs , 2013, IEEE Transactions on Vehicular Technology.

[3]  Zhu Han,et al.  Dynamic Popular Content Distribution in Vehicular Networks using Coalition Formation Games , 2012, IEEE Journal on Selected Areas in Communications.

[4]  Donald F. Towsley,et al.  Characterizing continuous time random walks on time varying graphs , 2012, SIGMETRICS '12.

[5]  P. Matthews.  Covering Problems for Brownian Motion on Spheres , 1988 .

[6]  Hamed Mohsenian Rad,et al.  Vehicle-to-Aggregator Interaction Game , 2012, IEEE Transactions on Smart Grid.

[7]  Prithwish Basu,et al.  Analysis of Latency of Stateless Opportunistic Forwarding in Intermittently Connected Networks , 2011, IEEE/ACM Transactions on Networking.

[8]  Ness B. Shroff,et al.  Degenerate delay-capacity tradeoffs in ad-hoc networks with Brownian mobility , 2006, IEEE Transactions on Information Theory.

[9]  Xinbing Wang,et al.  Delay and Capacity Tradeoff Analysis for MotionCast , 2011, IEEE/ACM Transactions on Networking.

[10]  Eytan Modiano,et al.  Capacity and delay tradeoffs for ad hoc mobile networks , 2005, IEEE Trans. Inf. Theory.

[11]  Noga Alon,et al.  Many Random Walks Are Faster Than One , 2011, Comb. Probab. Comput..

[12]  Michele Garetto,et al.  Analysis of random mobility models with PDE's , 2006, MobiHoc '06.

[13]  Ness B. Shroff,et al.  Delay and Capacity Trade-Offs in Mobile Ad Hoc Networks: A Global Perspective , 2006, Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications.

[14]  Xiuzhen Cheng,et al.  Routing in pocket switched networks , 2012, IEEE Wireless Communications.

[15]  David Tse,et al.  Mobility increases the capacity of ad-hoc wireless networks , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

[16]  David J. Aldous,et al.  Lower bounds for covering times for reversible Markov chains and random walks on graphs , 1989 .

[17]  Zhongcheng Li,et al.  Opportunistic Routing in Intermittently Connected Mobile P2P Networks , 2013, IEEE Journal on Selected Areas in Communications.

[18]  Vincent W. S. Wong,et al.  DORA: Dynamic Optimal Random Access for Vehicle-to-Roadside Communications , 2012, IEEE Journal on Selected Areas in Communications.