A Stable User Matching Scheme In VMIMO Networks Based On Coalitional Games

With the development of the times, new wireless communication technologies are emerging constantly, affecting people’s work and life. In addition, the development of mobile Internet and multimedia services has caused people’s rapid demand growth for high reliability and large capacity of the wireless communication system. However, available time and frequency resource is very limited currently and the traditional wireless communication system is facing a severe test. How to effectively improve the quality of communication and transmission rate is always one of the most active research topics in the field of wireless communication system. This research has important theoretical and practical significance.MIMO(Multiple Input Multiple Output) technology is the important core technology to solve this problem which is widely used in 4G, WiMAX and so on. Without any increase in bandwidth and sending power of antenna, transmission reliability and system capacity could be increased exponentially using the technology of diversity and multiplexing. But because of the restrictions of user terminal volume, cost and so on, in practice, the user terminal is not allowed to configure multiple antennas and the technology of Virtual MIMO arises. Virtual MIMO puts single-antenna user terminals together to form a virtual multi-antenna array and then transmit data, which is similar to the MIMO transmission system with the diversity and multiplexing gain. The user matching therein is a key problem as different user matching will result in different system performance.This paper considers matching N users to communicate with the base station configuring M antennas, using TDMA(Time Division Multiple Access) transmission scheduling. Cooperative diversity of Virtual MIMO is adopted inside the coalition and we especially consider the time cost of broadcasting data during the cooperation. It is relatively novel that we combine the idea of cooperation and competition of coalitional games in economics and put forward the concept of stable user matching. Stable user matching can improve the system performance by encouraging users to participate in cooperative transmission and reducing the system control cost, which has vital significance. This paper has a detailed analysis about its definition and existence and adopts the proposed merge and split rules based on Pareto order to get the final result of stable matching. Simulations show that the scheme reaches a good performance on capacity and fairness.