k-Selection Protocols from Energetic Complexity Perspective

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.