Deterministic broadcasting in ad hoc radio networks

DOI10.1007/s446-002-8028-1zbMath1448.68084OpenAlexW2069239201MaRDI QIDQ5138368

Andrzej Pelc, Bogdan S. Chlebus, Leszek Gąsieniec, Alan M. Gibbons, Wojciech Rytter

Publication date: 3 December 2020

Published in: Distributed Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s446-002-8028-1

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Distributed systems (68M14) Distributed algorithms (68W15)

Related Items (37)

Broadcasting in UDG radio networks with unknown topology ⋮ Centralized asynchronous broadcast in radio networks ⋮ Time efficient centralized gossiping in radio networks ⋮ Contention resolution in a non-synchronized multiple access channel ⋮ Finding the size and the diameter of a radio network using short labels ⋮ Acknowledged broadcasting and gossiping in ad hoc radio networks ⋮ Information dissemination in unknown radio networks with large labels ⋮ Labeling schemes for deterministic radio multi-broadcast ⋮ Leader election in ad hoc radio networks: a keen ear helps ⋮ Information gathering in ad-hoc radio networks with tree topology ⋮ Distributed broadcast in radio networks of unknown topology. ⋮ Fast Radio Broadcasting with Advice ⋮ The impact of mobility on the geocasting problem in mobile ad-hoc networks: solvability and cost ⋮ Scalable wake-up of multi-channel single-hop radio networks ⋮ Broadcasting in geometric radio networks ⋮ On Radio Broadcasting in Random Geometric Graphs ⋮ Broadcasting in UDG Radio Networks with Missing and Inaccurate Information ⋮ Efficient Broadcasting in Known Geometric Radio Networks with Non-uniform Ranges ⋮ Round complexity of leader election and gossiping in bidirectional radio networks ⋮ Fast Message Dissemination in Random Geometric Ad-Hoc Radio Networks ⋮ Coordination Problems in Ad Hoc Radio Networks ⋮ On the communication complexity of Bar-Yehuda, Goldreich and Itai's randomized broadcasting algorithm ⋮ Fast radio broadcasting with advice ⋮ Acknowledged broadcasting in ad hoc radio networks ⋮ Time complexity of radio broadcasting: adaptiveness vs. obliviousness and randomization vs. determinism ⋮ Near-optimal radio use for wireless network synchronization ⋮ Monitoring churn in wireless networks ⋮ Unnamed Item ⋮ Deterministic M2M multicast in radio networks ⋮ Information gathering in ad-hoc radio networks ⋮ Information dissemination in wireless ad-hoc networks under the weighted-TIM framework ⋮ Deterministic recurrent communication in restricted sensor networks ⋮ Time-Efficient Broadcast in Radio Networks ⋮ Leader election in multi-hop radio networks ⋮ New selectors and locally thin families with applications to multi-access channels supporting simultaneous transmissions ⋮ Exactly optimal deterministic radio broadcasting with collision detection ⋮ A Random Graph Model of Mobile Wireless Networks

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A new distributed depth-first-search algorithm
• On the time-complexity of broadcast in multi-hop radio networks: An exponential gap between determinism and randomization
• Faster broadcasting in unknown radio networks
• The time complexity of deterministic broadcast radio networks
• The Wakeup Problem in Synchronous Broadcast Systems
• Fault-Tolerant Broadcasting in Radio Networks
• Multiple Communication in Multihop Radio Networks
• A trade-off between information and communication in broadcast protocols
• On Broadcasting in Radio Networks--Problem Analysis and Protocol Design
• A perspective on multiaccess channels
• An $\Omega(D\log (N/D))$ Lower Bound for Broadcast in Radio Networks
• Lower bounds for the broadcast problem in mobile radio networks

This page was built for publication: Deterministic broadcasting in ad hoc radio networks