scholarly journals An Efficient Radio Access Resource Management Scheme Based on Priority Strategy in Dense mmWave Cellular Networks

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.

2020 ◽  
Author(s):  
Ping Li ◽  
Yu Liu ◽  
Xiang Gao ◽  
Huibo Li ◽  
Peng Gong

Abstract Energy efficiency and privacy preserving have become essential for the wireless sensor networks. In the previous work, an optimal power allocation algorithm was investigated for a non-selfish symbiotic cognitive relaying scheme (NSCRS) in the sensor network with coexistence of a primary user (PU) and cognitive users (CUs). However, the optimal strategy of energy and time resource allocation as well as the privacy preserving was not considered. In this paper, we further consider the joint energy and time resource allocation problem for the cognitive users in NSCRS to maximize the overall capacity of the primary user and cognitive users with the consideration of information privacy under the energy constraints of cognitive users. With full channel state information (CSI), i.e., PU s -PU d , PU s -CUs and CUs-PU d , an optimal energy and time resource allocation algorithm is proposed based on the exhaustive searching. In order to reduce the overhead of CSI feedback, a suboptimal algorithm, in which only the instantaneous CSI of PU s -PU d , the instantaneous CSI of PU s -CUs and an averaged CSI of CUs-PU d by long term observation rather than an instantaneous value of CSI of CUs-PU d are required, is additionally proposed. Simulation results demonstrate the energy efficiency of primary and cognitive users in the NSCRS with consideration of information privacy can be greatly improved by the proposed algorithms.


Author(s):  
Rezha Aulia Riyanda ◽  
Nachwan Mufti Adriansyah ◽  
Vinsensius Sigit Widhi Prabowo

Device to Device (D2D) is communication between two devices directly without the intervention of eNodeB.This communication can improve sum-rate, spectral efficiency, and decrease the workload of eNodeBbecause using the same spectrum frequency with Cellular User Equipment (CUE). But this communicationshould use the same resource simultaneously with CUE which is called D2D underlaying. This sharingresources also causes interference and should be managed using the resource allocation algorithm. In thiswork, the resource allocation is allocated in a single cell and uplink communication using joint greedyalgorithm with water filling power control scheme. This algorithm is compared with greedy, joint greedy,and greedy algorithm with water filling power control scheme. Joint greedy algorithm works based on thecapacity of eNodeB and D2D pair. While in water filling power control, the power of the user is managedbased on the channel condition and impact to energy efficiency. After all the resource is allocated, theparameter performance of the system is calculated, such as spectral efficiency, energy efficiency, and D2Dfairness. From the simulation result, joint greedy algorithm with water filling power control scheme result29,34 bps/Hz in spectral efficiency, 0.939 x 107 bps/watt in energy efficiency, and 0,996 in D2D fairness.


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.


Sign in / Sign up

Export Citation Format

Share Document