Skip to Main content Skip to Navigation
Reports

Radio Network Distributed Algorithms in the Unknown Neighborhood Model

Bilel Derbel 1, 2 El-Ghazali Talbi 1, 2
2 DOLPHIN - Parallel Cooperative Multi-criteria Optimization
LIFL - Laboratoire d'Informatique Fondamentale de Lille, Inria Lille - Nord Europe
Abstract : The paper deals with radio network distributed algorithms where nodes are not aware of their one hop neighborhood. Given an n-node graph modeling a multihop network of radio devices, we give a O(log^2 n) time distributed algorithm that computes w.h.p., a constant approximation value of the degree of each node. We also provide a O( \Delta log n + log^2 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 \Delta of the graph is not known. Using our algorithms as a plug-and-play procedure, we show that many existing distributed algorithms requiring the knowledge of to execute efficiently can be run with essentially the same time complexity by using the local maximum degree instead of . In other words, using the local maximum degree is sufficient to break the symmetry in a local and efficient manner. We illustrate this claim by investigating the complexity of some basic problems. First, we investigate the generic problem of simulating any classical message passing algorithm in the radio network model. Then, we study the fundamental edge/node coloring problem in the special case of unit disk graphs. The obtained results show that knowing the local maximum degree allows to coordinate the nodes locally and avoid interferences in radio networks.
Complete list of metadatas

Cited literature [12 references]  Display  Hide  Download

https://hal.inria.fr/inria-00292155
Contributor : Bilel Derbel <>
Submitted on : Tuesday, July 15, 2008 - 11:09:48 AM
Last modification on : Thursday, May 28, 2020 - 9:22:09 AM
Document(s) archivé(s) le : Saturday, November 26, 2016 - 12:02:32 AM

File

RR-6581.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : inria-00292155, version 3

Citation

Bilel Derbel, El-Ghazali Talbi. Radio Network Distributed Algorithms in the Unknown Neighborhood Model. [Research Report] RR-6581, INRIA. 2008, pp.17. ⟨inria-00292155v3⟩

Share

Metrics

Record views

635

Files downloads

572