PODC '87 Proceedings of the sixth annual ACM Symposium on Principles of distributed computing
Introduction to algorithms
A lower bound for radio broadcast
Journal of Computer and System Sciences
Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
Fast broadcasting and gossiping in radio networks
Journal of Algorithms
On adaptive deterministic gossiping in ad hoc radio networks
Information Processing Letters
A Strahler bijection between Dyck paths and planar trees
Discrete Mathematics
Gossiping with Bounded Size Messages in ad hoc Radio Networks
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
On Randomized Broadcasting and Gossiping in Radio Networks
COCOON '02 Proceedings of the 8th Annual International Conference on Computing and Combinatorics
Gossiping with Unit Messages in Known Radio Networks
TCS '02 Proceedings of the IFIP 17th World Computer Congress - TC1 Stream / 2nd IFIP International Conference on Theoretical Computer Science: Foundations of Information Technology in the Era of Networking and Mobile Computing
The Impact of Knowledge on Broadcasting Time in Radio Networks
ESA '99 Proceedings of the 7th Annual European Symposium on Algorithms
Broadcasting Algorithms in Radio Networks with Unknown Topology
FOCS '03 Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science
Improved schedule for radio broadcast
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Faster communication in known topology radio networks
Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing
SFCS '90 Proceedings of the 31st Annual Symposium on Foundations of Computer Science
A new model for scheduling packet radio networks
INFOCOM'96 Proceedings of the Fifteenth annual joint conference of the IEEE computer and communications societies conference on The conference on computer communications - Volume 3
Minimum-latency gossiping in multi-hop wireless networks
Proceedings of the 9th ACM international symposium on Mobile ad hoc networking and computing
Latency-optimal communication in wireless mesh networks
APCC'09 Proceedings of the 15th Asia-Pacific conference on Communications
Minimum-latency gossiping in multi-hop wireless mesh networks
ICC'09 Proceedings of the 2009 IEEE international conference on Communications
Faster centralized communication in radio networks
ISAAC'06 Proceedings of the 17th international conference on Algorithms and Computation
On efficient gossiping in radio networks
SIROCCO'09 Proceedings of the 16th international conference on Structural Information and Communication Complexity
Randomized broadcast in radio networks with collision detection
Proceedings of the 2013 ACM symposium on Principles of distributed computing
Information dissemination in unknown radio networks with large labels
Theoretical Computer Science
| Hi-index | 0.00 |
Gossiping is a communication primitive where each node of a network possesses a unique message that is to be communicated to all other nodes in the network. We study the gossiping problem in known topology radio networks where the schedule of transmissions is precomputed in advance based on full knowledge about the size and the topology of the network. In addition we consider the case where it is only possible to transmit a unit size message in each time step. This gives a more realistic model than if arbitrary length messages can be sent during each time step, as has been the case in most previous studies of the gossiping problem. In this paper, we propose an optimal randomized schedule that uses O(nlogn) time units to complete the gossiping task with high probability in any radio network of size n. This matches the lower bound of Ω(nlogn) by Gąsieniec and Potapov in [17] [TCS’02]. Our new gossiping schedule is based on the notion of a gathering spanning tree proposed by Gąsieniec, Peleg and Xin in [19] [PODC’05].