We consider the range assignment problem in ad-hoc wireless networks in the context of selfish agents: a network manager aims in assigning transmission ranges to the stations so to achieve a suitable network with a minimal overall energy; stations are not directly controlled by the manager and may refuse to transmit with a certain transmission range because this results in a power consumption proportional to that range. We investigate the existence of payment schemes which induce the stations to cooperate with a network manager computing a range assignment, that is, truthful mechanisms for the range assignment problem. © Springer-Verlag 2004.
CITATION STYLE
Ambühl, C., Clementi, A. E. F., Penna, P., Rossi, G., & Silvestri, R. (2004). Energy consumption in radio networks: Selfish agents and rewarding mechanisms. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2909, 248–251. https://doi.org/10.1007/978-3-540-24592-6_20
Mendeley helps you to discover research relevant for your work.