Fully distributed optimal channel assignment for open spectrum access

Oshri Naparstek, Amir Leshem

Research output: Contribution to journalArticlepeer-review

37 Scopus citations


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.

Original languageAmerican English
Article number6630117
Pages (from-to)283-294
Number of pages12
JournalIEEE Transactions on Signal Processing
Issue number2
StatePublished - 15 Jan 2014
Externally publishedYes


  • Wireless communication
  • cognitive radio
  • radio spectrum management


Dive into the research topics of 'Fully distributed optimal channel assignment for open spectrum access'. Together they form a unique fingerprint.

Cite this