Search arXivSearch

arXiv · 1911.00821

Utility-Aware Optimal Resource Allocation Protocol for UAV-Assisted Small Cells with Heterogeneous Coverage Demands

Abstract

In this paper, we consider a UAV-assisted small-cell having heterogeneous users with different data rates and coverage demands. Specifically, we propose a novel utility-aware resource-allocation protocol to maximize the utility of UAV by allowing it to simultaneously serve the highest possible number of heterogeneous users with available energy resources. In this regard, first, we derive a closed-form expression for the rate-coverage probability of a user considering Rician fading to incorporate the strong line of sight (LoS) component in UAV communication. Next, since this UAV utility maximization problem is non-convex and combinatorial, to obtain the global optimal resource allocation policy we propose an iterative feasibility checking method for fixed integers ranging from lower to upper bound on the number of users that can be served by UAV. To further reduce the complexity, we formulate an equivalent problem aimed at minimizing per user energy consumption, where tight analytical relaxation on rate-coverage probability constraint is used along with semi-closed expressions for joint-optimal power and time allocation. Lastly, via detailed numerical investigation, we validate our analytical claims, present insights on the impact of key system parameters, and demonstrate that 60% more users can be served using the proposed scheme, as compared to relevant benchmarks.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Poonam Lohan, Deepak Mishra. 2019-11-03. Utility-Aware Optimal Resource Allocation Protocol for UAV-Assisted Small Cells with Heterogeneous Coverage Demands. https://arxiv.org/abs/1911.00821

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

KEEP EXPLORING

Related papers

Bistatic Target Detection by Exploiting Both Deterministic Pilots and Unknown Random Data Payloads

Integrated sensing and communication (ISAC) plays a crucial role in 6G, to enable innovative applications such as drone surveillance, urban air mobility, and low-altitude logistics. However, the hybrid ISAC signal, which comprises deterministic pilot and random data payload components, poses challenges for target detection due to two reasons: 1) these two components cause coupled shifts in both the mean and variance of the received signal, and 2) the random data payloads are typically unknown to the sensing receiver in the bistatic setting. Unfortunately, these challenges could not be tackled by existing target detection algorithms. In this paper, a generalized likelihood ratio test (GLRT)-based detector is derived, by leveraging the known deterministic pilots and the statistical characteristics of the unknown random data payloads. Due to the analytical intractability of exact performance characterization, we perform an asymptotic analysis for the false alarm probability and detection probability of the proposed detector. The results highlight a critical trade-off: both deterministic and random components improve detection reliability, but the latter also brings statistical uncertainty that hinders detection performance. Simulations validate the theoretical findings and demonstrate the effectiveness of the proposed detector, which highlights the necessity of designing a dedicated detector to fully exploited the signaling resources assigned to random data payloads.

cs.IT

On Unbiased Parameter Estimation and Signal Reconstruction

In this paper, we extend the theory of depth-unbiased source localization to unbiased parameter estimation and signal reconstruction for an arbitrary number of non-zero parameters. The topic touches on exact reconstructibility, most commonly studied in compressed sensing and multisource estimation across various imaging problems. The theoretical results derive upper bounds on the number of recoverable parameters in the noiseless case, and define a probability measure to assess the likelihood of recovering all non-zero parameters with correct magnitude order. The work provides a mathematical explanation of the open question regarding the noise robustness of standardized and unbiased methods. The paper also reveals a trade-off between the number of sensors and the signal-to-noise ratio. Numerical experiments demonstrate the theoretical findings.

cs.IT

Minimum enclosing Bregman balls made easy

In this work, we revisit the problem of computing minimum enclosing Bregman balls (Bregman MEBs) of finite sets of parameters. First, we show that Bregman MEBs are equivalent to MEBs of corresponding weighted point sets with respect to the power distance. We then report an efficient Frank--Wolfe $(1+ε)$-approximation algorithm for computing power MEBs, for any $ε>0$. This power MEB approximation algorithm coincides with the Bregman MEB approximation algorithm of Nock and Nielsen (2005) when expressed in the dual gradient space. Finally, we show that the Bregman potential lifting transforms used to construct Bregman Voronoi diagrams can be reinterpreted as the classical paraboloid lifting transform applied to corresponding weighted point sets. In particular, Bregman MEB circumcenters lie on the farthest Bregman Voronoi diagrams or equivalently on the corresponding farthest power diagrams.

cs.IT