Information Spreading in Dynamic Networks: An Analytical Approach

Sensor networks are one of the most relevant concrete examples of dynamic networks. Their dynamic behavior is mainly due to the presence of node/link faults and node mobility. The aim of this chapter is to survey a new approach to study such dynamic networks, recently introduced in [15–19]. The major novelty of this approach relies on two basic issues.

[1]  Wojciech Rytter,et al.  Fast broadcasting and gossiping in radio networks , 2002, J. Algorithms.

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

[3]  Paul G. Spirakis,et al.  The infection time of graphs , 2006, Discret. Appl. Math..

[4]  Chen Avin,et al.  How to Explore a Fast-Changing World (Cover Time of a Simple Random Walk on Evolving Graphs) , 2008, ICALP.

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

[6]  A. Rbnyi.  ON THE EVOLUTION OF RANDOM GRAPHS , 2001 .

[7]  Beyond MANETs: dissertation on Opportunistic Networking , 2007 .

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

[9]  B. Bollobás.  The evolution of random graphs , 1984 .

[10]  Keshab K. Parhi,et al.  Distributed scheduling of broadcasts in a radio network , 1989, IEEE INFOCOM '89, Proceedings of the Eighth Annual Joint Conference of the IEEE Computer and Communications Societies.

[11]  Andrea E. F. Clementi,et al.  Flooding Time of Edge-Markovian Evolving Graphs , 2010, SIAM J. Discret. Math..

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

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

[14]  Christoph Ambühl,et al.  An Optimal Bound for the MST Algorithm to Compute Energy Efficient Broadcast Trees in Wireless Networks , 2005, ICALP.

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

[16]  Afonso Ferreira,et al.  Computing Shortest, Fastest, and Foremost Journeys in Dynamic Networks , 2003, Int. J. Found. Comput. Sci..

[17]  Andrzej Pelc,et al.  Power consumption in packet radio networks , 2000, Theor. Comput. Sci..

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

[19]  Béla Bollobás,et al.  Random Graphs: Notation , 2001 .

[20]  Andrea E. F. Clementi,et al.  Broadcasting in dynamic radio networks , 2009, J. Comput. Syst. Sci..

[21]  Wojciech Rytter,et al.  Deterministic broadcasting in unknown radio networks , 2000, SODA '00.

[22]  Jon M. Kleinberg,et al.  Protocols and impossibility results for gossip-based communication mechanisms , 2002, The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings..

[23]  Vijaya Ramachandran,et al.  The diameter of sparse random graphs , 2007, Random Struct. Algorithms.

[24]  P. Erdos,et al.  On the evolution of random graphs , 1984 .

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

[26]  Paolo Santi,et al.  The Critical Transmitting Range for Connectivity in Sparse Wireless Ad Hoc Networks , 2003, IEEE Trans. Mob. Comput..

[27]  Subramanian Ramanathan,et al.  Scheduling algorithms for multihop radio networks , 1993, TNET.

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

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

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

[31]  Svante Janson,et al.  Random graphs , 2000, ZOR Methods Model. Oper. Res..

[32]  Reuven Bar-Yehuda,et al.  On the Time-Complexity of Broadcast in Multi-hop Radio Networks: An Exponential Gap Between Determinism and Randomization , 1992, J. Comput. Syst. Sci..

[33]  Mathew D. Penrose,et al.  Random Geometric Graphs , 2003 .

[34]  Béla Bollobás,et al.  Random Graphs , 1985 .

[35]  Paul G. Spirakis,et al.  The survival of the weakest in networks , 2009, Comput. Math. Organ. Theory.

[36]  Wojciech Rytter,et al.  Broadcasting algorithms in radio networks with unknown topology , 2003, 44th Annual IEEE Symposium on Foundations of Computer Science, 2003. Proceedings..

[37]  Roger Wattenhofer,et al.  Information dissemination in highly dynamic graphs , 2005, DIALM-POMC '05.

[38]  Kevin C. Almeroth,et al.  Towards realistic mobility models for mobile ad hoc networks , 2003, MobiCom '03.

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

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

[41]  Imrich Chlamtac,et al.  On Broadcasting in Radio Networks - Problem Analysis and Protocol Design , 1985, IEEE Transactions on Communications.

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

[43]  Piyush Gupta,et al.  Critical Power for Asymptotic Connectivity in Wireless Networks , 1999 .

[44]  Afonso Ferreira,et al.  Complexity of Connected Components in Evolving Graphs and the Computation of Multicast Trees in Dynamic Networks , 2003, ADHOC-NOW.

[45]  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).

[46]  Robert Elsässer,et al.  Radio communication in random graphs , 2006, J. Comput. Syst. Sci..