Deterministic broadcasting in ad hoc radio networks
From MaRDI portal
Publication:5138368
DOI10.1007/s446-002-8028-1zbMath1448.68084MaRDI 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
68M10: Network design and communication in computer systems
68M14: Distributed systems
68W15: Distributed algorithms
Related Items
Unnamed Item, Fast Message Dissemination in Random Geometric Ad-Hoc Radio Networks, Coordination Problems in Ad Hoc Radio Networks, Information dissemination in unknown radio networks with large labels, Leader election in ad hoc radio networks: a keen ear helps, The impact of mobility on the geocasting problem in mobile ad-hoc networks: solvability and cost, Near-optimal radio use for wireless network synchronization, Monitoring churn in wireless networks, Deterministic recurrent communication in restricted sensor networks, Acknowledged broadcasting and gossiping in ad hoc radio networks, Scalable wake-up of multi-channel single-hop radio networks, Broadcasting in geometric radio networks, Fast radio broadcasting with advice, Acknowledged broadcasting in ad hoc radio networks, Distributed broadcast in radio networks of unknown topology., Information gathering in ad-hoc radio networks with tree topology, Time complexity of radio broadcasting: adaptiveness vs. obliviousness and randomization vs. determinism, Information gathering in ad-hoc radio networks, Information dissemination in wireless ad-hoc networks under the weighted-TIM framework, Exactly optimal deterministic radio broadcasting with collision detection, Leader election in multi-hop radio networks, New selectors and locally thin families with applications to multi-access channels supporting simultaneous transmissions, 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, Round complexity of leader election and gossiping in bidirectional radio networks, On the communication complexity of Bar-Yehuda, Goldreich and Itai's randomized broadcasting algorithm, Deterministic M2M multicast in radio networks, Finding the size and the diameter of a radio network using short labels, Labeling schemes for deterministic radio multi-broadcast, Time-Efficient Broadcast in Radio Networks, A Random Graph Model of Mobile Wireless Networks, Fast Radio Broadcasting with Advice, 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
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