Decentralized dynamic allocation of subchannels in multiple access networks

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

doi:10.1109/LCOMM.2008.081005

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 journal › Article

2 Citations (Scopus)

Abstract

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 language	English
Pages (from-to)	761-763
Number of pages	3
Journal	IEEE Communications Letters
Volume	12
Issue number	10
DOIs	https://doi.org/10.1109/LCOMM.2008.081005
Publication status	Published - 2008
Externally published	Yes

Keywords

Channel allocation
Diversity
Fading channels
General order selection

Access to Document

10.1109/LCOMM.2008.081005

Link to publication in Scopus

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

Cite this

Elkashlan, M., Collings, I. B., Chen, Z., & Krzymień, W. A. (2008). Decentralized dynamic allocation of subchannels in multiple access networks. IEEE Communications Letters, 12(10), 761-763. https://doi.org/10.1109/LCOMM.2008.081005

@article{cef91b6b41e54e67b5441cdbb12d2d74,

title = "Decentralized dynamic allocation of subchannels in multiple access networks",

abstract = "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.",

keywords = "Channel allocation, Diversity, Fading channels, General order selection",

author = "Maged Elkashlan and Collings, {Iain B.} and Zhuo Chen and Krzymień, {Witold A.}",

year = "2008",

doi = "10.1109/LCOMM.2008.081005",

language = "English",

volume = "12",

pages = "761--763",

journal = "IEEE Communications Letters",

issn = "1089-7798",

publisher = "Institute of Electrical and Electronics Engineers (IEEE)",

number = "10",

}

TY - JOUR

T1 - Decentralized dynamic allocation of subchannels in multiple access networks

AU - Elkashlan, Maged

AU - Collings, Iain B.

AU - Chen, Zhuo

AU - Krzymień, Witold A.

PY - 2008

Y1 - 2008

N2 - 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.

AB - 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.

KW - Channel allocation

KW - Diversity

KW - Fading channels

KW - General order selection

UR - http://www.scopus.com/inward/record.url?scp=54949105009&partnerID=8YFLogxK

U2 - 10.1109/LCOMM.2008.081005

DO - 10.1109/LCOMM.2008.081005

M3 - Article

VL - 12

SP - 761

EP - 763

JO - IEEE Communications Letters

JF - IEEE Communications Letters

SN - 1089-7798

IS - 10

ER -