General order selection allocation for decentralized multiple access networks

Authors:
Maged Elkashlan;Zhuo Chen;Iain B. Collings;Witold A. Krzymien
Affiliations:
Wireless Technologies Laboratory, CSIRO ICT Centre, Sydney, New South Wales, Australia;Wireless Technologies Laboratory, CSIRO ICT Centre, Sydney, New South Wales, Australia;Wireless Technologies Laboratory, CSIRO ICT Centre, Sydney, New South Wales, Australia;University of Alberta, TRLabs, Edmonton, Alberta, Canada
Venue:
ICC'09 Proceedings of the 2009 IEEE international conference on Communications
Year:
2009

Citing 5
Cited 0

Subcarrier Allocation and Bit Loading Algorithms for OFDMA-Based Wireless Networks

IEEE Transactions on Mobile Computing
A "Group-Division Multiple Access" framework for channel access to multiple destinations

Ad Hoc Networks
Performance analysis of combined transmit selection diversity and receive generalized selection combining in Rayleigh fading channels

IEEE Transactions on Wireless Communications
Performance Analysis of Multiuser Diversity in MIMO Systems with Antenna Selection

IEEE Transactions on Wireless Communications
Channel Assignment Strategies for Multiradio Wireless Mesh Networks: Issues and Solutions

IEEE Communications Magazine

Quantified Score

Hi-index	0.00

Visualization

Abstract

Decentralized multiple access networks require dynamic spectrum allocation to efficiently and fairly allocate resources among multiple users. In this paper, we consider the problem of spectrum allocation from the standpoint of diversity combining, and in particular as an explicit case of selection combining (SC). General order selection allocation (GOSA) was previously proposed by the authors as a low-complexity spectrum allocation scheme for decentralized multiple access networks. In this paper, noting that previous analytical results on the error performance of GOSA are for independent identically distributed (i.i.d.) Rayleigh fading, we carry out a thorough and exact analysis of GOSA for the i.i.d. Nakagami-m fading scenario. In particular, based on new results on the exact and asymptotic average error probability of the γ-th order statistic, we obtain exact and asymptotic closed-form expressions for the error performance of GOSA. Numerical results show that the performance of the algorithm is close to that of the highly complex optimal search method.