Fast deterministic broadcast and gossiping algorithms for mobile ad hoc networks
From MaRDI portal
Publication:436818
DOI10.1016/J.JPDC.2008.01.008zbMATH Open1243.68031OpenAlexW2027973471MaRDI QIDQ436818FDOQ436818
Authors: Koushik Sinha, Suranjan Ghose, Pradip K. Srimani 
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
Recommendations
Graph theory (including graph drawing) in computer science (68R10) Network design and communication in computer systems (68M10)
Cites Work
- On the time-complexity of broadcast in multi-hop radio networks: An exponential gap between determinism and randomization
- Selective families, superimposed codes, and broadcasting on unknown radio networks. (Extended abstract)
- Broadcasting in undirected ad hoc radio networks
- An $\Omega(D\log (N/D))$ Lower Bound for Broadcast in Radio Networks
- Title not available (Why is that?)
- Title not available (Why is that?)
- On adaptive deterministic gossiping in ad hoc radio networks.
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Distributed Computing - IWDC 2004
- Distributed Computing - IWDC 2004
- BROADCASTING IN AD HOC NETWORKS BASED ON SELF-PRUNING
Cited In (5)
- Distributed Computing - IWDC 2004
- Distributed Computing - IWDC 2004
- Using Cellular Automata to Determine Bounds for Measuring the Efficiency of Broadcast Algorithms in Highly Mobile Ad Hoc Networks
- Fast distributed algorithm for convergecast in ad hoc geometric radio networks
- Fast Message Dissemination in Random Geometric Ad-Hoc Radio Networks
This page was built for publication: Fast deterministic broadcast and gossiping algorithms for mobile ad hoc networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q436818)
