ILCINKAS, David; KOWALSKI, Dariusz R.; PELC, Andrzej

doi:10.1007/978-3-540-69355-0_24

Métadonnées

Licence d’utilisation du document

ILCINKAS, David
Laboratoire Bordelais de Recherche en Informatique [LaBRI]
Algorithmics for computationally intensive applications over wide scale distributed platforms [CEPAGE]

KOWALSKI, Dariusz R.
Department of Computer Science [Liverpool]

PELC, Andrzej
Département d'Informatique et d'Ingénierie [DII]

Langue

Communication dans un congrès

Ce document a été publié dans

Proceedings of the 15th International Colloquium on Structural Information and Communication Complexity, Proceedings of the 15th International Colloquium on Structural Information and Communication Complexity, SIROCCO 2008, 2008-06, Villars-sur-Ollon. 2008-06, vol. 5058, p. 291-305

Springer Berlin / Heidelberg

Résumé en anglais

We study deterministic broadcasting in radio networks in the recently introduced framework of network algorithms with {\em advice}. We concentrate on the problem of trade-offs between the number of bits of information (size of advice) available to nodes and the time in which broadcasting can be accomplished. In particular, we ask what is the minimum number of bits of information that must be available to nodes of the network, in order to broadcast very fast. For networks in which constant time broadcast is possible under complete knowledge of the network we give a tight answer to the above question: $O(n)$ bits of advice are sufficient but $o(n)$ bits are not, in order to achieve constant broadcasting time in all these networks. This is in sharp contrast with geometric radio networks of constant broadcasting time: we show that in these networks a constant number of bits suffices to broadcast in constant time. For arbitrary radio networks we present a broadcasting algorithm whose time is inverse-proportional to the size of advice.< Réduire

Mots clés en anglais

radio network

distributed algorithm

deterministic broadcasting

advice

URI

https://oskar-bordeaux.fr/handle/20.500.12278/198626

DOI

http://dx.doi.org/10.1007/978-3-540-69355-0_24

Project ANR

Algorithm Design and Analysis for Implicitly and Incompletely Defined Interaction Networks - ANR-07-BLAN-0322

Origine

Importé de hal

Unités de recherche

Laboratoire Bordelais de Recherche en Informatique (LaBRI) - UMR 5800