Efficient Distributed Communication in Ad-Hoc Radio Networks
From MaRDI portal
Publication:3012952
DOI10.1007/978-3-642-22012-8_49zbMath1333.68029OpenAlexW78560857MaRDI QIDQ3012952
Mariusz A. Rokicki, Andrzej Pelc, Bogdan S. Chlebus, Dariusz R. Kowalski
Publication date: 7 July 2011
Published in: Automata, Languages and Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-22012-8_49
Related Items (13)
Distributed bare-bones communication in wireless networks ⋮ Stable routing scheduling algorithms in multi-hop wireless networks ⋮ Labeling schemes for deterministic radio multi-broadcast ⋮ $$\epsilon $$-Almost Selectors and Their Applications ⋮ Optimal Packet-Oblivious Stable Routing in Multi-hop Wireless Networks ⋮ Universal stability in multi-hop radio networks ⋮ Randomized broadcast in radio networks with collision detection ⋮ Dynamic multiple-message broadcast: bounding throughput in the affectance model ⋮ Faster information gathering in ad-hoc radio tree networks ⋮ Token traversal in ad hoc wireless networks via implicit carrier sensing ⋮ Message and time efficient multi-broadcast schemes ⋮ Bounded-contention coding for the additive network model ⋮ New selectors and locally thin families with applications to multi-access channels supporting simultaneous transmissions
Cites Work
- Unnamed Item
- Many-to-many communication in radio networks
- A lower bound for radio broadcast
- On the time-complexity of broadcast in multi-hop radio networks: An exponential gap between determinism and randomization
- Distributed broadcast in radio networks of unknown topology.
- A data structure for dynamic trees
- Multiple Communication in Multihop Radio Networks
- Fast broadcasting and gossiping in radio networks
- Algorithm Theory - SWAT 2004
- Automata, Languages and Programming
- Broadcasting in undirected ad hoc radio networks
This page was built for publication: Efficient Distributed Communication in Ad-Hoc Radio Networks
