Efficient UAV Coverage in Large Convex Quadrilateral Areas with Elliptical Footprints
Unmanned Aerial Vehicles (UAVs) have gained significant attention for improving wireless communication, especially in emergencies or as a complement to existing cellular infrastructure. This letter addresses the problem of efficiently covering a large convex quadrilateral using multiple UAVs, where each UAV generates elliptical coverage footprints based on its altitude and antenna tilt. The challenge is approached using circle-packing techniques within a unit square to arrange UAVs in an optimal configuration. Subsequently, a homography transformation is applied to map the unit square onto the quadrilateral area, ensuring that the UAVs' elliptical footprints cover the entire region. Numerical simulations demonstrate the effectiveness of the proposed method, providing insight into coverage density and optimal altitude configurations for different placement scenarios. The results highlight the scalability and potential for improving UAV-based communication systems, focusing on maximizing coverage efficiency in large areas with irregular shapes.
Code (0)
등록된 구현이 없습니다.
Methods 이 논문이 사용한 방법론
Similar Papers 제목 키워드 기반
Optimizing Coverage in Convex Quadrilateral Regions with a Single UAV
The integration of unmanned aerial vehicles (UAVs) into next-generation wireless networks is a promising solution for providing flexible, efficient coverage. This paper explores the optimal deployment of a single UAV to …
On the Terminal Location Uncertainty in Elliptical Footprints: Application in Air-to-Ground Links
Wireless transmitters (Txs) radiating directionally downwards often generate circular footprints on the ground. In certain scenarios, using elliptical cells can offer increased flexibility for providing user coverage, ow…
Tyler's Covariance Matrix Estimator in Elliptical Models with Convex Structure
We address structured covariance estimation in elliptical distributions by assuming that the covariance is a priori known to belong to a given convex set, e.g., the set of Toeplitz or banded matrices. We consider the Gen…
Log-Polar Space Convolution
Convolutional neural networks use regular quadrilateral convolution kernels to extract features. Since the number of parameters increases quadratically with the size of the convolution kernel, many popular models use sma…
Geometric optimisation on positive definite matrices for elliptically contoured distributions
Hermitian positive definite matrices (HPD) recur throughout statistics and machine learning. In this paper we develop \emph{geometric optimisation} for globally optimising certain nonconvex loss functions arising in the …
Riemannian optimization