Power Allocation Problem Research Articles

Joint power allocation and user assignment for licensed/unlicensed band users in massive MIMO cellular systems

In this paper, we study the joint user assignment and power allocation for the defined utility function (central cell throughput) maximization in massive Multiple Input-Multiple Output (MIMO) cellular system coexistence with Wireless Fidelity (WiFi) network. Firstly, the power allocation of problem is formulated as a convex optimization. Unfortunately, the formulated problem has not a closed-form solution. For solving the mentioned problem, it is converted to three sub-problem based on the number of lemmas that are expressed. Due to two of these problems remain difficult to solve, this two sub-problem are relaxed. The Ellipsoid algorithm is an iterative algorithm that used for solving of the relaxed problems. In the following, joint user assignment and power allocation will be addressed, in which two approaches are proposed for solving. In the first approach, we propose an iterative algorithm that user assignment problem and power allocation problem are solved in each iteration. In the second approach, at first, users are assigned to licensed and unlicensed bands, then for the obtained arrangement, the power allocation problem is solved. The simulation results showed that the proposed algorithms are significantly close to the benchmark methods.

Energy-Efficient Interference-Aware Cognitive Machine-to-Machine Communications Underlaying Cellular Networks

Machine-to-machine (M2M) communications can effectively utilize cognitive radio (CR) to coexist with cellular users in what is known as cognitive M2M (CM2M) communications. In this system, underlay CR is used to manage spectrum sharing among machine type communication devices (MTCDs) and cellular user equipment (CUE) where the CUE are considered to be primary users (PUs) and the MTCDs are secondary users (SUs). Moreover, due to the limited battery capacity of MTCDs and diverse quality-of-service (QoS) requirements of both MTCDs and CUE, energy efficiency (EE) is critical to prolonging network lifetime. This paper investigates the power allocation problem for energy-efficient CM2M communications underlaying cellular networks. Underlay CR is employed to manage the coexistence of MTCDs and CUE and exploit spatial spectrum opportunities to improve spectrum utilization. Two power allocation problems are proposed where the first targets MTCD power consumption minimization while the second considers MTCD EE maximization subject to MTCD transmit power constraints, MTCD minimum data rate requirements, and CUE interference limits. The proposed power consumption minimization problem is transformed into a geometric programming (GP) problem and solved iteratively. The proposed EE maximization problem is a nonconvex fractional programming problem. Hence, a parametric transformation is used to convert it into an equivalent convex form and this is solved using an iterative approach. Simulation results are presented which show that the proposed algorithms provide MTCD power allocation with lower power consumption and higher EE than the equal power allocation (EPA) scheme while satisfying the constraints.

Optimal downlink power allocation schemes for OFDM-NOMA-based Internet of things

With the continuous development of fifth-generation technology, the number of mobile terminal Internet of Things devices has increased exponentially. How to effectively improve the throughput of fifth-generation systems has become a challenge. In the Internet of Things networks, ultra-dense networks and non-orthogonal multiple access technology have drawn extensive attention in recent years, because they can achieve multiplexing from the space domain and power domain. To improve the throughput of the system, this article combines non-orthogonal multiple access with ultra-dense networks technology and considers the orthogonal frequency division multiplexing non-orthogonal multiple access–based ultra-dense networks with multiple base stations and multiple Internet of Things devices. In particular, first, we build the network model and channel model. Second, we construct the downlink transmission rate maximizing problem subject to the total power. Then, to solve this problem, we divide it into three sub-problems: device grouping, inter-sub-band power allocation, and intra-sub-band power allocation problems. Solving these sub-problems, we obtain the optimal power allocation schemes by jointly employing channel-state sorting–pairing algorithm, water-filling algorithm, and convex optimization theory. Finally, numerical simulations are conducted to validate the performance of our proposed optimal downlink power allocation scheme. Experimental results show that the total throughput of the system has been significantly improved.

Achievable Rate Analysis and Max-Min SINR Optimization in Intelligent Reflecting Surface Assisted Cell-Free MIMO Uplink

