Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2511.23326

Dynamic Power Allocation For NOMA-Based Transmission in 6G Optical Wireless Networks

Ahmad Adnan Qidan·Taisir El-Gorashi·Majid Safari·Harald Haas·Richard V. Penty·Ian H. White·Jaafar M. H. Elmirghani
View original source ↗Read source document ↗Export metadata ↓

Abstract

OWC has been considered as a key enabling technology to unlock unprecedented speeds of communication, supporting high demands of data traffic. In this paper, infrared lasers are used as optical transmitters operating in an indoor environment under eye safety regulations due to their high modulation speed. To provide efficient multiple access service, NOMA-based transmission is implemented to multiplex messages intended to multiple users in the power domain and maximize the spectral efficiency of our laser-based OWC network. In particular, a BIA outer precoder is designed to coordinate the transmission among multiple APs and determine the precoding matrices for groups of users potential formed according to NOMA principles. For effective use of NOMA, an optimization problem is formulated to maximize the sum rate of the network through forming optimum groups under certain joint conditions, efficient power allocation, high quality of service for each weak and strong users, and high overall system performance. Such optimization problems are defined as max-min fractional programs difficult to solve in practice. Therefore, a dynamic application for NOMA is introduced using two algorithms. First, a RF-aided dynamic algorithm is designed to form multiple groups, where users exchange binary variables among them through an RF system to establish distance-based weight edges, which are used as a metric for the grouping process. Second, a dynamic power allocation is proposed to determine the optimum power allocated to each group, while the users belonging to a certain group receive their traffic demands regardless of their classification as weak or strong. The results show the convergence of the proposed dynamic application to the optimum solution, and its high performance in terms of sum rate, fairness, and energy efficiency compared to counterpart schemes.

Explore related subjects

eess.SYcs.SY

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Ahmad Adnan Qidan, Taisir El-Gorashi, Majid Safari, Harald Haas, Richard V. Penty, Ian H. White, Jaafar M. H. Elmirghani. 2025-11-28. Dynamic Power Allocation For NOMA-Based Transmission in 6G Optical Wireless Networks. https://arxiv.org/abs/2511.23326

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Constrained Feedback Control of Nonlinear Systems via Approximate HJB and Control Barrier Functions

This paper presents a two-stage framework for constrained feedback control of input-affine nonlinear systems. Offline, an approximate value function for the unconstrained problem is computed, for example using Hamilton--Jacobi--Bellman (HJB)-based policy iteration. Online, the proposed quadratic program (QP) minimizes the pre-Hamiltonian evaluated using the approximate value-function gradient subject to safety constraints enforced by control barrier functions (CBFs). This architecture decouples performance optimization from constraint enforcement, allowing constraints to be modified without recomputing the value function. As in CBF-QP architectures based on control Lyapunov functions (CLFs), safety is enforced as a hard constraint; however, the performance objective targets approximate optimality rather than a prescribed Lyapunov decay. Numerical results on a linear 2-state hovercraft and a nonlinear 9-state spacecraft attitude-control problem show agreement with the constrained open-loop optimal control problem (OCP) benchmark in the linear case, and performance close to the OCP benchmark, improving on CLF-based controllers, in the nonlinear case.

eess.SY↗
arXiv2026

Rao-Blackwellized Stein Gradient Descent for Joint State-Parameter Estimation

We present a filtering framework for online joint state estimation and parameter identification in nonlinear, time-varying systems. The algorithm uses a Rao-Blackwellization technique to infer joint state-parameter posteriors efficiently. In particular, conditional state distributions are computed analytically via Kalman filtering, while model parameters, including the measurement-noise covariance, are approximated using particle-based Stein Variational Gradient Descent (SVGD), enabling stable real-time inference. To handle parameters subject to physical constraints, we further introduce constrained variants that enforce them through an alternating direction method of multipliers (ADMM) splitting of the SVGD update, including nonlinear equality constraints that standard particle filters cannot readily handle. We derive a stability bound that relates the approximation error in the parameter posterior to the resulting error in the marginal state distribution. Performance of the proposed filters is validated on three case studies: a fed-batch bioreactor with Haldane kinetics and a damped pendulum, both under physical constraints, and a neural-network-augmented dynamic system. The examples cover parameter estimation under inequality and equality constraints and online neural-network training within a dynamical model.

eess.SY↗
arXiv2026

Firing Rate Neural Network Implementations of Model Predictive Control

Human and animal brains perform planning to enable complex movements and behaviors, a process that can be effectively described using model predictive control (MPC). How could the brain physically implement MPC? In this work, we translate model predictive controllers into firing rate neural networks, offering insights into the nonlinear neural dynamics that underpin planning. We propose a constructive method; no training is required. This is done first applying the projected gradient method to the dual problem to derive a baseline neural network implementation. We then use factorization and contraction analysis to systematically generate alternative network architectures; in other words, we systematically generate hypotheses for how planning is done in the brain via neural dynamics. Finally, we present numerical simulations to study different neural networks performing MPC to balance an inverted pendulum on a cart (i.e., balancing a stick on a hand), including one example in which imposing sparse connectivity (a property observed in brain networks) does not degrade control performance.

eess.SY↗