Activating anonymous ad hoc radio networks
From MaRDI portal
Publication:1954211
DOI10.1007/s00446-007-0021-5zbMath1266.68221OpenAlexW2045008360MaRDI QIDQ1954211
Publication date: 20 June 2013
Published in: Distributed Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00446-007-0021-5
Network design and communication in computer systems (68M10) Graph algorithms (graph-theoretic aspects) (05C85) Distributed algorithms (68W15)
Related Items (5)
Finding the size and the diameter of a radio network using short labels ⋮ Coordination Problems in Ad Hoc Radio Networks ⋮ Trade-offs between the size of advice and broadcasting time in trees ⋮ Acknowledged broadcasting in ad hoc radio networks ⋮ Asynchronous Broadcasting with Bivalent Beeps
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A lower bound for radio broadcast
- On the time-complexity of broadcast in multi-hop radio networks: An exponential gap between determinism and randomization
- Computing Boolean functions on anonymous networks
- Time complexity of radio broadcasting: adaptiveness vs. obliviousness and randomization vs. determinism
- Optimal deterministic broadcasting in known topology radio networks
- The Wakeup Problem in Synchronous Broadcast Systems
- Computing anonymously with arbitrary knowledge
- On Broadcasting in Radio Networks--Problem Analysis and Protocol Design
- Computing on an anonymous ring
- An $\Omega(D\log (N/D))$ Lower Bound for Broadcast in Radio Networks
- Centralized broadcast in multihop radio networks
- Faster communication in known topology radio networks
- Structural Information and Communication Complexity
- Broadcasting algorithms in radio networks with unknown topology
- A better wake-up in radio networks
- Broadcasting in undirected ad hoc radio networks
This page was built for publication: Activating anonymous ad hoc radio networks
