A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is
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 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 fordoi:10.1109/ipdpsw.2013.80 dblp:conf/ipps/KardasKPW13 fatcat:tyt4hvybofeh7dkm6tybl6h6su