k-Selection Protocols from Energetic Complexity Perspective

Abstract

In this paper we discuss energetic complexity aspects of k-Selection protocols for a 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 the communication channel. We consider both deterministic as well as randomized model. 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 protocols for k-Selection (both deteministic and randomized). We also present and analyse several randomized protocols efficient in terms of both time and energetic complexity.