Joint Antenna and User Scheduling for MU MIMO Systems Using Efficient Binary Artificial Bee Colony Algorithm.

In this paper, we present the MU (multi-user) MIMO (multiple-input & multiple-output) system which is capable to serve the maximum number of users without additional bandwidth or power budget. MIMO systems maximize the channel capability as per the DPC scheme (Dirty Paper Coding). According to DPC, several antennas distributed over the base station are used for serving multiple users simultaneously. Nevertheless, DPC is a comprehensive search algorithm employing sequences of encoded user data for transmitting information to multiple users. Due to increased user density and subsequent transmit antennas in the MU-MIMO system, the exhaustive search (i.e. DPC) becomes cumbersome with the expanded search space domain. This search task would not be completed within a coherence time frame of the packet data communication system. The required objective is to consider this as a cost function for optimization to maximize the realizable sum-rate (throughput) of the MU-MIMO systems. This paper illuminates the joint antenna and user scheduling (JAAU) process with binary artificial bee colony (binary ABC) accomplishing nearly 98–99% of system throughput with the suggestively decreased figure in computation complexity and run time. Binary ABC is observed to have the global optimum value swiftly within the stipulated packet time frame of next-generation wireless data communications. Moreover, binary ABC achieves an appreciable system capacity for MU-MIMO systems as compared with DPC (which attains the maximum system throughput with the highest complexity). These findings are corroborated with exhaustive simulation results presented in this article. [ABSTRACT FROM AUTHOR]