4 research outputs found
Energy Efficiency Optimization for PSOAM Mode-Groups based MIMO-NOMA Systems
Plane spiral orbital angular momentum (PSOAM) mode-groups (MGs) and multiple-input multiple-output non-orthogonal multiple access (MIMO-NOMA) serve as two emerging techniques for achieving high spectral efficiency (SE) in the next-generation networks. In this paper, a PSOAM MGs based multi-user MIMO-NOMA system is studied, where the base station transmits data to users by utilizing the generated PSOAM beams. For such scenario, the interference between users in different PSOAM mode groups can be avoided, which leads to a significant performance enhancement. We aim to maximize the energy efficiency (EE) of the system subject to the constraints of the total transmission power and the minimum data rate. This designed optimization problem is non-convex owing to the interference among users, and hence is quite difficult to tackle directly. To solve this issue, we develop a dual layer resource allocation algorithm where the bisection method is exploited in the outer layer to obtain the optimal EE and a resource distributed iterative algorithm is exploited in the inner layer to optimize the transmit power. Besides, an alternative resource allocation algorithm with Deep Belief Networks (DBN) is proposed to cope with the requirement for low computational complexity. Simulation results verify the theoretical findings and demonstrate the proposed algorithms on the PSOAM MGs based MIMO-NOMA system can obtain a better performance comparing to the conventional MIMO-NOMA system in terms of EE
CARES: computation-aware scheduling in virtualized radio access networks
In a virtualized Radio Access Network (RAN), baseband processing is performed by software running in cloudcomputing platforms. However, current protocol stacks were not designed to run in this kind of environments: the high variability on the computational resources consumed by RAN functions may lead to eventual computational outages (where frames are not decoded on time), severely degrading the resulting performance. In this paper, we address this issue by re-designing two key functions of the protocol stack: (i) scheduling, to select the transmission of those frames that do not incur in computational outages, and (ii) modulation and coding scheme (MCS) selection, to downgrade the selected MCS in case no sufficient computational resources are available. We formulate the resulting problem as a joint optimization and compute the (asymptotically) optimal solution to this problem. We further show that this solution involves solving an NP-hard problem, and propose an algorithm to obtain an approximate solution that is computationally efficient while providing bounded performance over the optimal. We thoroughly evaluate the proposed approach via simulation, showing that it can provide savings as high as 80% of the computational resources while paying a small price in performance.The work of University Carlos III of Madrid was supported by the H2020 5G-MoNArch project (Grant Agreement No. 761445) and the work of NEC Europe Ltd. by the 5G-Transformer project (Grant Agreement No. 761536)
Graph-based Algorithm Unfolding for Energy-aware Power Allocation in Wireless Networks
We develop a novel graph-based trainable framework to maximize the weighted
sum energy efficiency (WSEE) for power allocation in wireless communication
networks. To address the non-convex nature of the problem, the proposed method
consists of modular structures inspired by a classical iterative suboptimal
approach and enhanced with learnable components. More precisely, we propose a
deep unfolding of the successive concave approximation (SCA) method. In our
unfolded SCA (USCA) framework, the originally preset parameters are now
learnable via graph convolutional neural networks (GCNs) that directly exploit
multi-user channel state information as the underlying graph adjacency matrix.
We show the permutation equivariance of the proposed architecture, which is a
desirable property for models applied to wireless network data. The USCA
framework is trained through a stochastic gradient descent approach using a
progressive training strategy. The unsupervised loss is carefully devised to
feature the monotonic property of the objective under maximum power
constraints. Comprehensive numerical results demonstrate its generalizability
across different network topologies of varying size, density, and channel
distribution. Thorough comparisons illustrate the improved performance and
robustness of USCA over state-of-the-art benchmarks.Comment: Published in IEEE Transactions on Wireless Communication