scholarly journals D2D Assisted Cellular Networks in Licensed and Unlicensed Spectrum: Matching-Iteration-Based Joint User Access and Resource Allocation

Algorithms ◽  
2021 ◽  
Vol 14 (3) ◽  
pp. 80
Author(s):  
Qiuqi Han ◽  
Guangyuan Zheng ◽  
Chen Xu

Device-to-Device (D2D) communications, which enable direct communication between nearby user devices over the licensed spectrum, have been considered a key technique to improve spectral efficiency and system throughput in cellular networks (CNs). However, the limited spectrum resources cannot be sufficient to support more cellular users (CUs) and D2D users to meet the growth of the traffic data in future wireless networks. Therefore, Long-Term Evolution-Unlicensed (LTE-U) and D2D-Unlicensed (D2D-U) technologies have been proposed to further enhance system capacity by extending the CUs and D2D users on the unlicensed spectrum for communications. In this paper, we consider an LTE network where the CUs and D2D users are allowed to share the unlicensed spectrum with Wi-Fi users. To maximize the sum rate of all users while guaranteeing each user’s quality of service (QoS), we jointly consider user access and resource allocation. To tackle the formulated problem, we propose a matching-iteration-based joint user access and resource allocation algorithm. Simulation results show that the proposed algorithm can significantly improve system throughput compared to the other benchmark algorithms.

Author(s):  
S. Gayathri ◽  
R. Sabitha

<span lang="EN-US">Long Term Evolution (LTE) is the technology used in modern third and fourth generation mobile wireless cellular networks. Due to the presence of large number of users, mobility and varying channel conditions, proper resource allocation is essential to provide a good user experience and improve the system throughput. In this paper, a resource allocation algorithm is implemented that will use the probabilistic models to predict the channel condition and allocate resources accordingly. Also, the algorithm will support QoS requirements. During the resource allocation, the channel quality information is collected and analyzed to predict the future channel conditions and resource allocation vectors are configured accordingly. The performance of the algorithm is analyzed based upon the data collected. The algorithm is able to provide a reasonable success rate for channel prediction. By using the resource allocation vectors and channel prediction, the algorithm performance also is improved considerably due to the lesser space and time complexity required.</span>


2015 ◽  
Vol 713-715 ◽  
pp. 1208-1215
Author(s):  
Shuai Hua Kou ◽  
Jun Sun ◽  
Shi Xiang Shao

In cellular networks, Device-to-Device (D2D) communications can improve spectral efficiency and increase overall throughput. However, D2D users may cause interference to the cellular users (CU) due to sharing resource with CUs. In this paper, we proposed a resource allocation scheme to maximize the system throughput while guaranteeing the quality-of-service (QoS) requirements of all communication links. The proposed scheme allows as many D2D pairs as possible to reuse resource and includes three steps. Firstly, an exhaustive search method is used to search out all the reuse combinations, in which all users share the same resource. Secondly, transmit power for each reuse combination is allocated. Lastly, a suboptimal but simple algorithm is proposed to select suitable reuse combinations in order to maximize the overall throughput. Simulation results show that the proposed scheme can significantly increase system throughput and D2D access rate.


PLoS ONE ◽  
2019 ◽  
Vol 14 (1) ◽  
pp. e0210310 ◽  
Author(s):  
Maharazu Mamman ◽  
Zurina Mohd Hanapi ◽  
Azizol Abdullah ◽  
Abdullah Muhammed

2019 ◽  
Vol 9 (7) ◽  
pp. 1391 ◽  
Author(s):  
Xiangwei Bai ◽  
Qing Li ◽  
Yanqun Tang

In this paper, a low-complexity multi-cell resource allocation algorithm with a near-optimal system throughput is proposed to resolve the conflict between the high system throughput and low complexity of indoor visible light communication ultra-dense networks (VLC-UDNs). First, by establishing the optimal model of the resource allocation problem in each cell, we concluded that the problem is a convex optimization problem. After this, the analytic formula of the normalized scaling factor of each terminal for resource allocation is derived after reasonable approximate treatment. The resource allocation algorithm is subsequently proposed. Finally, the complexity analysis shows that the proposed algorithm has polynomial complexity, which is lower than the classical optimal inter-point method. The simulation results show that the proposed method achieves a improvement of 57% in performance in terms of the average system throughput and improvement of 67% in performance in terms of the quality of service (QoS) guarantee against the required data rate proportion allocation (RDR-PA) method.


2019 ◽  
Vol 9 (18) ◽  
pp. 3816 ◽  
Author(s):  
Saraereh ◽  
Mohammed ◽  
Khan ◽  
Rabie ◽  
Affess

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.


2020 ◽  
Vol 2020 ◽  
pp. 1-19
Author(s):  
Jinsong Gui ◽  
Jianglin Liu

In millimeter wave (mmWave) communication systems, beamforming-enabled directional transmission and network densification are usually used to overcome severe signal path loss problem and improve signal coverage quality. The combination of directional transmission and network densification poses a challenge to radio access resource management. The existing work presented an effective solution for dense mmWave wireless local area networks (WLANs). However, this scheme cannot adapt to network expansion when it is applied directly to dense mmWave cellular networks. In addition, there is still room for improvement in terms of energy efficiency and throughput. Therefore, we firstly propose an efficient hierarchical beamforming training (BFT) mechanism to establish directional links, which allows all the small cell base stations (SBSs) to participate in the merging of training frames to adapt to network expansion. Then, we design a BFT information-aided radio access resource allocation algorithm to improve the downlink energy efficiency of the entire mmWave cellular network by reasonably selecting beam directions and optimizing transmission powers and beam widths. Simulation results show that the proposed hierarchical BFT mechanism has the smaller overhead of BFT than the existing BFT mechanism, and the proposed BFT information-aided radio access resource allocation algorithm outperforms the existing corresponding algorithm in terms of average energy efficiency and throughput per link.


Sign in / Sign up

Export Citation Format

Share Document