Distance-Based Fair Resource Allocation Algorithm for Device-to-Device Multicast Communication in SFN System

2015 ◽  
Vol E98.B (1) ◽  
pp. 252-259
Author(s):  
Wenrong GONG ◽  
Xiaoxiang WANG ◽  
Mingming LI ◽  
Zijia HUANG
Keyword(s):  
Resource Allocation ◽  
Multicast Communication ◽  
Resource Allocation Algorithm ◽  
Allocation Algorithm ◽  
Device To Device

scholarly journals An Efficient Resource Allocation Algorithm for Device-To-Device Communications

2019 ◽  
Vol 9 (18) ◽  
pp. 3816 ◽  
Author(s):  
Saraereh ◽  
Mohammed ◽  
Khan ◽  
Rabie ◽  
Affess
Keyword(s):  
Resource Allocation ◽  
Optimal Algorithm ◽  
Search Algorithm ◽  
Low Complexity ◽  
System Capacity ◽  
Total System ◽  
Resource Allocation Algorithm ◽  
Allocation Algorithm ◽  
Device To Device ◽  
Total Capacity

In order to solve the problem of interference and spectrum optimization caused by D2D (device-to-device) communication multiplexing uplink channel of heterogeneous cellular networks, the allocation algorithm based on the many-to-one Gale-Shapley (M21GS) algorithm proposed in this paper can effectively solve the resource allocation problem of D2D users multiplexed cellular user channels in heterogeneous cellular network environments. In order to improve the utilization of the wireless spectrum, the algorithm allows multiple D2D users to share the channel resources of one cellular user and maintains the communication service quality of the cellular users and D2D users by setting the signal to interference and noise ratio (SINR) threshold. A D2D user and channel preference list are established based on the implemented system’s capacity to maximize the system total capacity objective function. Finally, we use the Kuhn–Munkres (KM) algorithm to achieve the optimal matching between D2D clusters and cellular channel to maximize the total capacity of D2D users. The MATLAB simulation is used to compare and analyze the total system capacity of the proposed algorithm, the resource allocation algorithm based on the delay acceptance algorithm, the random resource allocation algorithm and the optimal exhaustive search algorithm, and the maximum allowable access for D2D users. The simulation results show that the proposed algorithm has fast convergence and low complexity, and the total capacity is close to the optimal algorithm.

Sign in / Sign up

Export Citation Format

Share Document