Time efficient centralized gossiping in radio networks

DOI10.1016/J.TCS.2007.03.059zbMATH Open1124.68008OpenAlexW2093890563MaRDI QIDQ2383602FDOQ2383602

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

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

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)

Cites Work

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