On λ-Alert Problem - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2012

On λ-Alert Problem


In this paper we introduce and analyse the λ-Alert problem: in a single hop radio network a subset of stations is activated. The aim of the protocol is to decide if the number of activated stations is greater or equal to λ. This problem is similar to the k-Selection problem. It can also be seen as an extension of the standard Alert problem. In our paper we consider the λ-Alert problem in various settings. We describe characteristics of oblivious and adaptive deterministic algorithms for the model with and without collision detection. We also show some results for randomized algorithms. In particular, we present a very efficient Las Vegas- type algorithm which is immune to an adversary.
Fichier principal
Vignette du fichier
ipdps.pdf (259.38 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-00996841 , version 1 (27-05-2014)



Marek Klonowski, Dominik Pajak. On λ-Alert Problem. IPDPS - 26th IEEE International Parallel and Distributed Processing Symposium, May 2012, Shanghai, China. pp.1057-1067, ⟨10.1109/IPDPS.2012.98⟩. ⟨hal-00996841⟩


119 View
143 Download



Gmail Facebook X LinkedIn More