scholarly journals Resource allocation for ultra-reliable low latency communications in sparse code multiple access networks

Author(s):  
Qinwei He ◽  
Yulin Hu ◽  
Anke Schmeink
2021 ◽  
Vol 8 (3) ◽  
pp. 679-689
Author(s):  
Zhixin Liu ◽  
Changjian Liang ◽  
Yazhou Yuan ◽  
Kit Yan Chan ◽  
Xinping Guan

2021 ◽  
Vol 2021 ◽  
pp. 1-11
Author(s):  
Jingmin Zhang ◽  
Xiaokui Yue ◽  
Xuan Li ◽  
Haofei Zhang ◽  
Tao Ni ◽  
...  

This article focuses on the simultaneous wireless information and power transfer (SWIPT) systems, which provide both the power supply and the communications for Internet-of-Things (IoT) devices in the sixth-generation (6G) network. Due to the extremely stringent requirements on reliability, speed, and security in the 6G network, aerial access networks (AANs) are deployed to extend the coverage of wireless communications and guarantee robustness. Moreover, sparse code multiple access (SCMA) is implemented on the SWIPT system to further promote the spectrum efficiency. To improve the speed and security of SWIPT systems in 6G AANs, we have developed an optimization algorithm of SCMA to maximize the secrecy sum rate (SSR). Specifically, a power-splitting (PS) strategy is applied by each user to coordinate its energy harvesting and information decoding. Hence, the SSR maximization problems in the SCMA system are formulated in terms of the PS and resource allocation, under the constraints on the minimum rates and minimum harvested energy of individual users. Then, a successive convex approximation method is introduced to transform the nonconvex problems to the convex ones, which are then solved by an iterative algorithm. In addition, we investigate the SSR performance of the SCMA system supported by our optimization methods, when the impacts from different perspectives are considered. Our studies and simulation results show that the SCMA system supported by our proposed optimization algorithms significantly outperforms the legacy system with uniform power allocation and fixed PS.


Author(s):  
Bhanu Pratap Chaudhary ◽  
Ravi Shankar ◽  
Ritesh Kumar Mishra

In this paper, we explore the possibilities and advantages of cooperative relaying with the addition of non-orthogonal multiple access (NOMA). First, the possibilities of NOMA for fifth-generation (5G) and beyond networks is discussed followed by the generalized structures for the cooperative NOMA. Then, advanced NOMA communication is investigated where NOMA is integrated with advanced transmission technologies for the further improvement in cooperative NOMA. Hereinafter, resource allocation is investigated and, finally, the major challenges and issues are highlighted.


2021 ◽  
Author(s):  
Lilatul Ferdouse

This thesis focuses on resource management both in communication and computing sides of the cloud radio access networks (C-RANs). Communication and computing resources are bandwidth, power, baseband unit servers, and virtual machines, which become major resource allocation elements of C-RANs. If they are not properly handled, they create congestion and overload problems in radio access network and core network part of the backbone cellular network. We study two general problems of C-RAN networks, referred to as communication and computing resource allocation problem along with user association, base band unit (BBU) and remote radio heads (RRH) mapping problems in order to improve energy efficiency, sum data rate and to minimize delay performance of C-RAN networks. In this thesis, we propose, implement, and evaluate several solution strategies, namely posterior probability based user association and power allocation method, double-sided auction based distributed resource allocation method, the energy efficient joint workload scheduling and BBU allocation and iterative resource allocation method to deal with the resource management problems in both orthogonal and non-orthogonal multiple access supported C-RAN networks. In the posterior probability based user association and power allocation method, we apply Bayes theory to solve the multi-cell association problem in the coordinated multi-point supported C-RANs. We also use queueing and auction theory to solve the joint communication and computing resource optimization problem. As the joint optimization problem, we investigate the delay and sum data rate performance of C-RANs. To improve the energy efficiency of C-RANs, we employ Dinkelbach theorem and propose an iterative resource allocation method. Our proposed methods are evaluated via simulations by considering the effect of bandwidth utilization percentage, different scheduling weight, signal-to-interference ratio threshold value and number of users. The results show that the proposed methods can be successfully implemented for 5G C-RANs. Among the various non-orthogonal multiple access schemes, we consider and implement the sparse code multiple access (SCMA) scheme to jointly optimize the codebook and power allocation in the downlink of the C-RANs, where the utilization of sparse code multiple access in C-RANs to improve energy efficiency has not been investigated in detail in the literature. To solve the NP-hard joint optimization problem, we decompose the original problem into two subproblems: codebook allocation and power allocation. Using the graph theory, we propose the throughput aware sparse code multiple access based codebook selection method, which generates a stable codebook allocation solution within a finite number of steps. For the power allocation solution, we propose the iterative level-based power allocation method, which incorporates different power allocation approaches (e.g., weighted and successive interference cancellation ) into different levels to satisfy the maximum power requirement. Simulation results show that the sum data rate and energy efficiency performance of non-orthogonal multiple access supported C-RANs significantly increases with the number of users when the successive interference cancellation aware geometric water-filling based power allocation is used.


2021 ◽  
Author(s):  
Hemanth A V ◽  
Prajith Chandra K ◽  
Sai Bharadwaj K ◽  
Prasanthi V ◽  
Kirthiga S

Sign in / Sign up

Export Citation Format

Share Document