Fast flooding over Manhattan

DOI10.1007/s00446-012-0182-8zbMath1267.68058arXiv1002.3757OpenAlexW2060856861MaRDI QIDQ2375821

Angelo Monti, Riccardo Silvestri, Andrea E. F. Clementi

Publication date: 25 June 2013

Published in: Distributed Computing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1002.3757

zbMATH Keywords

probabilistic analysismobile ad-hoc networksflooding protocols

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Distributed systems (68M14)

Related Items (1)

Information spreading in dynamic graphs

Cites Work

• Unnamed Item
• Mobile geometric graphs: detection, coverage and percolation
• Tight bounds on information dissemination in sparse mobile networks
• Flooding Time of Edge-Markovian Evolving Graphs
• Spatial Node Distribution of Manhattan Path Based Random Waypoint Mobility Models with Applications
• How to Explore a Fast-Changing World (Cover Time of a Simple Random Walk on Evolving Graphs)
• MANETS: High Mobility Can Make Up for Low Transmission Power
• Balanced Allocations
• Random Geometric Graphs
• Parsimonious flooding in dynamic graphs
• Information Propagation Speed in Mobile and Delay Tolerant Networks

This page was built for publication: Fast flooding over Manhattan