scholarly journals A Novel Resource Allocation Scheme in NOMA-Based Cellular Network with D2D Communications

2020 ◽  
Vol 12 (1) ◽  
pp. 8 ◽  
Author(s):  
Jingpu Wang ◽  
Xin Song ◽  
Yatao Ma

Non-orthogonal multiple access (NOMA) has become a promising technology for 5G. With the support of effective resource allocation algorithms, it can improve the spectrum resource utilization and system throughput. In this article, a new resource allocation algorithm in the NOMA-enhanced cellular network with device-to-device (D2D) communications is proposed, in which we use two new searching methods and an optimal link selection scheme to maximize the system throughput and limit the interferences of the NOMA-based cellular network. In the proposed joint user scheduling, tree-based search power allocation and link selection algorithm, we simplify the solving process of previous methods and set up the optimization function, which does not need to be derivable. With successive interference cancellation (SIC) technology, we give conditions for the D2D devices accessing into the network. We also propose a suboptimal scheme to schedule cellular users and D2D devices into multiple subchannels, which reduces the complexity of the exhaustive search method. Through consistent tree-based searching for the power allocation coefficients, we can get the maximum arithmetic average of the system sum rate. Meanwhile, for the existence of the part of interferences from larger power users which can be canceled by the SIC in NOMA systems, the search options are decreased for increasing the search rate of the power allocation algorithm. Moreover, we propose a distance-aware link selection scheme to guarantee the quality of communications. In summary, the proposed algorithm can improve the system throughput, has a low complexity cost and potentially increases spectral utilization. Numerical results demonstrate that the proposed algorithm achieves a higher data transmission rate than some of the traditional methods and we also investigate the convergence and the computational complexity cost of the joint algorithm.

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.


Electronics ◽  
2019 ◽  
Vol 8 (11) ◽  
pp. 1360
Author(s):  
Gu ◽  
Zhu

Device-to-device (D2D) communication and non-orthogonal multiple access (NOMA) have been considered promising techniques to improve system throughput. In the NOMA-enhanced D2D scenario, a joint channel and power allocation algorithm based on the Stackelberg game is proposed in this paper. The social relationship between the cellular and D2D users is utilized to define their utility functions. In the two-stage Stackelberg game, the cellular user is the leader and the D2D group is the follower. Cellular users and D2D groups are matched via the Kuhn–Munkres (KM) algorithm to allocate channels for D2D groups in the first stage. The power allocation of D2D users is optimized through a penalty-function-based particle swarm optimization algorithm (PSO) in the second stage. The simulation results show that the proposed algorithm can effectively strengthen the cooperation between cellular and D2D users and improve their utility.


Non-Orthogonal Multiple Access (NOMA) scheme is one of the emerging radio access techniques to enhance the system performance for 5G networks. The powerdomain NOMA is one of the basic NOMA schemes that perform superposition coding (SC) at the transmitter and successive interference cancellation (SIC) at the receiver. Power Allocation (PA) plays a significant role in attaining successful SIC and high system throughput. This work is focusing on power allocation to maximize the throughput for NOMA-based 5G network. The objective functions, algorithms, constraints and limitations of the system design in power allocation techniques for NOMA-based 5G networks in terms of throughput analysis are extensively investigated and reported.


IEEE Access ◽  
2019 ◽  
Vol 7 ◽  
pp. 120238-120247 ◽  
Author(s):  
Salem Alemaishat ◽  
Omar A. Saraereh ◽  
Imran Khan ◽  
Bong Jun Choi

2013 ◽  
Vol 791-793 ◽  
pp. 1153-1159
Author(s):  
Li Ping Su ◽  
Dong Chen ◽  
Wei Hua Huang ◽  
Ning Li

This paper investigates the joint power allocation (PA) and relay selection scheme (RS) in two-way relaying cognitive radio networks consisting of multiple user-pairs and multiple relays. In order to reduce the computational complexity for practical scenario, we propose a branch and bound based (BnB-based) power allocation and relay selection scheme and a greedy power allocation and relay selection scheme to maximize the system throughput. The system is assumed under the constraint that the interference power from the secondary nodes in two way relay systems to primary user (PU) shall be less than a predefined interference threshold which can guarantee the normal communication of PU. Numerical simulation results show that the optimal PA and RS scheme has the highest system capacity, however, the greedy PA and RS scheme has the lowest complexity. The proposed BnB-based PA and RS scheme has the better tradeoff of system throughput and complexity than the above two schemes.


Sign in / Sign up

Export Citation Format

Share Document