Efficient Distributed Communication in Ad-Hoc Radio Networks

DOI10.1007/978-3-642-22012-8_49zbMath1333.68029MaRDI 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

zbMATH Keywords

gossiping; routing; distributed algorithm; radio network; gathering; multi-broadcast

Mathematics Subject Classification ID

68M10: Network design and communication in computer systems

68W15: Distributed algorithms

Related Items

Token traversal in ad hoc wireless networks via implicit carrier sensing, Bounded-contention coding for the additive network model, Randomized broadcast in radio networks with collision detection, Faster information gathering in ad-hoc radio tree networks, Distributed bare-bones communication in wireless networks, Universal stability in multi-hop radio networks, New selectors and locally thin families with applications to multi-access channels supporting simultaneous transmissions, Message and time efficient multi-broadcast schemes, $$\epsilon $$-Almost Selectors and Their Applications

Cites Work

• 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
• Unnamed Item