In this paper, we study the uplink transmission in an intelligent reflecting surface (IRS) assisted cell-free multiple-input multiple-output (MIMO) system where the central processing unit (CPU) only has statistical channel state information (CSI) to detect symbols, and to design the receiver filter coefficients, the power allocations, and the IRS phase shifts. The access points (APs) estimate only their local end-to-end channels with the users using minimum mean squared error (MMSE) estimation to implement matched filtering, thereby avoiding the large overhead associated with estimating individual IRS-assisted channels. Under this framework, we derive a closed-form expression for the achievable uplink net rate that only depends on the channel statistics. Using this expression, we formulate the problem of maximizing the minimum (max-min) signal-to-interference plus noise ratio (SINR) to design the receiver filter coefficients at the CPU, the power allocations at the users, and the phase shifts at the IRS, subject to per user power constraints as well as IRS phase shift resolution constraints. The resulting problem is jointly non-convex in the three design variables and is solved using an alternating optimization algorithm. In particular, the receiver filter design is formulated as a generalized eigenvalue problem leading to a closed-form solution, the power allocation problem is solved using a geometric programming (GP) approach, and the IRS phase shifts are designed using an alternating maximization algorithm. For comparison, we also formulate and solve the max-min SINR problem for the scenario where the instantaneous imperfect CSI of all individual direct and IRS-assisted channels is available at the CPU. Numerical results show that the scheme designed using statistical CSI has the potential to outperform the scheme based on instantaneous CSI for moderate to large number of IRS elements, due to savings in the channel estimation overhead.

Incentive Mechanism and Resource Allocation for Edge-Fog Networks Driven by Multi-Dimensional Contract and Game Theories

The edge computing paradigm has become extremely popular over the past years, as a means of offloading computationally intensive tasks by users of resource and battery-constrained devices. Nevertheless, the edge networks’ overexploitation by the ever-increasing number of task-offloading users, gradually leads to their performance degradation. In this paper, we leverage on the different levels of available computing capabilities across the network, and we design an incentive mechanism that aims to shift the selfish users’ preference from the edge to the upper fog computing layer, accounting for their level of delay tolerance. To deal with the users’ heterogeneity in terms of their applications’ multi-dimensional distinctive features (including their delay tolerance/sensitivity), a multi-dimensional contract theory modeling is adopted, according to which the edge server determines the bundles of the users’ provided efforts and corresponding offered rewards. In this respect, each user’s effort represents the amount of its initially offloaded task at the edge that is allowed to be further forwarded and processed at the fog. Considering that the users-to-edge server offloading is performed under Non-Orthogonal Multiple Access (NOMA), the problem of joint computation task offloading and uplink transmission power allocation is subsequently addressed via a Stackelberg game, where the edge server and the users are treated as leader and followers, respectively. The aim of the game is to minimize the end-to-end network’s energy consumption and increase its resource utilization efficiency. The incentive mechanism and resource allocation framework is evaluated via modeling and simulation regarding its operation and efficiency under different scenarios.

Decoupling Energy Efficient Approach for Hybrid Precoding-Based mmWave Massive MIMO-NOMA With SWIPT

In this paper, we address the problem of energy consumption associated with mixed signal components such as analog-to-digital components in millimeter-wave (mmWave) massive MIMO systems. We employ non-orthogonal multiple access (NOMA) in millimeter-wave (mmWave) massive MIMO systems to further enhance the spectrum efficiency. The simultaneous wireless information and power transmission technology (SWIPT) will be used in mmWave massive Multiple-Input multiple-Output MIMO systems. The utilization of SWIPT contributes to prolonging the battery life of mobile users (MUs) and enhances the system energy efficiency (EE), especially in the NOMA scenario where the inter-user interference can be reused for energy harvesting (EH). However, we initially designed a user grouping algorithm based on the affinity propagation clustering algorithm, which preferentially groups the user equipment (UE) based on their channel correlation and distance. Then, we design the analog RF precoder based on the selected user grouping for all beams, followed by a low-dimensional digital baseband precoder design to further mitigate inter-beam interference and maximize the achievable sum-rate for the considered system. Subsequently, we transform the original optimization problem into a joint power allocation and power-splitting maximization problem. The considered non-convex optimization problem is arduous to tackle, resulting from the presence of coupled variables and inter-user interference. To cope with this problem, a decoupled approach is adopted, in which the power allocation and power splitting are separated, and the corresponding sub-problems are solved using the Lagrangian duality method. Simulation results confirm the effectiveness of the proposed method and demonstrate that the proposed method is near-optimal and enjoys higher spectrum and energy efficiency compared with state-of-the-art designs and the conventional SWIPT-enabled mmWave MIMO-NOMA system.

