Criticality condition for information floating with random walk of nodes

In an opportunistic content sharing system referred to as floating content, information is copied between mobile nodes upon node encounters inside an area which is called the anchor zone. We study the conditions under which information can be sustained in such a system. The anchor zone is assumed to be a circular disk, and a random walk type mobility model is adopted. First, we consider the one-speed case where all the nodes have a common velocity. Using the transport equation, adopted from nuclear reactor theory, we derive the criticality condition that defines a lower limit for the product of node density, communication distance and the radius of the anchor zone necessary for information floating. The dependence of this criticality parameter on the mean step size of the random walk is numerically established. Complemented by the asymptotic behavior, found by diffusion theory, an accurate approximation formula is derived. While the velocity of the nodes does not appear at all in the criticality condition of the one-speed system, in general, the shape of the velocity distribution has an important effect: the higher the spread of the distribution, the lower the criticality threshold is. This effect is analyzed and discussed.

[1]  Donald F. Towsley,et al.  Performance modeling of epidemic routing , 2006, Comput. Networks.

[2]  Eitan Altman,et al.  Forward Correction and Fountain Codes in Delay-Tolerant Networks , 2008, IEEE/ACM Transactions on Networking.

[3]  K. M. Case,et al.  Introduction to the theory of neutron diffusion, v.1 , 1953 .

[4]  Bernard Mans,et al.  On Space-Time Capacity Limits in Mobile and Delay Tolerant Networks , 2010, 2010 Proceedings IEEE INFOCOM.

[5]  Dennis V. Lindley,et al.  Principles of Random Walk. , 1965 .

[6]  G. I. Bell,et al.  Nuclear Reactor Theory , 1952 .

[7]  Massimo Franceschetti,et al.  Closing the Gap in the Capacity of Wireless Networks Via Percolation Theory , 2007, IEEE Transactions on Information Theory.

[8]  Ger Koole,et al.  The message delay in mobile ad hoc networks , 2005, Perform. Evaluation.

[9]  Panganamala Ramana Kumar,et al.  RHEINISCH-WESTFÄLISCHE TECHNISCHE HOCHSCHULE AACHEN , 2001 .

[10]  Eitan Altman,et al.  Optimal monotone forwarding policies in delay tolerant mobile ad-hoc networks , 2008, Valuetools 2008.

[11]  Gunnar Karlsson,et al.  A mobile peer-to-peer system for opportunistic content-centric networking , 2010, MobiHeld '10.

[12]  Jörg Ott,et al.  When does content float? Characterizing availability of anchored information in opportunistic content sharing , 2011, 2011 Proceedings IEEE INFOCOM.

[13]  H. M. Zhang,et al.  Assessing the VANET's Local Information Storage Capability under Different Traffic Mobility , 2010, 2010 Proceedings IEEE INFOCOM.

[14]  Edmund M. Yeh,et al.  On the latency for information dissemination in mobile wireless networks , 2008, MobiHoc '08.

[15]  Jörg Ott,et al.  Floating content: Information availability in urban environments , 2010, 2010 8th IEEE International Conference on Pervasive Computing and Communications Workshops (PERCOM Workshops).

[16]  Gregory F. Lawler,et al.  Random Walk: A Modern Introduction , 2010 .

[17]  Upamanyu Madhow,et al.  A Reaction-Diffusion Model for Epidemic Routing in Sparsely Connected MANETs , 2010, 2010 Proceedings IEEE INFOCOM.

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

[19]  Eitan Altman,et al.  Decentralized Stochastic Control of Delay Tolerant Networks , 2009, IEEE INFOCOM 2009.

[20]  G. I. Bell,et al.  Introduction to Nuclear Reactor Theory , 1966 .

[21]  H. Langhaar.  Dimensional analysis and theory of models , 1951 .

[22]  Bernard Mans,et al.  Information Propagation Speed in Mobile and Delay Tolerant Networks , 2009, IEEE INFOCOM 2009.