Computer Engineering and Applications ›› 2019, Vol. 55 ›› Issue (8): 86-91.DOI: 10.3778/j.issn.1002-8331.1801-0251

Previous Articles     Next Articles

Resource Allocation Scheme for D2D Communication Based on Fireworks Algorithm

LIU Hui1,2, YAN Biao1, ZHAO Ruixue1   

  1. 1.Research Center of New Telecommunication Technology Applications, Chongqing University of Posts and Telecommunications, Chongqing 400065, China
    2.Chongqing Information Technology Designing Co., Ltd., Chongqing 400012, China
  • Online:2019-04-15 Published:2019-04-15


刘  辉1,2,颜  飙1,赵瑞雪1   

  1. 1.重庆邮电大学 通信新技术应用研究中心,重庆 400065
    2.重庆信科设计有限公司,重庆 400012

Abstract: The Device-to-Device(D2D) communication can improve the utilization of spectrum resources and system throughput by reusing the resources of cellular users. However, it also brings severe co-channel interference to the system. In order to deal with the complex interference problem in the system and to improve the throughput of the system as much as possible under the condition that fairness of resource allocation, a resource allocation scheme based on fireworks algorithm is proposed. This paper aims for maximizing the weighted sum rate of the system, abstracts the resource allocation matrix into fireworks, and the final matching matrix is obtained by explosion, mutation and selection. Simulation results show that the proposed algorithm can effectively improve the throughput of the system and fairness of resource allocation.

Key words: Device-to-Device(D2D), resource allocation, fireworks algorithm, fairness, throughput

摘要: D2D(Device-to-Device)通信通过复用蜂窝用户的频谱资源来提升系统频谱资源的利用率,并提高系统吞吐量,但同时也为系统带来了严重的同频干扰。为了应对复杂的干扰问题,并在保证资源分配公平性的情况下尽可能提高系统吞吐量,提出一种基于烟花算法的D2D资源分配方案,以最大化系统的加权和速率为目标,将资源分配矩阵抽象为烟花,通过爆炸、变异、选择等过程求出最终的匹配矩阵。仿真结果表明,所提方案能够有效提高系统的吞吐量和资源分配的公平性。

关键词: D2D通信, 资源分配, 烟花算法, 公平性, 吞吐量