A Two-Stage Approach of Joint Route Planning and Resource Allocation for Multiple UAVs in Unmanned Logistics Distribution

Unmanned aerial vehicles (UAVs) can serve as means of delivery to enhance the effectiveness and accuracy of logistics distribution in various scenarios, such as emergency items delivery for disaster areas and logistics services for remote areas. This paper focuses on the problem of route planning for UAVs, which is the basis for UAVs to complete distribution tasks. Besides, to enhance the collaboration of UAVs during the delivery mission, this work also studies wireless resource (spectrum, power) allocation problem for multiple UAVs enabled communication networks. Due to the non-convex and combinatorial characteristics, it is challenging to obtain an optimal strategy for joint route planning and resource allocation issues within a finite time. To this end, the paths of UAVs are planned by the simulated annealing (SA) method in the first stage. Based on the preplanned paths, a double deep Q network (DDQN) based resource allocation method is proposed to maximize the average sum capacity of UAV-to-UAV (U2U) links and reduce transmission delay while minimizing the interference to UAV-to-infrastructure (U2I) links. Multi-UAV communication networks are reconnected according to the positions of UAVs changing in each time slot. Then each U2U link acting as an agent learns to improve spectrum and power allocation policy with imperfect knowledge of the environment. Simulation results demonstrate that the proposed DDQN-based resource management scheme can achieve higher system communication capacity than a random scheme. Moreover, the successful transmission probability of U2U links obtained by the DDQN-based method is much higher than a Particle Swarm Optimization (PSO) based method.

Energy-Efficient Deep Reinforcement Learning Assisted Resource Allocation for 5G-RAN Slicing

One of the pillars of the 5G architecture is network slicing, in which hardware, radio, and power resources are virtualized as a logical network taking into account the requirements of diverse applications. While ensuring performance isolation among different slices, resource allocation in 5G Radio Access Networks (RANs) is associated with different challenges due to network dynamics and the different applications’ requirements. In this paper, we have considered the allocation of power and radio resources to rate-based as well as resource-based users. We propose an energy-efficient deep reinforcement learning-assisted resource allocation (EE-DRL-RA) method for RAN slicing in 5G networks. The main idea of the proposed method is to exploit a collaborative learning framework that includes deep reinforcement learning (DRL) and deep learning (DL) to decide on resource allocation in the RAN. Specifically, we use DL for decision-making on resource allocation on a large time-scale and DRL for decision-making on resource allocation on a small time-scale. The asynchronous advantage actor-critic (A3C) and the stacked and bidirectional long-short-term-memory (SBiLSTM) network are used as DRL and supervised DL methods, respectively. Furthermore, we determine the optimal power and resource blocks (RBs) for rate-based users by formulating the energy-efficient power allocation (EE-PA) problem as a non-convex optimization problem and solve it by an efficient iterative algorithm. Our proposed approach is unique in that it simultaneously allocates power and RBs while ensuring slice isolation with low computational and time complexity. Simulation results show that EE-DRL-RA yields better performance compared to a state-of-the-art published method in terms of convergence speed, computational complexity, energy efficiency, and the number of accepted users as well as the degree of inter-slice isolation.

Secure Multiantenna Transmission With an Unknown Eavesdropper: Power Allocation and Secrecy Outage Analysis

This paper investigates the power allocation problem for secure multiple-input single-output transmission with the injection of artificial noise (AN), in the presence of an unknown eavesdropper (Eve). Two power allocation schemes, the optimal adaptive power allocation (OAPA) and suboptimal fixed power allocation (SFPA) schemes, are proposed to enhance the physical layer security of the considered system. Since the noise power at Eve is unknown, both power allocation schemes are designed for the worst-case scenario in which the noise power at Eve is assumed to be zero, aiming to minimize the secrecy outage probability (SOP). To characterize the performance of the proposed power allocation schemes, approximate closed-form expressions for average SOP under a preset noise power level are derived by applying Gauss-Chebyshev quadrature. We also address the worst-case secrecy outage performance for the proposed OAPA and SFPA schemes. Our analytical and numerical results show that, compared with the exhaustive search method that requires Eve’s prior information, the proposed OAPA scheme exhibits comparable secrecy outage performance without Eve’s prior information. Additionally, the SFPA scheme, also without Eve’s prior information, is capable of achieving almost the same worst-case SOP as the OAPA scheme, with a much lower implementation complexity.

