基于联盟博弈的D2D网络资源分配算法研究

Research on resource allocation algorithm in D2D networks based on alliance game

无线网络中用户数激增使得现有网络架构面临巨大挑战,如何有效提升系统容量是当前亟待解决的问题。作为5G发展中的关键技术,终端直连(Device-to-Device,D2D)通信和稀疏码多址(Sparse Code Multiple Access,SCMA)技术凭借在增大系统容量上的优越性受到了广泛研究。针对SCMA系统中D2D通信的资源分配问题,以最大化系统吞吐量并保证用户最低门限速率为目标,将其建模为联盟博弈进行求解。由于传统的联盟博弈算法存在复杂度高、收敛速度慢等问题,提出建立优先级指导联盟初始化及形成过程,从而减少算法迭代次数,降低系统复杂度。最后,通过仿真验证了算法的可行性。

The rapid increase in the number of users in wireless networks has brought huge challenges to the existing network architecture,and how to increase the system capacity effectively is an urgent problem to be solved.Due to the superior performance in improving spectrum efficiency and increasing system capacity,Device-to-Device(D2D)communication and sparse code multiple access(SCMA)as the key technics in the development of 5G in the future have been extensively studied.Aiming at the communication resource allocation problem in the SCMA system in the single-cell scenario,this paper aims to maximize the system throughput and ensure the minimum threshold rate of all users,and model it as an alliance game to solve it.Due to the problems of high complexity and slow convergence in traditional alliance game algorithms,this paper proposes to establish a priority sequence to guide the initialization and formation process of alliances,thereby reducing the number of algorithm iterations and reducing system complexity.Finally,the feasibility of the algorithm is verified by simulation.