Acknowledged broadcasting and gossiping in ad hoc radio networks
From MaRDI portal
Publication:884460
DOI10.1016/J.TCS.2007.02.011zbMath1118.68022OpenAlexW2050851990MaRDI QIDQ884460
Koichi Wada, Wei Chen, Jiro Uchida
Publication date: 6 June 2007
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2007.02.011
Communication networks in operations research (90B18) Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10)
Related Items (2)
Information dissemination in unknown radio networks with large labels ⋮ Acknowledged broadcasting in ad hoc radio networks
Cites Work
- Unnamed Item
- A lower bound for radio broadcast
- Time complexity of radio broadcasting: adaptiveness vs. obliviousness and randomization vs. determinism
- Fast broadcasting and gossiping in radio networks
- An $\Omega(D\log (N/D))$ Lower Bound for Broadcast in Radio Networks
- Centralized broadcast in multihop radio networks
- Lower bounds for the broadcast problem in mobile radio networks
- Deterministic broadcasting in ad hoc radio networks
- Algorithm Theory - SWAT 2004
- Broadcasting algorithms in radio networks with unknown topology
This page was built for publication: Acknowledged broadcasting and gossiping in ad hoc radio networks