Energy Efficient Uplink Transmission in Cooperative mmWave NOMA Networks With Wireless Power Transfer

In 5G wireless networks, cooperative non-orthogonal multiple access (NOMA) and wireless power transfer (WPT) are efficient ways to improve the spectral efficiency (SE) and energy efficiency (EE). In this paper, a new cooperative NOMA scheme with WPT is proposed, where EE optimization with a constrained maximum transmit power and minimum required SE is considered for the user grouping and transmit power allocation of users. We obtain a sub-optimal solution by decoupling the original problem in two sub-problems: an iterative algorithm is considered for the user grouping, while, in addition, we utilize the Bat Algorithm (BA) for solving the power allocation problem, where BA was proved to be able to achieve a higher accuracy and efficiency with respect to other meta-heuristic algorithms. Furthermore, to validate the performance of the proposed system, analytical expressions for the energy outage probability and outage probability of users are derived, confirming the effectiveness of the simulation results. It is demonstrated that the proposed cooperative NOMA with WPT offers a considerable improvement in terms of SE and EE of the network compared to other methods. Finally, the effectiveness of BA in solving the EE optimization problem is demonstrated through a high convergence speed by comparing it with other methods.

Reliability analysis and ABC based optimization for CoMP-enabled systems over Nakagami-[formula omitted] fading

Providing reliable communications has become one of the major goals for machine-type-oriented applications. In this article, reliable analysis and joint optimization over Nakagami-m fading are investigated for coordinated multi-point (CoMP) assisted multi-cell systems. First, the reliability analysis model for user equipment (UE) served by multiple base stations (BSs) via CoMP technique over Nakagami-m fading is presented. The exact closed-form expression for reliability estimation based on the received signal-to-interference-plus-noise ratio (SINR) value over Nakagami-m fading is derived and verified. Then, the joint sub-carrier assignment and power allocation problem for reliability optimization is formulated. The formulated problem is proved to be NP-hard. Bio-inspired artificial bee colony algorithm (ABC) is thus invoked to tackle this problem, and three ABC based joint optimization frameworks, namely Two-Step ABC Optimization algorithm (TSABC), ABC Combinatorial Optimization algorithm (ABCCO), and Heuristic Two-Step Optimization algorithm (HTSO), are proposed. Simulation results show that the UE reliability can be significantly enhanced by these proposed frameworks. It is also showcased that the proposed ABCCO obtains optimized reliability of 16 nines within 700 generations for most scenarios, which outperforms TSABC, HTSO, and conventional genetic algorithm (GA).

SQP-based Power Allocation Strategy for Target Tracking in MIMO Radar Network with Widely Separated Antennas

MIMO radar with widely separated antennas enhances detection and estimation resolution by utilizing the diversity of the propagation path. Each antenna of this type of radar can steer its beam independently towards any direction as an independent transmitter. However, the joint processing of signals for transmission and reception differs this radar from the multistatic radar. There are many resource optimization problems which improve the performance of MIMO radar. But power allocation is one of the most interesting resource optimization problems. The power allocation finds an optimum strategy to assign power to transmit antennas with the aim of minimizing the target tracking errors under specified transmit power constraints. In this study, the performance of power allocation for target tracking in MIMO radar with widely separated antennas is investigated. Therefore, a MIMO radar with distributed antennas is configured and a target motion model using the constant velocity (CV) method is modeled. Then Joint Cramer Rao bound (CRB) for target parameters (joint target position and velocity) estimation error is calculated. This is utilized as a power allocation problem objective function. Since the proposed power allocation problem is nonconvex. Therefore, a SQP-based power allocation algorithm is proposed to solve it. In simulation results, the performance of the proposed algorithm in various conditions such as a different number of antennas and antenna geometry configurations is examined. Results affirm the accuracy of the proposed algorithm.

An effective PSO-based power allocation for target tracking in MIMO radar with widely separated antennas

