Search arXivSearch

arXiv · 2202.06127

Multicasting in NOMA-Based UAV Networks: Path Design and Throughput Maximization

Abstract

In this paper, we propose a new resource allocation framework for unmanned aerial vehicle (UAV) assisted multicast wireless networks in which the network users according to their request are divided into several multicast groups. We adopt power domain non-orthogonal multiple access (PD-NOMA) as the transmission technology using which the dedicated signals of multicast groups are superimposed and transmitted simultaneously as the UAV passes over the communication area for fixed and mobile users. We discuss the proposed scenarios from two perspectives, offline and online mode. In offline mode, we implement the problem for fixed and mobile users whose locations are predictable (the location of users, over the communication time, is known at the beginning of the communication time) and in online mode for mobile users whose locations are unpredictable (the location of users, over the communication time, is unknown at the beginning of the communication time). Also, we proposed a scenario in which the online model the number of mobile users can grow in each time slot. We formulate the problem of joint power allocation and UAV trajectory design as an optimization problem that is non-linear and nonconvex for two proposed scenarios. To solve the problem, we adopt an alternate search method (ASM), successive convex approximation (SCA), and geometric programming (GP). Using simulation results, the performance of the proposed scheme is evaluated for different values of the network parameters.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Shima Salarhosseini, Mohammad Reza Javan, Ali Nazari. 2022-02-12. Multicasting in NOMA-Based UAV Networks: Path Design and Throughput Maximization. https://arxiv.org/abs/2202.06127

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

KEEP EXPLORING

Related papers

Ensuring Stability of Non-Minimal Modes in Input-Output Data-Driven Representation

Many recent data-driven control approaches for linear time-invariant systems are based on output trajectory prediction using input-output data matrices. The system dynamics described by this predictor, which we refer to as the input-output data-driven representation, yields non-unique autoregressive with exogenous inputs (ARX) models having possibly unstable non-minimal modes. In this note, we show that the stability of these non-minimal modes is ensured by a certain choice of ARX model, which coincides with the minimum-norm least-squares predictor using the Moore-Penrose inverse of the data matrix. This stability guarantee holds regardless of the underlying system's stability. Moreover, the stability persists under sufficiently small noise in data when a suitably truncated Moore-Penrose inverse is used. Consequently, the ARX model need not be reduced to the true system order in order to avoid unstable additional modes.

eess.SY

Optimization-Based Formation Flight on Libration Point Orbits

A model predictive control (MPC) framework is developed for station-keeping in spacecraft formation flight along libration point orbits. At each control period, the MPC policy solves a multi-vehicle optimal control problem (MVOCP) that tracks a reference trajectory, while enforcing path constraints on the relative motion of the formation. The control policy makes use of a limited set of control nodes consistent with operational constraints that allow only a small number of maneuver opportunities per revolution. To promote recursive feasibility, path constraints are progressively tightened across the prediction horizon. An isoperimetric reformulation of the constraints is used to prevent inter-sample violations. The resulting MVOCP is a nonconvex program, which is solved via sequential convex programming. The proposed approach is evaluated in a high-fidelity ephemeris model under uncertainties for a formation along the near-rectilinear halo orbit (NRHO), and subject to path constraints on inter-spacecraft separation and relative Sun phase angle. The results demonstrate maintenance of a spacecraft formation that satisfies the path constraints with realistic cumulative propellant consumption.

eess.SY

Certificates Synthesis for A Class of Observational Properties in Stochastic Systems: A Unified Approach

In this paper, we investigate the probabilistic formal verification of stochastic dynamical systems over continuous state spaces. Motivated by problems in state estimation and information-flow security, we introduce the notion of observational properties, which characterize the inferences an external observer can draw from system outputs. These properties are formulated as probabilistic hyperproperties based on HyperLTL over finite traces, yielding a unified framework that subsumes several existing notions studied separately in the literature. We reduce the verification problem to reachability analysis over an augmented structure that integrates the system dynamics with an automaton representation of the specification. Building on this construction, we develop stochastic barrier certificates that provide probabilistic guarantees for property satisfaction while avoiding explicit state-space discretization. The effectiveness of the proposed framework is demonstrated through a case study.

eess.SY