A lower bound for radio broadcast
Journal of Computer and System Sciences
Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
A Strahler bijection between Dyck paths and planar trees
Discrete Mathematics
The impact of information on broadcasting time in linear radio networks
Theoretical Computer Science
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
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
Optimal deterministic broadcasting in known topology radio networks
Distributed Computing
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
Optimal gossiping with unit size messages in known topology radio networks
CAAN'06 Proceedings of the Third international conference on Combinatorial and Algorithmic Aspects of Networking
On Radio Broadcasting in Random Geometric Graphs
DISC '08 Proceedings of the 22nd international symposium on Distributed Computing
Time-efficient broadcasting in radio networks: a review
ICDCIT'07 Proceedings of the 4th international conference on Distributed computing and internet technology
Minimum-latency gossiping in multi-hop wireless mesh networks
ICC'09 Proceedings of the 2009 IEEE international conference on Communications
Energy and time efficient broadcasting in known topology radio networks
DISC'07 Proceedings of the 21st international conference on Distributed Computing
| Hi-index | 0.00 |
We study the communication primitives of broadcasting (one-to-all communication) and gossiping (all-to-all communication) in known topology radio networks, i.e., where for each primitive the schedule of transmissions is precomputed based on full knowledge about the size and the topology of the network. We show that gossiping can be completed in $O(D+\frac{\Delta\log n}{\log{\Delta}-\log{\log n}})$ time units in any radio network of size n, diameter D and maximum degree Δ= Ω(logn). This is an almost optimal schedule in the sense that there exists a radio network topology, such as: a Δ-regular tree in which the radio gossiping cannot be completed in less than $\Omega(D+\frac{\Delta\log n}{\log{\Delta}})$ units of time. Moreover, we show a $D+O(\frac{\log^3 n}{\log{\log n}})$ schedule for the broadcast task. Both our transmission schemes significantly improve upon the currently best known schedules in Gąsieniec, Peleg and Xin [PODC'05], i.e., a O(D+Δlogn) time schedule for gossiping and a D+O(log3n) time schedule for broadcast. Our broadcasting schedule also improves, for large D, a very recent O(D+log2n) time broadcasting schedule by Kowalski and Pelc.