In MIMO radar with widely separated antennas, the antennas are spaced far from each other and the target is seen from different angles. In this type of radars, each receiver collects all transmit signals and transmits them to the central processor unit. Power allocation is an important part of military operations. Therefore, it is a primary factor that requires to be taken into account in the designing of target tracking problems in MIMO radar. In fact, the power allocation finds an optimum strategy to allot power to transmit antennas with the goal of minimizing the target tracking errors under specified transmit power constraints. In this paper, the performance of power allocation for target tracking in MIMO radar with widely separated antennas is investigated. For this purpose, first, a MIMO radar with distributed antennas is configured and a target motion model using the constant velocity (CV) method is modeled. Then Joint Cramer Rao bound (CRB) for target parameters (joint target position and velocity) estimation error is computed. This is applied as a power allocation problem objective function. Because a complex Gaussian model is considered for target radar cross-section (RCS), this function becomes complicated. Due to the nonlinearity of this objective function, the proposed power allocation problem is nonconvex. Therefore, a particle swarm optimization (PSO) -based power allocation algorithm is proposed to solve it. In simulation experiments, the performance of the proposed algorithm in different conditions such as a different number of antennas and antenna geometry configurations is evaluated. Results prove the validity of the proposed algorithm.

Games in Normal and Satisfaction Form for Efficient Transmission Power Allocation Under Dual 5G Wireless Multiple Access Paradigm

In this paper, to exploit the challenges and potential offered by the simultaneous use of non-orthogonal multiple access (NOMA) and orthogonal frequency division multiple access (OFDMA) transmission options in future 5G wireless systems, we aim at the proper modeling and transformation of the uplink power allocation problem. In particular, in this setting, each user has two degrees of freedom in the decision making process, namely its overall transmission power level, and the corresponding power investment to the OFDMA and/or NOMA based transmissions. The resulting multi-variable power allocation problem is treated and solved under three different perspectives, namely: 1) Games in Normal Form and Nash Equilibrium (NE); 2) Optimization techniques targeting system social welfare through a centralized optimal solution; and 3) Games in Satisfaction Form and Efficient Satisfaction Equilibrium (ESE). Based on these approaches, different solutions and stable operation points are identified and their properties are analyzed. An in depth evaluation and comparison of the various obtained outcomes is achieved, via modeling and simulations. The focus is placed on the impact and the interplay of the NOMA specific features, including the potential over-exploitation of the available bandwidth, the fairness in accessing it, and the interference treatment. It is also shown that, using the satisfaction form games for the users to converge to the ESE, provides an efficient and promising user-centric modeling approach to the power allocation problem, as the system adapts to the users’ application needs, while at the same time eliminates a significant amount of interference.

Reconfigurable Intelligent Surfaces Aided mmWave NOMA: Joint Power Allocation, Phase Shifts, and Hybrid Beamforming Optimization

In this paper, a reconfigurable intelligent surface (RIS)-aided millimeter wave (mmWave) non-orthogonal multiple access (NOMA) system is analyzed. In particular, we consider an RIS-aided mmWave-NOMA downlink system with a hybrid beamforming structure. To maximize the achievable sum-rate under a minimum rate constraint for the users and a maximum transmit power constraint, a joint RIS phase shifts, hybrid beamforming, and power allocation problem is formulated. To solve this non-convex optimization problem, we develop an alternating optimization (AO) algorithm. Specifically, first, the non-convex problem is transformed into three subproblems, i.e., power allocation, joint phase shifts and analog beamforming optimization, and digital beamforming design. Then, we solve the power allocation problem by keeping fixed the phase shifts of the RIS and the hybrid beamforming. Finally, given the power allocation matrix, an alternating manifold optimization (AMO)-based method and a successive convex approximation (SCA)-based method are utilized to design the phase shifts, analog beamforming, and transmit beamforming, respectively. Numerical results reveal that the proposed AO algorithm outperforms existing schemes in terms of sum-rate. Moreover, compared to a conventional mmWave-NOMA system without RIS, the proposed RIS-aided mmWave-NOMA system is capable of improving the achievable sum-rate.

Multi-server federated edge learning for low power consumption wireless resource allocation based on user QoE

