An Optimized Algorithm for Resource Allocation for D2D in Heterogeneous Networks
作者机构：Department of Electrical&Computer EngineeringUniversity of SharjahSharjahUnited Arab Emirates Department of Computer ScienceKing Khalid UniversityMuhayel AseerKSA Faculty of Computer and ITSana’a UniversitySanaaYemen Department of Information SystemsKing Khalid UniversityMayahel AseerKSA Department of Electrical EngineeringUniversity of Engineering and TechnologyPeshawarPaki
出 版 物：《Computers, Materials & Continua》 (计算机、材料和连续体（英文）)
年 卷 期：2022年第70卷第2期
页 面：2923-2936页
核心收录：
学科分类：0809[工学-电子科学与技术（可授工学、理学学位）] 08[工学]
基 金：This work is supported by Suranaree University for Technology research and development fund
主 题：5G device-to-device communication wireless networks spectrum
摘 要：With the emergence of 5G mobile multimedia services,end users’demand for high-speed,low-latency mobile communication network access is *** them,the device-to-device(D2D)communication is one of the considerable *** D2D communication,the data does not need to be relayed and forwarded by the base station,but under the control of the base station,a direct local link is allowed between two adjacent mobile *** flexible communicationmode reduces the processing bottlenecks and coverage blind spots of the base station,and can be widely used in dense user communication scenarios such as heterogeneous ultra-dense wireless *** of the important factors which affects the quality-of-service(QoS)of D2D communications is co-channel *** order to solve this problem of co-channel interference,this paper proposes a graph coloring based *** main idea is to utilize the weighted priority of spectrum resources and enables multiple D2D users to reuse the single cellular user *** proposed algorithm also provides simpler power *** heterogeneous pattern of interference is determined using different types of interferences and UE and the priority of color is *** results show that the proposed algorithm effectively reduced the co-channel interference,power consumption and improved the system throughput as compared with existing algorithms.
维普期刊数据库