k-Selection Protocols from Energetic Complexity Perspective - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Communication Dans Un Congrès Année : 2013

k-Selection Protocols from Energetic Complexity Perspective

Résumé

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.
Fichier principal
Vignette du fichier
i3e-main.pdf (157.14 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-00769575 , version 1 (02-01-2013)

Identifiants

Citer

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⟩
139 Consultations
202 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More