Federated edge learning (FEL) deploys a machine learning algorithm by using devices distributed on the edge of a network, trains massive local data, uploads the local model to update the parameters after training, and performs alternate updating with global model parameters to reduce the pressure for uplink data transmission, prevent systematic time delay and ensure data security. This paper proposes that an optimal balance between time delay and energy consumption be achieved by optimizing the transmission power and bandwidth allocation based on user quality of experience (QoE) in a multi-server intelligent edge network. Given the limited computing capability of devices involved in FEL local training, the transmission power is modeled as a quasi-convex uplink power allocation (UPA) problem, and a lower energy consumption bandwidth allocation algorithm is proposed for solution-seeking. The proposed algorithm allocates appropriate power to the device by adapting the computing power and channel state of the device, thereby reducing energy consumption. As the theoretical deduction result suggests that additional bandwidth should be allocated to those devices with weak computing capabilities and poor channel conditions to realize minimal energy consumption within the restraint time. The simulation result indicates that, the maximum gain of the proposed algorithm can be optimized by 31% compared with the baseline.

Power-Spectrum Trading for Full-Duplex D2D Communications in Cellular Networks

Device-to-device (D2D) communications allows two adjacent mobile terminals transmit signal directly without going through base stations, which has been considered as one of the key technologies for future mobile networks. As full-duplex (FD) communications can improve the performance (i.e., throughput, energy efficiency (EE)) of communications systems, it is commonly used in practical D2D communications scenarios. However, FD-enabled D2D communications also results in self-interference. To fully realize the potential benefits of FD-enabled D2D communications, an effective resource allocation mechanism is critical to avoid not only the self-interference of FD-enabled D2D communications but also the interference between D2D users (DUs) and cellular users (CUs). In this paper, we investigate the resource allocation issue for FD-enabled DUs and traditional CUs. Considering the asymmetry of energy and spectrum resources of DUs and CUs, we propose a power-spectrum trading mechanism to achieve mutual benefits for both types of users. A concave-convex procedure algorithm is employed to solve the optimization problem of power allocation, and then a maximum weighted bipartite matching based method is proposed to select proper D2D pairs to maximize the overall system throughput. Numerical results show that the proposed scheme can remarkably improve the overall throughput and EE of FD-enabled D2D communications system.

A Game Theoretic Approach to Channel Switching in the Presence of Jamming

In this letter, a channel switching problem is investigated in the presence of jamming based on a game theoretic approach. First, a convex formulation of the optimal channel switching problem is proposed for a given jamming strategy. Then, considering a fixed channel switching strategy, an explicit solution of the optimal jammer power allocation problem is obtained. Consequently, a game theoretic formulation is proposed and the existence of a pure-strategy Nash equilibrium is shown for the proposed channel switching game between the transmitter and the jammer.

Joint optimization scheme for intelligent reflecting surface aided multi‐relay networks

The latest research on hybrid networks of decode-and-forward (DF) relay and intelligent reflecting surface (IRS) is limited to just a single relay. To harvest multiple relay gains, this paper proposes a hybrid communication networks that combines multiple DF relays with an IRS. The authors formulate and address the joint optimization problem to maximize the end-to-end transmission rate by jointly optimizing the reflect beam forming, the best relay selection and the power allocation, subject to total transmit power constraint. Moreover, to better exploit the degrees of freedom, it is proposed that the source also transmits signals in the second time slot. While the optimization problem is difficult to solve, the authors propose some efficient approaches to make the problem tractable. First, power allocation problem is simplified by applying Cauchy-Schwarz inequality and introducing equivalent channel gain, second, non-convex rank-one constraint is overcome by utilizing semidefinite relaxation (SDR) approach, then the slacked non-convex constraint is overcome by applying first-order Taylor expansion approximation. The simulation results demonstrate that our proposed joint optimization scheme for hybrid networks of multiple DF relays with an IRS has significant performance improvement over the other optimization schemes, such as the optimization scheme for hybrid networks of single DF relay and an IRS.

Power adaptation for vector parameter estimation according to Fisher information based optimality criteria

The optimal power adaptation problem is investigated for vector parameter estimation according to various Fisher information based optimality criteria. By considering an observation model that involves a linear transformation of the parameter vector and an additive noise component with an arbitrary probability distribution, six different optimal power allocation problems are formulated based on Fisher information based objective functions. Via optimization theoretic approaches, various closed-form solutions are derived for the proposed problems. Also, the results are extended to cases in which nuisance parameters exist in the system model or certain types of nonlinear transformations are applied on the parameter vector. Numerical examples are presented to investigate performance of the proposed power allocation strategies.