MIMO broadcast scheduling using binary spider monkey optimization algorithm

Summary Multi‐user multiple‐input multiple‐output (MU‐MIMO) system has the capability of delivering optimal system capacity that provides the simultaneous service to a large number of users using dirty paper coding (DPC) scheme. However, the DPC scheme is quite difficult to be implemented in the real‐time scenario as the computational complexity is very high and the process cannot be accomplished within the duration of few coherence periods. In this paper, we have adopted a newly developed binary spider monkey optimization (binary SMO) algorithm for the joint user and antenna scheduling (JUAS) problem to maximize the achievable system sum‐rate performance. It has been shown that JUAS with binary SMO achieves nearly 99% of system throughput achieved by the extensive search algorithm (ESA) using DPC. Also it is compared with binary flower pollination algorithm (binary FPA) to check which of the two gives better result. It is observed that the binary SMO in JUAS achieves a globally optimal solution quite rapidly, to remain well within the modern‐day packet data communication interval. The proposed binary SMO shows low computational complexity and computation time as compared to ESA (i.e., DPC). Also when it is compared with binary FPA, it shows quite a significant improvement in system throughput. Moreover, the effectiveness of binary SMO in the MU‐MIMO broadcasting scenario is verified through extensive simulation results. The fission‐fusion social structure‐based swarm intelligence inspired optimization algorithm, the binary spider monkey optimization (SMO) algorithm achieves the system sum‐rate/throughput very close to that obtained by dirty paper coding (DPC) scheme, that is, the exhaustive search algorithm. Moreover, this scheme achieves better system sum‐rate/throughput than flower pollination algorithm (FPA), genetic algorithm (GA), and different existing schemes. Furthermore, both the time complexity and the computational complexity of the binary SMO scheme are lower than that of exhaustive search algorithm (DPC).