Fully distributed optimal channel assignment for open spectrum access
Distributed, Parallel, and Cluster Computing
2013-12-31 v1 Information Theory
Networking and Internet Architecture
math.IT
Optimization and Control
Abstract
In this paper we address the problem of fully distributed assignment of users to sub-bands such that the sum-rate of the system is maximized. We introduce a modified auction algorithm that can be applied in a fully distributed way using an opportunistic CSMA assignment scheme and is optimal. We analyze the expected time complexity of the algorithm and suggest a variant to the algorithm that has lower expected complexity. We then show that in the case of i.i.d Rayleigh channels a simple greedy scheme is asymptotically optimal as increases or as the number of users is increased to infinity. We conclude by providing simulated results of the suggested algorithms.
Cite
@article{arxiv.1312.7685,
title = {Fully distributed optimal channel assignment for open spectrum access},
author = {Oshri Naparstek and Amir Leshem},
journal= {arXiv preprint arXiv:1312.7685},
year = {2013}
}