Multiple communication in multi-hop radio networks
Proceedings of the eighth annual ACM Symposium on Principles of distributed computing
On the complexity of radio communication
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
Proceedings of the 3rd International Workshop on Distributed Algorithms
Faster communication in known topology radio networks
Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing
Coloring unstructured radio networks
Proceedings of the seventeenth annual ACM symposium on Parallelism in algorithms and architectures
Probability and Computing: Randomized Algorithms and Probabilistic Analysis
Probability and Computing: Randomized Algorithms and Probabilistic Analysis
Strong Edge Coloring for Channel Assignment in Wireless Radio Networks
PERCOMW '06 Proceedings of the 4th annual IEEE international conference on Pervasive Computing and Communications Workshops
Local broadcasting in the physical interference model
Proceedings of the fifth international workshop on Foundations of mobile computing
Coloring unstructured wireless multi-hop networks
Proceedings of the 28th ACM symposium on Principles of distributed computing
IEEE Journal on Selected Areas in Communications
| Hi-index | 0.00 |
The paper deals with radio network distributed algorithms where initially no information about node degrees is available. We show that the lack of such an information affects the time complexity of existing fundamental algorithms by only a polylogarithmic factor. More precisely, given an n-node graph modeling a multi-hop radio network, we provide a O(log2 n) time distributed algorithm that computes w.h.p., a constant approximation value of the degree of each node. We also provide a O(Δlog n+log2 n) time distributed algorithm that computes w.h.p., a constant approximation value of the local maximum degree of each node, where the global maximum degree Δ of the graph is not known. Using our algorithm as a plug-and-play procedure, we show that the local maximum degree can be used instead of Δ to break the symmetry efficiently. We illustrate this claim by revisiting some fundamental algorithms that use Δ as a key parameter. First, we investigate the generic problem of simulating any point-to-point interference-free message passing algorithm in the radio network model. Then, we study the fundamental coloring problem in unit disk graphs. The obtained results show that the local maximum degree allows nodes to self-organize in a local manner and to avoid the radio interferences from being a communication bottleneck.