Parsimonious flooding in geometric random-walks (extended abstract)
From MaRDI portal
Publication:3095334
Recommendations
- Parsimonious flooding in geometric random-walks
- Tight bounds on information dissemination in sparse mobile networks
- Parsimonious flooding in dynamic graphs
- MANETS: High Mobility Can Make Up for Low Transmission Power
- Percolation of Lipschitz surface and tight bounds on the spread of information among mobile agents
Cites work
- scientific article; zbMATH DE number 4170917 (Why is no real title available?)
- A general model for stochastic SIR epidemics with two levels of mixing
- Broadcasting in dynamic radio networks
- Fast flooding over Manhattan
- Flooding time in edge-Markovian dynamic graphs
- Information Propagation Speed in Mobile and Delay Tolerant Networks
- MANETS: High Mobility Can Make Up for Low Transmission Power
- Mobile geometric graphs: detection, coverage and percolation
- Network epidemic models with two levels of mixing
- Parsimonious flooding in dynamic graphs
- Parsimonious flooding in geometric random-walks
Cited in
(8)- Fast flooding over Manhattan
- Fast flooding over Manhattan
- Percolation of Lipschitz surface and tight bounds on the spread of information among mobile agents
- MANETS: High Mobility Can Make Up for Low Transmission Power
- Parsimonious flooding in geometric random-walks
- On learning thresholds of parities and unions of rectangles in random walk models
- Information dissemination via random walks in \(d\)-dimensional space
- Tight bounds on information dissemination in sparse mobile networks
This page was built for publication: Parsimonious flooding in geometric random-walks (extended abstract)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3095334)
