Skip to Main content Skip to Navigation
Conference papers

k-Selection Protocols from Energetic Complexity Perspective

Marcin Kardas 1 Marek Klonowski 1 Dominik Pajak 2, 3 Kamil Wolny 1 
2 CEPAGE - Algorithmics for computationally intensive applications over wide scale distributed platforms
Université Sciences et Technologies - Bordeaux 1, Inria Bordeaux - Sud-Ouest, École Nationale Supérieure d'Électronique, Informatique et Radiocommunications de Bordeaux (ENSEIRB), CNRS - Centre National de la Recherche Scientifique : UMR5800
Abstract : In this paper we discuss energetic complexity aspects of k-Selection protocols for the single-hop radio network (that is equivalent to Multiple Access Channel model). The aim is to grant each of k activated stations exclusive access to communication channel. We consider both deterministic as well as randomized algorithms. Our main goal is to investigate relations between minimal time of execution (time complexity) and energy consumption (energetic complexity). We present lower bound for energetic complexity for some classes of algorithms for k-Selection. We also present randomized algorithm efficient in terms of both time and energetic complexity.
Complete list of metadata

Cited literature [20 references]  Display  Hide  Download
Contributor : Dominik Pajak Connect in order to contact the contributor
Submitted on : Wednesday, January 2, 2013 - 12:50:43 PM
Last modification on : Saturday, June 25, 2022 - 8:29:44 PM
Long-term archiving on: : Wednesday, April 3, 2013 - 3:48:10 AM


Files produced by the author(s)




Marcin Kardas, Marek Klonowski, Dominik Pajak, Kamil Wolny. k-Selection Protocols from Energetic Complexity Perspective. APCDM - 16th Workshop on Advances in Parallel and Distributed Computational Models in IPDPS, May 2013, Boston, United States. pp.726-733, ⟨10.1109/IPDPSW.2013.80⟩. ⟨hal-00769575⟩



Record views


Files downloads