A two-stages relay selection and resource allocation joint method for d2d communication system

Author(s):  
Ming Zhao ◽  
Xinyu Gu ◽  
Di Wu ◽  
Luming Ren
2021 ◽  
Vol 19 ◽  
pp. 215-222
Author(s):  
Nusrat Jahan ◽  
Ashikur Rahman Khan ◽  
Main Uddin ◽  
Mahamudul Hasan Rana

A single bidirectional link is used to allow communication between two devices in the device-todevice (D2D) communication system. D2D technology has to implement with the current cellular system. As both users D2D and cellular use the same licensed spectrum for transmission the chances of interferences increases. It is challenging for researchers to find out the proper mechanism to decrease interference and maximize performances. In this paper, we try to survey the challenges and their solutions to enable D2D communication in the cellular network with low interference. Here we describe the peer discover, mode selection process and interference management with power control and resource allocation. Finally, we can say that with proper power control, spectrum slicing and resource allocation we can mitigate co-tier and cross-tier interferences.


Complexity ◽  
2021 ◽  
Vol 2021 ◽  
pp. 1-10
Author(s):  
Minxin Liang ◽  
Jiandong Liu ◽  
Jinrui Tang ◽  
Ruoli Tang

The optimal resource allocation in the large-scale intelligent device-to-device (D2D) communication system is of great importance for improving system spectrum efficiency and ensuring communication quality. In this study, the D2D resource allocation is modelled as an ultrahigh-dimensional optimization (UHDO) problem with thousands of binary dimensionalities. Then, for efficiently optimizing this UHDO problem, the coupling relationships among those dimensionalities are comprehensively analysed, and several efficient variable-grouping strategies are developed, i.e., cellular user grouping (CU-grouping), D2D pair grouping (DP-grouping), and random grouping (R-grouping). In addition, a novel evolutionary algorithm called the cooperatively coevolving particle swarm optimization with variable-grouping (VGCC-PSO) is developed, in which a novel mutation operation is introduced for ensuring fast satisfaction of constraints. Finally, the proposed UHDO-based allocation model and VGCC-PSO algorithm as well as the grouping and mutation strategies are verified by a comprehensive set of case studies. Simulation results show that the developed VGCC-PSO algorithm performs the best in optimizing the UHDO model with up to 6000 dimensionalities. According to our study, the proposed methodology can effectively overcome the “curse of dimensionality” and optimally allocate the resources with high accuracy and robustness.


2017 ◽  
Vol 22 (6) ◽  
pp. 1020-1032 ◽  
Author(s):  
Xinyu Gu ◽  
Ming Zhao ◽  
Luming Ren ◽  
Di Wu ◽  
Shiwen Nie

Author(s):  
Ping Deng ◽  
Wei Wu ◽  
Xinmeng Shen ◽  
Pei Li ◽  
Baoyun Wang

Sign in / Sign up

Export Citation Format

Share Document