Fast deterministic broadcast and gossiping algorithms for mobile ad hoc networks
From MaRDI portal
Publication:436818
DOI10.1016/J.JPDC.2008.01.008zbMath1243.68031OpenAlexW2027973471MaRDI QIDQ436818
Pradip K. Srimani, Suranjan Ghose, Koushik Sinha
Publication date: 26 July 2012
Published in: Journal of Parallel and Distributed Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jpdc.2008.01.008
Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10)
Cites Work
- On the time-complexity of broadcast in multi-hop radio networks: An exponential gap between determinism and randomization
- On adaptive deterministic gossiping in ad hoc radio networks.
- An $\Omega(D\log (N/D))$ Lower Bound for Broadcast in Radio Networks
- Distributed Computing - IWDC 2004
- Distributed Computing - IWDC 2004
- BROADCASTING IN AD HOC NETWORKS BASED ON SELF-PRUNING
- Broadcasting in undirected ad hoc radio networks
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Fast deterministic broadcast and gossiping algorithms for mobile ad hoc networks