Decentralized dynamic allocation of subchannels in multiple access networks

Maged Elkashlan*, Iain B. Collings, Zhuo Chen, Witold A. Krzymień

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

2 Citations (Scopus)


This letter introduces and analyzes a new distributed dynamic subchannel allocation algorithm for multiple access networks. The proposed algorithm is based on general order selection, and exhibits low complexity and low processing delay. The exact and asymptotic closed-form expressions for the average error probability are derived, and it is shown that there is a significant system performance advantage over the conventional uniform allocation approach. Numerical studies also show that the performance of our new algorithm can be close to that of the highly complex optimal search method.

Original languageEnglish
Pages (from-to)761-763
Number of pages3
JournalIEEE Communications Letters
Issue number10
Publication statusPublished - 2008
Externally publishedYes


  • Channel allocation
  • Diversity
  • Fading channels
  • General order selection


Dive into the research topics of 'Decentralized dynamic allocation of subchannels in multiple access networks'. Together they form a unique fingerprint.

Cite this