Title :
On ?-Alert Problem
Author :
Klonowski, Marek ; Pajak, Dominik
Author_Institution :
Fac. of Fundamental Problems of Technol., Wroclaw Univ. of Technol., Wrocław, Poland
Abstract :
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 Vegastype algorithm which is immune to an adversary.
Keywords :
radio networks; Las Vegastype algorithm; activated stations; adaptive deterministic algorithms; collision detection; hop radio network; k-selection problem; on λ-alert problem; standard Alert problem; Algorithm design and analysis; Broadcasting; Complexity theory; Nickel; Protocols; Sensors; Vectors; Alert; ad hoc network; k-Selection problem;
Conference_Titel :
Parallel & Distributed Processing Symposium (IPDPS), 2012 IEEE 26th International
Conference_Location :
Shanghai
Print_ISBN :
978-1-4673-0975-2
DOI :
10.1109/IPDPS.2012.98
