Information Spreading in Dynamic Networks: An Analytical Approach

DOI10.1007/978-3-642-14849-1_19zbMath1218.68043MaRDI QIDQ5391131

Francesco Pasquale, Andrea E. F. Clementi

Publication date: 5 April 2011

Published in: Monographs in Theoretical Computer Science. An EATCS Series (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-14849-1_19

zbMATH Keywords

survey article; mobility; dynamic network; sensor network; analytical approach; evolving graph

Mathematics Subject Classification ID

68R10: Graph theory (including graph drawing) in computer science

68M14: Distributed systems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The infection time of graphs
• Broadcasting in dynamic radio networks
• On the time-complexity of broadcast in multi-hop radio networks: An exponential gap between determinism and randomization
• Power consumption in packet radio networks
• Radio communication in random graphs
• Flooding time in edge-Markovian dynamic graphs
• Flooding Time of Edge-Markovian Evolving Graphs
• Fast broadcasting and gossiping in radio networks
• How to Explore a Fast-Changing World (Cover Time of a Simple Random Walk on Evolving Graphs)
• Walkers on the Cycle and the Grid
• MANETS: High Mobility Can Make Up for Low Transmission Power
• On Broadcasting in Radio Networks--Problem Analysis and Protocol Design
• On Spreading a Rumor
• Random Geometric Graphs
• Paths in graphs
• Parsimonious flooding in dynamic graphs
• Communication in dynamic radio networks
• The Survival of the Weakest in Networks
• Broadcasting algorithms in radio networks with unknown topology
• COMPUTING SHORTEST, FASTEST, AND FOREMOST JOURNEYS IN DYNAMIC NETWORKS
• Automata, Languages and Programming
• The diameter of sparse random graphs