Information Spreading in Stationary Markovian Evolving Graphs

Markovian evolving graphs are dynamic-graph models where the links among a fixed set of nodes change during time according to an arbitrary Markovian rule. They are extremely general and they can well describe important dynamic-network scenarios. We study the speed of information spreading in the stationary phase by analyzing the completion time of the flooding mechanism. We prove a general theorem that establishes an upper bound on flooding time in any stationary Markovian evolving graph in terms of its node-expansion properties. We apply our theorem in two natural and relevant cases of such dynamic graphs. Geometric Markovian evolving graphs where the Markovian behaviour is yielded by n mobile radio stations, with fixed transmission radius, that perform independent random walks over a square region of the plane. Edge-Markovian evolving graphs where the probability of existence of any edge at time t depends on the existence (or not) of the same edge at time t-1. In both cases, the obtained upper bounds hold with high probability and they are nearly tight. In fact, they turn out to be tight for a large range of the values of the input parameters. As for geometric Markovian evolving graphs, our result represents the first analytical upper bound for flooding time on a class of concrete mobile networks.

[1]  Alan M. Frieze,et al.  The cover time of sparse random graphs. , 2003, SODA '03.

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

[3]  R.A. Guerin,et al.  Channel occupancy time distribution in a cellular radio system , 1987, IEEE Transactions on Vehicular Technology.

[4]  Andrea E. F. Clementi,et al.  Communication in dynamic radio networks , 2007, PODC '07.

[5]  Christian Scheideler.  Models and Techniques for Communication in Dynamic Networks , 2002, STACS.

[6]  Maria J. Serna,et al.  Walkers on the Cycle and the Grid , 2008, SIAM J. Discret. Math..

[7]  Edith Cohen,et al.  Search and replication in unstructured peer-to-peer networks , 2002, ICS '02.

[8]  Arthur L. Liestman,et al.  A survey of gossiping and broadcasting in communication networks , 1988, Networks.

[9]  Xavier Pérez-Giménez,et al.  Large Connectivity for Dynamic Random Geometric Graphs , 2009, IEEE Transactions on Mobile Computing.

[10]  Ioannis Stavrakakis,et al.  Performance Analysis of Probabilistic Flooding Using Random Graphs , 2007, 2007 IEEE International Symposium on a World of Wireless, Mobile and Multimedia Networks.

[11]  Pierre Fraigniaud,et al.  Parsimonious flooding in dynamic graphs , 2009, PODC '09.

[12]  Andrea E. F. Clementi,et al.  Flooding time in edge-Markovian dynamic graphs , 2008, PODC '08.

[13]  C. Avin,et al.  How to Explore a Fast-Changing World , 2008 .

[14]  David A. Maltz,et al.  Dynamic Source Routing in Ad Hoc Wireless Networks , 1994, Mobidata.

[15]  Donald F. Towsley,et al.  Properties of random direction models , 2005, Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies..

[16]  Xavier Pérez-Giménez,et al.  On the connectivity of dynamic random geometric graphs , 2007, SODA '08.

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

[18]  B. Pittel.  On spreading a rumor , 1987 .

[19]  Jean-Yves Le Boudec,et al.  Perfect simulation and stationarity of a class of mobility models , 2005, Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies..

[20]  Tracy Camp,et al.  Improving the Accuracy of Random Waypoint Simulations Through Steady-State Initialization , 2004 .

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

[22]  Zhen Liu,et al.  Capacity, delay and mobility in wireless ad-hoc networks , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

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

[24]  Andrea E. F. Clementi,et al.  MANETS: High Mobility Can Make Up for Low Transmission Power , 2009, ICALP.

[25]  David Tse,et al.  Mobility increases the capacity of ad hoc wireless networks , 2002, TNET.

[26]  Michael Mitzenmacher,et al.  Probability And Computing , 2005 .

[27]  S. N. Dorogovtsev,et al.  Evolution of networks , 2001, cond-mat/0106144.

[28]  S. Wasserman.  Analyzing Social Networks as Stochastic Processes , 1980 .

[29]  P ? ? ? ? ? ? ? % ? ? ? ? , 1991 .

[30]  Andrea E. F. Clementi,et al.  Information Spreading in Stationary Markovian Evolving Graphs , 2011 .

[31]  Christos Gkantsidis,et al.  Hybrid search schemes for unstructured peer-to-peer networks , 2005, Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies..

[32]  Mingyan Liu,et al.  Optimal controlled flooding search in a large wireless network , 2005, Third International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOpt'05).