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
Oblivious gossiping in ad-hoc radio networks
DIALM '01 Proceedings of the 5th international workshop on Discrete algorithms and methods for mobile computing and communications
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
Distributed broadcast in radio networks of unknown topology
Theoretical Computer Science
Broadcasting Algorithms in Radio Networks with Unknown Topology
FOCS '03 Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science
Deterministic broadcasting in ad hoc radio networks
Distributed Computing
Radio communication in random graphs: extended abstract
Proceedings of the seventeenth annual ACM symposium on Parallelism in algorithms and architectures
Generalized framework for selectors with applications in optimal group testing
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
Energy efficient randomised communication in unknown AdHoc networks
Proceedings of the nineteenth annual ACM symposium on Parallel algorithms and architectures
Energy efficient randomised communication in unknown AdHoc networks
Theoretical Computer Science
Fast message dissemination in random geometric ad-hoc radio networks
ISAAC'07 Proceedings of the 18th international conference on Algorithms and computation
Time-optimal information exchange on multiple channels
FOMC '11 Proceedings of the 7th ACM ACM SIGACT/SIGMOBILE International Workshop on Foundations of Mobile Computing
Deterministic multi-channel information exchange
Proceedings of the twenty-fourth annual ACM symposium on Parallelism in algorithms and architectures
Communication problems in random line-of-sight ad-hoc radio networks
SAGA'07 Proceedings of the 4th international conference on Stochastic Algorithms: foundations and applications
Optimal memory-aware Sensor Network Gossiping (or how to break the Broadcast lower bound)
Theoretical Computer Science
Hi-index | 0.00 |
Radio networks model wireless synchronous communication with only one wave frequency used for transmissions. In the problem of many-to-all (M2A) communication, some nodes hold input rumors, and the goal is to have all nodes learn all the rumors. We study the average time complexity of distributed many-to-all communication by deterministic protocols in directed networks under two scenarios: of combined messages, in which all input rumors can be sent in one packet, and of separate messages, in which every rumor requires a separate packet to be transmitted. Let n denote the size of a network and k be the number of nodes activated with rumors; the case when k = n is called gossiping. We give a gossiping protocol for combined messages that works in the average time ${\mathcal O}(n/\log n)$, which is shown to be optimal. For the general M2A communication problem, we show that it can be performed in the average time ${\mathcal O}(\min\{k\log(n/k),n/\log n\})$ with combined messages, and that Ω(k/logn + logn) is a lower bound. We give a gossiping protocol for separate messages that works in the average time ${\mathcal O}(n\log n)$, which is shown to be optimal. For the general M2A communication problem, we develop a protocol for separate messages with the average time ${\mathcal O}(k\log(n/k)\log n)$, and show that Ω(k logn) is a lower bound