Information dissemination on multiple channels
Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Time-efficient randomized multiple-message broadcast in radio networks
Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Time-optimal information exchange on multiple channels
FOMC '11 Proceedings of the 7th ACM ACM SIGACT/SIGMOBILE International Workshop on Foundations of Mobile Computing
Efficient distributed communication in ad-hoc radio networks
ICALP'11 Proceedings of the 38th international conference on Automata, languages and programming - Volume Part II
Deterministic multi-channel information exchange
Proceedings of the twenty-fourth annual ACM symposium on Parallelism in algorithms and architectures
Distributed multiple-message broadcast in wireless ad-hoc networks under the SINR model
SIROCCO'12 Proceedings of the 19th international conference on Structural Information and Communication Complexity
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 data communication when the bandwidth is limited to one wave frequency. The key restriction of such networks is mutual interference of packets arriving simultaneously at a node. The many-to-many (m2m) communication primitive involves p participant nodes from among n nodes in the network, where the distance between any pair of participants is at most d. The task is to have all the participants get to know all the input messages. We consider three cases of the m2m communication problem. In the ad-hoc case, each participant knows only its name and the values of n, p and d. In the partially centralized case, each participant knows the topology of the network and the values of p and d, but does not know the names of the other participants. In the centralized case, each participant knows the topology of the network and the names of all the participants. For the centralized m2m problem, we give deterministic protocols, for both undirected and directed networks, working in time, which is provably optimal. For the partially centralized m2m problem, we give a randomized protocol for undirected networks working in time with high probability (whp), and we show that any deterministic protocol requires time. For the ad-hoc m2m problem, we develop a randomized protocol for undirected networks that works in time whp. We show two lower bounds for the ad-hoc m2m problem. One lower bound states that any randomized protocol for the m2m ad hoc problem requires expected time. Another lower bound states that for any deterministic protocol for the m2m ad hoc problem, there is a network on which the protocol requires time when np(n)=Ω(n) and d1, and that it requires Ω(n) time when np(n)=o(n).