A data structure for dynamic trees
Journal of Computer and System Sciences
A lower bound for radio broadcast
Journal of Computer and System Sciences
Multiple communication im multihop radio networks
SIAM Journal on Computing
Journal of Computer and System Sciences
Fast broadcasting and gossiping in radio networks
Journal of Algorithms
Gossiping with Bounded Size Messages in ad hoc Radio Networks
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
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
Distributed broadcast in radio networks of unknown topology
Theoretical Computer Science
Deterministic broadcasting in ad hoc radio networks
Distributed Computing
Broadcasting in undirected ad hoc radio networks
Distributed Computing - Special issue: PODC 02
Many-to-Many Communication in Radio Networks
Algorithmica
Bounded-contention coding for wireless networks in the high SNR regime
DISC'12 Proceedings of the 26th international conference on Distributed Computing
Randomized broadcast in radio networks with collision detection
Proceedings of the 2013 ACM symposium on Principles of distributed computing
Hi-index | 0.00 |
We present new distributed deterministic solutions to two communication problems in n-node ad-hoc radio networks: rumor gathering and multi-broadcast. In these problems, some or all nodes of the network initially contain input data called rumors, which have to be learned by other nodes. In rumor gathering, there are k rumors initially distributed arbitrarily among the nodes, and the goal is to collect all the rumors at one node. Our rumor gathering algorithm works in O((k + n) log n) time and our multi-broadcast algorithm works in O(k log3 n + n log4 n) time, for any n-node networks and k rumors (with arbitrary k), which is a substantial improvement over the best previously known deterministic solutions to these problems. As a consequence, we exponentially decrease the gap between upper and lower bounds on the deterministic time complexity of four communication problems: rumor gathering, multi-broadcast, gossiping and routing, in the important case when every node has initially at most one rumor (this is the scenario for gossiping and for the usual formulation of routing). Indeed, for k = O(n), our results simultaneously decrease the complexity gaps for these four problems from polynomial to polylogarithmic in the size of the graph. Moreover, our deterministic gathering algorithm applied for k = O(n) rumors, improves over the best previously known randomized algorithm of time O(k log n + n log2 n).