On Ergodic Capacity and Optimal Number of Tiers in UAV-Assisted Communication Systems
Sha Hu

TL;DR
This paper investigates the ergodic capacity of UAV-assisted multi-tier relay systems modeled as Rayleigh product channels, deriving bounds and proposing an efficient method to optimize the number of UAV tiers for maximum capacity.
Contribution
It introduces a closed-form lower-bound for ergodic capacity and a low-complexity approach to determine the optimal number of UAV tiers, with extensive asymptotic analysis.
Findings
Derived a tight lower-bound for ergodic capacity at high SNR.
Proposed a near-optimal, low-complexity method for tier optimization.
Analyzed asymptotic behavior of capacity and optimal tiers.
Abstract
In this paper, we consider unmanned aerial vehicle (UAV) assisted communication systems where a number of UAVs are utilized as multi-tier relays between a number of users and a base-transceiver station (BTS). We model the wireless propagation channel between the users and the BTS as a Rayleigh product channel, which is a product of a series of independent and identically distributed (i.i.d.) Rayleigh multi-input multi-output (MIMO) channels. We put a special interested in optimizing the number of tiers in such UAV-assisted systems for a given total number of UAVs to maximize the ergodic capacity. To achieve this goal, in a first part we derive a lower-bound in closed-form for the ergodic capacity which is shown to be asymptotically tight as signal-to-noise ratio (SNR) increases. With the derived bound, in a second part we analyze the optimal number of UAV-tiers, and propose a…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsCooperative Communication and Network Coding · UAV Applications and Optimization · Advanced MIMO Systems Optimization
