TY - GEN
T1 - Efficient distributed communication in ad-hoc radio networks
AU - Chlebus, Bogdan S.
AU - Kowalski, Dariusz R.
AU - Pelc, Andrzej
AU - Rokicki, Mariusz A.
PY - 2011
Y1 - 2011
N2 - 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).
AB - 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).
KW - distributed algorithm
KW - gathering
KW - gossiping
KW - multi-broadcast
KW - radio network
KW - routing
UR - http://www.scopus.com/inward/record.url?scp=79959932628&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=79959932628&partnerID=8YFLogxK
U2 - 10.1007/978-3-642-22012-8_49
DO - 10.1007/978-3-642-22012-8_49
M3 - Conference contribution
AN - SCOPUS:79959932628
SN - 9783642220111
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 613
EP - 624
BT - Automata, Languages and Programming - 38th International Colloquium, ICALP 2011, Proceedings
T2 - 38th International Colloquium on Automata, Languages and Programming, ICALP 2011
Y2 - 4 July 2011 through 8 July 2011
ER -