Swarm intelligence
Fundamentals of wireless communication
Fundamentals of wireless communication
GSA: A Gravitational Search Algorithm
Information Sciences: an International Journal
A new modified particle swarm optimization algorithm for adaptive equalization
Digital Signal Processing
Cellular particle swarm optimization
Information Sciences: an International Journal
Information Sciences: an International Journal
A modified Artificial Bee Colony algorithm for real-parameter optimization
Information Sciences: an International Journal
Adaptive resource allocation in multiuser OFDM systems with proportional rate constraints
IEEE Transactions on Wireless Communications
Multiuser OFDM with adaptive subcarrier, bit, and power allocation
IEEE Journal on Selected Areas in Communications
Transmit power adaptation for multiuser OFDM systems
IEEE Journal on Selected Areas in Communications
The effect of load on agent-based algorithms for distributed task allocation
Information Sciences: an International Journal
A Novel Immune Optimization Algorithm for Fairness Resource Allocation in Cognitive Wireless Network
Wireless Personal Communications: An International Journal
Hi-index | 0.07 |
Orthogonal frequency division multiple access (OFDMA) is a promising technique, which can provide high downlink capacity for future wireless systems. The total capacity of OFDMA can be maximized by adaptively assigning subchannels to the user with the best gain for that subchannel, with power subsequently distributed by water-filling algorithm. In this paper we have proposed the use of a customized particle swarm optimization (PSO) aided algorithm to allocate the subchannels. The PSO algorithm is population-based: a set of potential solutions evolves to approach a near-optimal solution for the problem under study. The customized algorithm works for discrete particle positions unlike the classical PSO algorithm which is valid for only continuous particle positions. It is shown that the proposed method obtains higher sum capacities as compared to that obtained by previous works, with comparable computational complexity.