k-Selection Protocols from Energetic Complexity Perspective
PAJAK, Dominik
Algorithmics for computationally intensive applications over wide scale distributed platforms [CEPAGE]
Laboratoire Bordelais de Recherche en Informatique [LaBRI]
Voir plus >
Algorithmics for computationally intensive applications over wide scale distributed platforms [CEPAGE]
Laboratoire Bordelais de Recherche en Informatique [LaBRI]
PAJAK, Dominik
Algorithmics for computationally intensive applications over wide scale distributed platforms [CEPAGE]
Laboratoire Bordelais de Recherche en Informatique [LaBRI]
< Réduire
Algorithmics for computationally intensive applications over wide scale distributed platforms [CEPAGE]
Laboratoire Bordelais de Recherche en Informatique [LaBRI]
Langue
en
Communication dans un congrès
Ce document a été publié dans
APCDM - 16th Workshop on Advances in Parallel and Distributed Computational Models in IPDPS, 2013-05-20, Boston. 2013-05-20p. 726-733
IEEE
Résumé en anglais
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 ...Lire la suite >
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.< Réduire
Origine
Importé de halUnités de recherche