Time efficient centralized gossiping in radio networks

DOI10.1016/J.TCS.2007.03.059MaRDI QIDQ2383602zbMATH OpenOpenAlexFDO

Authors Leszek Gąsieniec, Qin Xin, Igor Potapov

Publication date 19 September 2007

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.tcs.2007.03.059

zbMATH Keywords

radio networksbroadcasting and gossipingcentralized algorithms

Mathematics Subject Classification ID

Communication networks in operations research (90B18) Network design and communication in computer systems (68M10)

Recommendations

• Structural Information and Communication Complexity
• Faster Centralized Communication in Radio Networks
• Faster deterministic communication in radio networks
• An \(O(n^{1.5})\) deterministic gossiping algorithm for radio networks
• scientific article; zbMATH DE number 1796990

Cites work

• scientific article; zbMATH DE number 1670865 (Why is no real title available?)
• scientific article; zbMATH DE number 1947418 (Why is no real title available?)
• scientific article; zbMATH DE number 1796990 (Why is no real title available?)
• scientific article; zbMATH DE number 2086637 (Why is no real title available?)
• scientific article; zbMATH DE number 2089989 (Why is no real title available?)
• scientific article; zbMATH DE number 2119730 (Why is no real title available?)
• A lower bound for radio broadcast
• Algorithm Theory - SWAT 2004
• An $\Omega(D\log (N/D))$ Lower Bound for Broadcast in Radio Networks
• An \(O(n^{1.5})\) deterministic gossiping algorithm for radio networks
• Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
• Broadcasting algorithms in radio networks with unknown topology
• Broadcasting in undirected ad hoc radio networks
• Centralized broadcast in multihop radio networks
• Deterministic broadcasting in ad hoc radio networks
• Deterministic communication in radio networks with large labels
• Distributed multi-broadcast in unknown radio networks
• Fast broadcasting and gossiping in radio networks
• Faster Deterministic Broadcasting in Ad Hoc Radio Networks
• Faster communication in known topology radio networks
• Improved schedule for radio broadcast
• Information Dissemination in Trees
• On Broadcasting in Radio Networks--Problem Analysis and Protocol Design
• On adaptive deterministic gossiping in ad hoc radio networks.
• On the time-complexity of broadcast in multi-hop radio networks: An exponential gap between determinism and randomization
• The impact of information on broadcasting time in linear radio networks.

Cited in

(13)

• Optimal Gossiping with Unit Size Messages in Known Topology Radio Networks
• Central limit theorem for time to broadcast in radio networks
• Average-Time Complexity of Gossiping in Radio Networks
• Efficient Broadcasting in Known Geometric Radio Networks with Non-uniform Ranges
• Structural Information and Communication Complexity
• Asymptotically optimal gossiping in radio networks
• Almost optimal distributed M2M multicasting in wireless mesh networks
• Faster Centralized Communication in Radio Networks
• Fast broadcasting and gossiping in radio networks
• On Efficient Gossiping in Radio Networks
• Labeling schemes for deterministic radio multi-broadcast
• Time efficient k-shot broadcasting in known topology radio networks
• Optimal gossiping in geometric radio networks in the presence of dynamical faults

This page was built for publication: Time efficient centralized gossiping in radio networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2383602)