Fractional Power Allocation Research Articles

Dynamic Scheduling and Power Allocation with Random Arrival Rates in Dense User-Centric Scalable Cell-Free MIMO Networks

In this paper, we address scheduling methods for queue stabilization and appropriate power allocation techniques in downlink dense user-centric scalable cell-free multiple-input multiple-output (CF-MIMO) networks. Scheduling is performed by the central processing unit (CPU) scheduler using Lyapunov optimization for queue stabilization. In this process, the drift-plus-penalty is utilized, and the control parameter V serves as the weighting factor for the penalty term. The control parameter V is fixed to achieve queue stabilization. We introduce the dynamic V method, which adaptively selects the control parameter V considering the current queue backlog, arrival rate, and effective rate. The dynamic V method allows flexible scheduling based on traffic conditions, demonstrating its advantages over fixed V scheduling methods. In cases where UEs scheduled with dynamic V exceed the number of antennas at the access point (AP), the semi-orthogonal user selection (SUS) algorithm is employed to reschedule UEs with favorable channel conditions and orthogonality. Dynamic V shows the best queue stabilization performance across all traffic conditions. It shows a 10% degraded throughput performance compared to V = 10,000. Max-min fairness (MMF), sum SE maximization, and fractional power allocation (FPA) are widely considered power allocation methods. However, the power allocation method proposed in this paper, combining FPA and queue-based FPA, achieves up to 60% better queue stabilization performance compared to MMF. It is suitable for systems requiring low latency.

Power Optimization Model for Energy Sustainability in 6G Wireless Networks

Internet-of-Things (IoT) networks are witnessing a rapid proliferation of connected devices and mobile terminals each day. The wireless information flow between these massive battery-powered devices has a huge energy burden and will lead to an energy crisis in the near future; thus, there is an urgent search for sustainable energy networks. To offer a sustainable energy solution in order to meet the energy demands of these massive IoT networks, this paper presents a dynamic practical model that enables the efficient management of power resources. Two user-scheduling algorithms, namely, minimum distance scheduling (MDS) and maximum channel gain scheduling (MCS), are proposed; when these algorithms were used alongside a power optimization, they led to improved network efficiency. Further, the network’s performance was measured with parametric variations in the number of access points (APs); the deployment of APs and AP configuration is carried out for different precoding schemes. The impact of spatial correlation and the access to perfect channel state information (CSI) on the spectral efficiency of the system was also evaluated. In the end, the study compares the performance of different power-allocation methods and suggests that the power allocated to a particular user node by an AP can be controlled using the proposed algorithms. It is observed that, as compared to the MDS algorithm, the MCS algorithm results in better spectral efficiency for all the users with fractional power allocation. In addition, each AP assigns a maximum power of 141.7 mW to a user with strong channel conditions with the AP, and a minimum power of 3.1882 mW to the user with the worst channel conditions using centralized PMMSE precoding.

Decode and forward relaying for energy‐efficient multiuser cooperative cognitive radio network with outage constraints

We investigate the optimal allocation of power in the downlink cooperative cognitive radio network using decode and forward (DF) relaying technique. The power allocation in DF relaying for green cooperative cognitive radio with an objective of maximising energy-efficiency is a constraint non-linear non-convex fractional programming problem. The optimisation needs to satisfy the primary users interference constraints and secondary users outage constraints. The authors present the optimal power allocation in DF relaying by transforming the constraint non-linear non-convex fractional power allocation problem into a concave fractional programme by using Charnes–Cooper transformation. The authors also present an iterative algorithm that uses parametric transformation and guarantees e-optimal convergence. The convergence of the iterative algorithm is proved and numerical results obtained for cooperative cognitive radio network are presented with different network parameter settings.