Faster communication in known topology radio networks

DOI10.1145/1073814.1073840zbMath1314.68155OpenAlexW2048454711MaRDI QIDQ5177234

Qin Xin, Leszek Gąsieniec, David Peleg

Publication date: 10 March 2015

Published in: Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/1073814.1073840

zbMATH Keywords

algorithmsplanar graphsgossipingbroadcastingradio networks

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25) Randomized algorithms (68W20)

Related Items (28)

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 ⋮ Centralized Communication in Radio Networks with Strong Interference ⋮ Fast Radio Broadcasting with Advice ⋮ Randomized broadcast in radio networks with collision detection ⋮ Almost optimal distributed M2M multicasting in wireless mesh networks ⋮ Latency-optimal communication in wireless mesh networks ⋮ Optimal deterministic broadcasting 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 ⋮ Fast Message Dissemination in Random Geometric Ad-Hoc Radio Networks ⋮ Tree exploration with advice ⋮ Fast radio broadcasting with advice ⋮ Communication algorithms with advice ⋮ Acknowledged broadcasting in ad hoc radio networks ⋮ Improved algorithm for broadcast scheduling of minimal latency in wireless ad hoc networks ⋮ Radio communication in random graphs ⋮ Approximation for a scheduling problem with application in wireless networks ⋮ Deterministic M2M multicast in radio networks ⋮ Efficient \(k\)-shot broadcasting in radio networks ⋮ Message and time efficient multi-broadcast schemes ⋮ Faster deterministic communication in radio networks ⋮ Many-to-many communication in radio networks ⋮ A note on the lower bound of centralized radio broadcasting for planar reachability graphs ⋮ Time-Efficient Broadcast in Radio Networks

This page was built for publication: Faster communication in known topology radio networks