A lower bound for radio broadcast
From MaRDI portal
Publication:1176103
DOI10.1016/0022-0000(91)90015-WzbMath0753.68006OpenAlexW2095713941MaRDI QIDQ1176103
Amotz Bar-Noy, David Peleg, Noga Alon, Nathan Linial
Publication date: 25 June 1992
Published in: Journal of Computer and System Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0022-0000(91)90015-w
Analysis of algorithms and problem complexity (68Q25) Communication networks in operations research (90B18) Network design and communication in computer systems (68M10)
Related Items (73)
Optimal gossiping in geometric radio networks in the presence of dynamical faults ⋮ Efficient broadcasting in radio networks with long-range interference ⋮ Broadcasting in UDG radio networks with missing and inaccurate information ⋮ Broadcasting in UDG radio networks with unknown topology ⋮ Centralized asynchronous broadcast in radio networks ⋮ Time efficient centralized gossiping in radio networks ⋮ Upper and lower bounds for deterministic broadcast in powerline communication networks ⋮ Time efficient \(k\)-shot broadcasting in known topology radio networks ⋮ Feasibility and complexity of broadcasting with random transmission failures ⋮ 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 ⋮ Deterministic size discovery and topology recognition in radio networks with short labels ⋮ Information gathering in ad-hoc radio networks with tree topology ⋮ Near-Optimal Time–Energy Tradeoffs for Deterministic Leader Election ⋮ Broadcast Transmission to Prioritizing Receivers ⋮ On the probabilistic degree of OR over the reals ⋮ Distributed broadcast in radio networks of unknown topology. ⋮ Centralized Communication in Radio Networks with Strong Interference ⋮ Fast Radio Broadcasting with Advice ⋮ Randomized broadcast in radio networks with collision detection ⋮ Dynamic multiple-message broadcast: bounding throughput in the affectance model ⋮ Uniting General-Graph and Geometric-Based Radio Networks via Independence Number Parametrization ⋮ Scalable wake-up of multi-channel single-hop radio networks ⋮ Radio aggregation scheduling ⋮ Deterministic Communication in Radio Networks ⋮ Almost optimal distributed M2M multicasting in wireless mesh networks ⋮ Latency-optimal communication in wireless mesh networks ⋮ Optimal deterministic broadcasting in known topology radio networks ⋮ Faster communication in known topology radio networks ⋮ Activating anonymous ad hoc radio networks ⋮ Broadcasting in geometric radio networks ⋮ Broadcasting in UDG Radio Networks with Missing and Inaccurate Information ⋮ Efficient Broadcasting in Known Geometric Radio Networks with Non-uniform Ranges ⋮ Coordination Problems in Ad Hoc Radio Networks ⋮ On polynomial approximations to AC ⋮ On the communication complexity of Bar-Yehuda, Goldreich and Itai's randomized broadcasting algorithm ⋮ Faster information gathering in ad-hoc radio tree networks ⋮ Efficient Distributed Communication in Ad-Hoc Radio Networks ⋮ Fast radio broadcasting with advice ⋮ Conflict-Free Colouring of Graphs ⋮ Trade-offs between the size of advice and broadcasting time in trees ⋮ 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 ⋮ Improved algorithm for broadcast scheduling of minimal latency in wireless ad hoc networks ⋮ Near-optimal radio use for wireless network synchronization ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Token traversal in ad hoc wireless networks via implicit carrier sensing ⋮ On simple back-off in unreliable radio networks ⋮ Efficient \(k\)-shot broadcasting in radio networks ⋮ Broadcasting in undirected ad hoc radio networks ⋮ Nonuniform SINR+Voronoi diagrams are effectively uniform ⋮ Information gathering in ad-hoc radio networks ⋮ Bounded-contention coding for the additive network model ⋮ On the effect of the deployment setting on broadcasting in Euclidean radio networks ⋮ Faster deterministic communication in radio networks ⋮ Many-to-many communication in radio networks ⋮ Local queuing under contention ⋮ Leveraging Channel Diversity to Gain Efficiency and Robustness for Wireless Broadcast ⋮ A note on the lower bound of centralized radio broadcasting for planar reachability graphs ⋮ Energy efficient randomised communication in unknown AdHoc networks ⋮ Time-Efficient Broadcast in Radio Networks ⋮ On Efficient Gossiping in Radio Networks ⋮ Power consumption in packet radio networks ⋮ Leader election in multi-hop radio networks ⋮ Exactly optimal deterministic radio broadcasting with collision detection ⋮ The impact of information on broadcasting time in linear radio networks. ⋮ Noisy beeping networks ⋮ Faster broadcasting in unknown radio networks
Cites Work
This page was built for publication: A lower bound for radio broadcast
