Faster Information Gathering in Ad-Hoc Radio Tree Networks
We study information gathering in ad-hoc radio networks. Initially, each node of the network has a piece of information called a rumor, and the overall objective is to gather all these rumors in the designated target node. The ad-hoc property refers to the fact that the topology of the network is unknown when the computation starts. Aggregation of rumors is not allowed, which means that each node may transmit at most one rumor in one step.
We focus on networks with tree topologies, that is we assume that the network is a tree with all edges directed towards the root, but, being ad-hoc, its actual topology is not known. We provide two deterministic algorithms for this problem. For the model that does not assume any collision detection nor acknowledgement mechanisms, we give an \(O(n\log \log n)\)-time algorithm, improving the previous upper bound of \(O(n\log n)\). We also show that this running time can be further reduced to O(n) if the model allows for acknowledgements of successful transmissions.
We thank the anonymous reviewers for constructive comments that helped us improve the presentation.
- 6.Chrobak, M., Costello, K.: Faster information gathering in ad-hoc radio tree networks (2015). arXiv: 1512.02179
- 7.Chrobak, M., Costello, K., Gasieniec, L., Kowalski, D.R.: Information gathering in ad-hoc radio networks with tree topology. In: Zhang, Z., Wu, L., Xu, W., Du, D.-Z. (eds.) COCOA 2014. LNCS, vol. 8881, pp. 129–145. Springer, Heidelberg (2014)Google Scholar
- 15.Kowalski, D.R.: On selection problem in radio networks. In: Proceedings of the Twenty-fourth Annual ACM Symposium on Principles of Distributed Computing, PODC 2005, pp. 158–166 (2005)Google Scholar
- 19.De Marco, G.: Distributed broadcast in unknown radio networks. In: Proceedings of the 19th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2008), pp. 208–217 (2008)Google Scholar
- 21.De Marco, G., Kowalski, D.R.: Contention resolution in a non-synchronized multiple access channel. In: IEEE 27th International Symposium on Parallel Distributed Processing (IPDPS), pp. 525–533 (2013)Google Scholar