Search arXiv⌕ Search

arXiv · 2206.05872

Resource Allocation and 3D Trajectory Design for Power-Efficient IRS-Assisted UAV-NOMA Communications

Abstract

In this paper, an intelligent reflecting surface (IRS) is introduced to assist an unmanned aerial vehicle (UAV) communication system based on non-orthogonal multiple access (NOMA) for serving multiple ground users. We aim to minimize the average total system energy consumption by jointly designing the resource allocation strategy, the three dimensional (3D) trajectory of the UAV, as well as the phase control at the IRS. The design is formulated as a non-convex optimization problem taking into account the maximum tolerable outage probability constraint and the individual minimum data rate requirement. To circumvent the intractability of the design problem due to the altitude-dependent Rician fading in UAV-to-user links, we adopt the deep neural network (DNN) approach to accurately approximate the corresponding effective channel gains, which facilitates the development of a low-complexity suboptimal iterative algorithm via dividing the formulated problem into two subproblems and address them alternatingly. Numerical results demonstrate that the proposed algorithm can converge to an effective solution within a small number of iterations and illustrate some interesting insights: (1) IRS enables a highly flexible UAV's 3D trajectory design via recycling the dissipated radio signal for improving the achievable system data rate and reducing the flight power consumption of the UAV; (2) IRS provides a rich array gain through passive beamforming in the reflection link, which can substantially reduce the required communication power for guaranteeing the required quality-of-service (QoS); (3) Optimizing the altitude of UAV's trajectory can effectively exploit the outage-guaranteed effective channel gain to save the total required communication power enabling power-efficient UAV communications.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Yuanxin Cai, Zhiqiang Wei, Shaokang Hu, Chang Liu, Derrick Wing Kwan Ng, Jinhong Yuan. 2022-06-13. Resource Allocation and 3D Trajectory Design for Power-Efficient IRS-Assisted UAV-NOMA Communications. https://arxiv.org/abs/2206.05872

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

KEEP EXPLORING

Related papers

Efficient and rate-optimal list-decoding in the presence of minimal feedback

Given a channel with length-$n$ inputs and outputs over the alphabet $\{0,1,\ldots,q-1\}$, and of which a fraction $\varrho \in (0,1-1/q)$ of symbols can be arbitrarily corrupted by an adversary, a fundamental problem is that of communicating at rates close to the information-theoretically optimal values, while ensuring the receiver can infer that the transmitter's message is from a ``small" set. While the existence of such codes is known, and constructions with computationally tractable encoding/decoding procedures are known for large $q$, we provide the first schemes that attain this performance for any $q \geq 2$, as long as low-rate feedback (asymptotically negligible relative to the number of transmissions) from the receiver to the transmitter is available. For any sufficiently small $\varepsilon > 0$ and $\varrho \in (1-{1}/{q}-Θ(\sqrt{\varepsilon}))$ our minimal feedback scheme has the following parameters: Rate $1-H_q(\varrho) - \varepsilon$ (i.e., $\varepsilon$-close to information-theoretically optimal -- here $H_q(\varrho)$ is the $q$-ary entropy function), list-size $\exp\left(\mathcal{O}\left(\varepsilon^{-3/2}\log^2(1/\varepsilon)\right)\right)$, computational complexity of encoding/decoding $n^{\mathcal{O}(\varepsilon^{-1}\log(1/\varepsilon))}$, storage complexity $\mathcal{O}(n^{η+1}\log n)$ for a code design parameter $η>1$ that trades off storage complexity with the probability of error. The error probability is $\mathcal{O}(n^{-η})$, and the (vanishing) feedback rate is $\mathcal{O}({1}/{\sqrt{\log(n)}})$. Our full-feedback scheme has zero probability of error and minimal storage complexity, while the other parameters are the same as the vanishing rate feedback scheme.

cs.IT↗

On Cost-Aware Designs for Sequential Hypothesis Testing

We introduce Cost-Aware (CA) Sequential Hypothesis Testing (CASHT), in which an active decision-maker selects sensing actions with different, random costs to identify the true hypothesis under an average-error constraint $δ$, while minimizing the expected total cost (rather than the number of samples). For fixed costs, we prove that the optimal expected total cost scales as $Θ(\log(1/δ))$, and is achievable by Multihypothesis Sequential Probability Ratio Test-based procedures. We show that the CA design principle is to maximize the ratio of expected information gain to expected cost under the policy-induced action distribution. Guided by this principle, we adapt two classic policies to the CA setting and establish their asymptotic optimality. We then treat random costs under two revelation models: ex-post, where costs are disclosed only after a sample is obtained, and the cost-error tradeoff coincides with the fixed-cost case, and ex-ante, where costs accrue before acquisition, and the decision maker may cancel an action mid-operation. For the ex-ante model, we characterize when cancellation lowers the total cost and analyze several cost distributions in detail. Simulations confirm our findings that the CA variants consistently reduce total cost relative to their classic counterparts, and when action cancellation helps or hurts.

cs.IT↗

Construction of Multi-sequences With High Nonlinear Complexity via Narrow Ray Class Fields

Nonlinear complexity is a fundamental criterion in the evaluation of pseudorandom sequences. The construction of multi-sequences with high nonlinear complexity is both theoretically and practically important in cryptography. Motivated by prior constructions of multi-sequences with high nonlinear complexity in [IEEE Trans. Inf. Theory, 60(10), 2014] and [IEEE Trans. Inf. Theory, 63(12), 2017], we provide a unified framework via narrow ray class fields and the cyclic descent introduced by Guruswami and Xing in [J. Combin. Theory Ser. A 129 (2015) ]. Then we can generate new multi-sequences with high nonlinear complexity over function fields with arbitrary genera.

cs.IT↗