Parsimonious Flooding in Geometric Random-Walks

DOI10.1007/978-3-642-24100-0_28zbMath1350.68044OpenAlexW2952549892MaRDI QIDQ3095334

Riccardo Silvestri, Andrea E. F. Clementi

Publication date: 28 October 2011

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-24100-0_28

Mathematics Subject Classification ID

Distributed systems (68M14) Network protocols (68M12) Random walks on graphs (05C81)

Cites Work

• Unnamed Item
• Parsimonious flooding in geometric random-walks
• Broadcasting in dynamic radio networks
• A general model for stochastic SIR epidemics with two levels of mixing
• Mobile geometric graphs: detection, coverage and percolation
• Network epidemic models with two levels of mixing
• Flooding time in edge-Markovian dynamic graphs
• MANETS: High Mobility Can Make Up for Low Transmission Power
• Parsimonious flooding in dynamic graphs
• Fast flooding over Manhattan
• Information Propagation Speed in Mobile and Delay Tolerant Networks

This page was built for publication: Parsimonious Flooding in Geometric Random-Walks