Subcarrier Allocation and Bit Loading Algorithms for OFDMA-Based Wireless Networks
IEEE Transactions on Mobile Computing
Transmit antenna selection schemes with reduced feedback rate
IEEE Transactions on Wireless Communications
Asymptotically fair transmission scheduling over fading channels
IEEE Transactions on Wireless Communications
IEEE Transactions on Wireless Communications
Joint Power Adaptation, Scheduling, and Routing for Ultra Wide Band Networks
IEEE Transactions on Wireless Communications
General Order Selection Combining for Nakagami and Weibull Fading Channels
IEEE Transactions on Wireless Communications
Downlink Throughput Maximization for Interference Limited Multiuser Systems: TDMA versus CDMA
IEEE Transactions on Wireless Communications
Performance Analysis of Multiuser Diversity in MIMO Systems with Antenna Selection
IEEE Transactions on Wireless Communications
Opportunistic beamforming using dumb antennas
IEEE Transactions on Information Theory
Receive antenna selection for MIMO flat-fading channels: theory and algorithms
IEEE Transactions on Information Theory
Capacity of MIMO Channels With Antenna Selection
IEEE Transactions on Information Theory
CDMA/HDR: a bandwidth efficient high speed wireless data service for nomadic users
IEEE Communications Magazine
Channel Assignment Strategies for Multiradio Wireless Mesh Networks: Issues and Solutions
IEEE Communications Magazine
LSMS/ICSEE'10 Proceedings of the 2010 international conference on Life system modeling and simulation and intelligent computing, and 2010 international conference on Intelligent computing for sustainable energy and environment: Part II
Hi-index | 0.00 |
Decentralized multiple access networks require dynamic spectrum allocation to efficiently and fairly allocate resources among multiple users. We view the allocation problem from the standpoint of diversity combining, and in particular as an explicit case of selection combining (SC). We consider a decentralized multi-user parallel-access spectrum allocation algorithm which generalizes SC. Each user selects the frequency band with the highest gain among the subset of bands not already being used by other users. We present an exact bit error rate (BER) analysis of the algorithm. We consider Nakagami-m fading, and treat the cases of independent identically distributed (i.i.d.) channels, independent but not necessarily identically distributed (i.n.d.) channels, and correlated channels. In deriving the BER, we first present new results on the exact average error probability corresponding to the rth order statistic, in each channel scenario. Numerical results show that the performance of the algorithm is close to that of the highly complex optimal search method, especially in the correlated fading case.