TY - JOUR
T1 - Fully distributed optimal channel assignment for open spectrum access
AU - Naparstek, Oshri
AU - Leshem, Amir
PY - 2014/1/15
Y1 - 2014/1/15
N2 - 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 SNR increases or as the number of users is increased to infinity. We conclude by providing simulated results of the suggested algorithms.
AB - 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 SNR increases or as the number of users is increased to infinity. We conclude by providing simulated results of the suggested algorithms.
KW - Wireless communication
KW - cognitive radio
KW - radio spectrum management
UR - http://www.scopus.com/inward/record.url?scp=84892578850&partnerID=8YFLogxK
U2 - 10.1109/TSP.2013.2285512
DO - 10.1109/TSP.2013.2285512
M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???
AN - SCOPUS:84892578850
SN - 1053-587X
VL - 62
SP - 283
EP - 294
JO - IEEE Transactions on Signal Processing
JF - IEEE Transactions on Signal Processing
IS - 2
M1 - 6630117
ER -