Lower bounds for the broadcast problem in mobile radio networks

DOI10.1007/s004460050030zbMath1448.68039OpenAlexW2045376554MaRDI QIDQ5137335

Danilo Bruschi, Massimiliano del Pinto

Publication date: 2 December 2020

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

Full work available at URL: https://doi.org/10.1007/s004460050030

zbMATH Keywords

mobile computingdistributed algorithmsbroadcast

Mathematics Subject Classification ID

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

Related Items (29)

Broadcasting in UDG radio networks with unknown topology ⋮ Acknowledged broadcasting and gossiping in ad hoc radio networks ⋮ Information dissemination in unknown radio networks with large labels ⋮ 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 ⋮ Unnamed Item ⋮ 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 ⋮ Deterministic broadcasting in ad hoc radio networks ⋮ Sensor Network Gossiping or How to Break the Broadcast Lower Bound ⋮ On the communication complexity of Bar-Yehuda, Goldreich and Itai's randomized broadcasting algorithm ⋮ Faster information gathering in ad-hoc radio tree networks ⋮ Energy-efficient broadcasting in ad hoc wireless networks ⋮ Fast radio broadcasting with advice ⋮ Improved lower bound for deterministic broadcasting in radio networks ⋮ Acknowledged broadcasting in ad hoc radio networks ⋮ Time complexity of radio broadcasting: adaptiveness vs. obliviousness and randomization vs. determinism ⋮ Radio communication in random graphs ⋮ Deterministic M2M multicast in radio networks ⋮ Token traversal in ad hoc wireless networks via implicit carrier sensing ⋮ Information gathering in ad-hoc radio networks ⋮ On the effect of the deployment setting on broadcasting in Euclidean radio networks ⋮ Time-Efficient Broadcast in Radio Networks ⋮ Faster broadcasting in unknown radio networks

Cites Work

• Unnamed Item
• On the time-complexity of broadcast in multi-hop radio networks: An exponential gap between determinism and randomization
• On Broadcasting in Radio Networks--Problem Analysis and Protocol Design
• An Ω(D log(N/D)) lower bound for broadcast in radio networks
• The Wakeup Problem

This page was built for publication: Lower bounds for the broadcast problem in mobile radio networks