This paper was converted on www.awesomepapers.org from LaTeX by an anonymous user.
Want to know more? Visit the Converter page.

Deployment Optimization of Dual-functional UAVs for Integrated Localization and Communication

Zheyuan Yang, , Suzhi Bi, , Ying-Jun Angela Zhang Z. Yang and Y-J. A. Zhang are with the Department of Information Engineering, The Chinese University of Hong Kong, Hong Kong ({yz019, yjzhang}@ie.cuhk.edu.hk). S. Bi is with the College of Electronics and Information Engineering, Shenzhen University, Shenzhen, China ([email protected]). S. Bi is also with the Peng Cheng Laboratory, Shenzhen, China.
Abstract

In emergency scenarios, unmanned aerial vehicles (UAVs) can be deployed to assist localization and communication services for ground terminals. In this paper, we propose a new integrated air-ground networking paradigm that uses dual-functional UAVs to assist the ground networks for improving both communication and localization performance. We investigate the optimization problem of deploying the minimal number of UAVs to satisfy the communication and localization requirements of ground users. The problem has several technical difficulties including the cardinality minimization, the non-convexity of localization performance metric regarding UAV location, and the association between user and communication terminal. To tackle the difficulties, we adopt DD-optimality as the localization performance metric, and derive the geometric characteristics of the feasible UAV hovering regions in 2D and 3D based on accurate approximation values. We solve the simplified 2D projection deployment problem by transforming the problem into a minimum hitting set problem, and propose a low-complexity algorithm to solve it. Through numerical simulations, we compare our proposed algorithm with benchmark methods. The number of UAVs required by the proposed algorithm is close to the optimal solution, while other benchmark methods require much more UAVs to accomplish the same task.

Index Terms:
Wireless localization, integrated localization and communication (ILAC), unmanned aerial vehicle (UAV), geometric deployment.

I Introduction

I-A Motivations

Modern 5G communication networks with high speed and low latency are expected to cover most urban areas. New applications enabled by 5G such as remote healthcare, Internet of Vehicles, smart homes, industrial control, and environmental monitoring will bring unprecedented intelligent service experience to citizens [1, 2, 3]. However, urban 5G networks are under the risk of regional service interruption in case of earthquakes, floods or other emergency accidents[4]. Besides, in remote areas such as mountainous environments and wild fields, it is difficult to guarantee smooth communication when performing terrain survey, reconnaissance and rescue operations due to the high deployment cost and insufficient coverage of communications infrastructure. Recently, unmanned aerial vehicle (UAV) technology has emerged as an important solution to assist communication in emergency, where UAV-mounted aerial base stations (BSs) can be flexibly deployed to cover ground users with high-speed and reliable line-of-sight (LoS) communication services[5].

Besides reliable communication services, ground terminals such as rescue devices also demand accurate positioning services in emergency scenarios. The global navigation satellite system (GNSS) can provide satisfactory positioning services in open-sky environments [6]. However, under severe obstructions and scattering in mountainous or disaster environments, the positioning accuracy of GNSS plummets dramatically (e.g., from 5-10 meters root mean square error to tens of meters) and the positioning service suffers from frequent interruptions[7]. Besides, the GNSS has relatively low positioning accuracy in vertical dimension, and thus it cannot provide accurate three-dimensional (3D) localization services required in many emergency scenarios[8]. In addition to GNSS, existing terrestrial cellular networks have independent localization capabilities, where terrestrial BSs can serve as anchor nodes (ANs) to support a variety of localization methods such as observed time difference of arrival (OTDoA) positioning [9]. Achieving high 3D localization accuracy requires not only sufficient number of ANs, but also spatial diversity in the deployment of ANs[10]. For instance, to attain high vertical positioning accuracy, the anchors should differ noticeably in amplitude. When the ground ANs are co-planar, UAVs can be quickly and flexibly deployed as temporary aerial ANs to improve the overall localization accuracy, especially in the vertical dimension. Existing UAV deployment solutions mostly use UAVs for either communication or positioning purpose, and lack efficient coordination with terrestrial networks. As a result, a large number of UAVs are needed to ensure both communication and positioning performance in a large area. In practice, this could lead to large networking delay, high control complexity and signalling overhead.

To minimize the UAV deployment cost of emergency networks, we propose a dual-functional UAV paradigm that utilizes UAVs as both air-based ANs and BSs to provide integrated localization and communication (ILAC) services to ground UEs. Specifically, we consider to deploy multiple dual-functional UAVs working collaboratively with terrestrial BSs to extend the communication and localization service coverage. The key design problem lies in the potential conflicting effects of UAV positions on the communication and localization performance of ground UEs. Intuitively, as an aerial BS, a UAV needs to be deployed close to the ground UEs for stronger communication link quality; as an aerial AN, however, such a close-to-ground UAV deployment may cause large vertical localization error due to its similar altitude with terrestrial anchors. To meet the diverse service requirements of ground UEs, the deployment of UAVs should coordinate with terrestrial BSs to achieve a balanced communication and localization performance.

To this end, this paper aims to answer the following two key questions:

Q1: For a UE at a given target location, how to determine the position of a single dual-functional UAV in an analytical form, such that the UAV and ground BSs can collaboratively satisfy the communication and localization performance requirements of the UE.

Q2: For a set of target UEs distributed over a large area, how to deploy minimum number of dual-functional UAVs within a short computational time, such that the integrated air-ground network can meet the communication and localization performance requirements of all the UEs.

To understand the technical challenges of the above questions, we review in the following some related work using UAVs to provide communication and localization services.

I-B Related Work

I-B1 UAV-assisted Communication

There have been extensive studies in recent years on employing UAVs to assist terrestrial communications. For instance, UAVs are deployed in mobile hot-spots to offload cellular traffic, as aerial relays to tackle obstructions in the ground, as transceivers to collect/disseminate data from/to massive IoT devices in rural areas, and as temporary aerial stations in emergency, etc. UAV deployment is one key design problem in UAV-assisted communications. Depending on the mobility of UAVs, existing studies are mainly divided into two streams: one optimizes the fixed locations of rotary-wing UAVs and the other designs the trajectories of mobile UAVs, including both rotary-wing and fixed-wing UAVs. In this paper, we focus on the former topic to deploy dual-functional UAVs at fixed locations.

Considering a simplified one-dimensional (1D) scenario, the authors in [11] derive the formula of LoS probability between the UAV and the ground users, and optimize the UAV altitude to maximize the UAV communication coverage. For multiple UAVs, the authors in [12] study the optimal altitude of UAVs as relays to minimize the end-to-end outage probability and bit error rate (BER). [13] and [14] further consider the UAV placement for communication in 2D scenario when the UAV altitude is fixed. [13] aims to minimize the number of UAVs to cover a group of ground users by sequentially deploying the UAVs along a spiral path from area perimeter toward the center.[14] jointly optimizes the UAV 2D locations and user transmission power to maximize the user communication rate to both UAVs and multiple terrestrial BSs. Furthermore, recent studies [15, 16, 17] investigate how to deploy UAVs in 3D space to improve the communication performance. Considering using a single UAV as a relay, [15] minimizes the decoding error probability in latency-critical scenarios by optimizing the location and power of the UAV. Using multiple UAVs as relays, [16] searches for the optimal UAV locations to maximize the system communication rate. [17] investigates the problem of determining 3D placement and orientation of the minimal number of UAVs to guarantee the LoS coverage and the signal-to-noise ratio (SNR) between the UAV-UE pairs.

I-B2 UAV-assisted Localization

Besides GNSS, a UE can also estimate its location from the positioning reference signals sent by cellular networks, such as received signal strength (RSS), time of arrival (ToA) and time difference of arrival (TDoA)[18]. Among them, location estimation using TDoA measurements is one popular method used in 4G/5G standard for high-precision localization. The estimation is based on the principle of linear least-square estimation, where at least four ANs are required to obtain an unbiased 3D location estimation. Additional ANs can provide redundancy in the estimation to counter noisy measurements.

Given the deployment of ANs, there have been extensive studies to optimize the resource allocation such as power and bandwidth allocation to minimize the localization error. [19] and [20] study the resource allocation for UAV-assisted vehicle localization using ToA method. Both studies obtain the global optimal solution based on semi-definite programming (SDP) that minimizes the Cramer-Rao lower bound (CRLB) of the localization error. However, minimizing the localization error with respect to UAV anchor deployment is difficult due to the non-convexity of CRLB regarding the UAV position. The current research on UAV deployment and trajectory optimization mainly adopts exploration algorithms, such as genetic algorithms, predetermined-pattern trajectory optimization and particle swarm optimization [21, 22, 23]. [21] plans a static path for a single UAV by selecting a subset of way-points from a predetermined point set to maximize the localization precision. In [22], the authors jointly optimize the UAV positions, power and bandwidth allocation to improve the localization accuracy of vehicles by Taylor expansion-based approximate searching algorithm. Based on RSS measurements, [23] designs the UAV trajectory to assist 3D map estimation using particle swarm optimization. In general, the existing exploration-based methods lack theoretical analysis on the optimal UAV deployment. As a result, the obtained solution often cannot guarantee localization performance and may induce high computational complexity in emergent UAV deployment applications.

I-B3 Summary

To summarize, communication-oriented UAV placement is well-understood from 1D to 3D scenarios. However, localization-oriented UAV placement lacks theoretical characterization and efficient optimization tools. In addition, most work studies the communication and localization problems separately, which may lead to high deployment cost and delay in emergency network. Reusing one UAV for providing both communication and localization services is an effective solution to reduce the network deployment cost, which however is also more challenging considering the potential performance conflict in the dual-functional UAV deployment. To achieve guaranteed quality of service (QoS), we need both theoretical analysis and low-complexity algorithm design for the deployment of dual-functional UAVs.

I-C Contributions

In this paper, we study the optimal deployment problem of dual-functional UAVs that operate collaboratively with ground BSs to provide both communication and localization services to ground UEs. In particular, we are interested in deploying minimal UAVs to satisfy the communication and localization performance requirements of UEs at a set of target locations. Our contributions are summarized as follows.

I-C1 Low-cost networking with dual-functional UAVs

We propose a new integrated air-ground networking paradigm that uses dual-functional UAVs to assist the ground networks for improving both communication and localization services. We consider a UE using OTDoA method to estimate its own location from the positioning signals sent by a UAV and three ground BSs. Besides, each UE communicates to either a UAV or a BS that yields the highest data rate. The proposed dual-functional UAV scheme significantly reduces the cost and delay in the network deployment under emergency.

I-C2 Minimal UAV deployment problem formulation

We formulate a minimal UAV deployment problem that optimizes both the number and locations of UAVs to meet the communication and localization requirements of ground UEs. The problem is very challenging because of the intractable cardinality minimization, the combinatorial UAV-UE communication association, and non-convex UAV location optimization. We solve the problem in two steps. First, we derive the closed-form expression of feasible UAV location to meet the dual performance requirements of each UE. Then, we transform the minimum deployment problem into an equivalent graphical form and design an efficient algorithm accordingly.

I-C3 Geometric characterization of feasible UAV location

We first analyze the feasible deployment location of a UAV that meets the localization accuracy requirement of a UE. Instead of conventional CRLB performance metric, we propose to use D-optimality as the key localization accuracy metric for analytical tractability. We show that, under the D-optimality metric, the feasible location of the UAV can be characterized as a second-order cone in 3D space. Meanwhile, given a fixed altitude, it reduces to an ellipse in 2D projection plane. We derive the closed-form expressions of both the 3D and 2D feasible regions of the UAV.

I-C4 Efficient graphical solution algorithm

With the geometrical characterization of feasible region, we show that the minimal deployment problem can be equivalently transformed to a minimum hitting set problem, which is a classical NP-complete problem that lacks efficient solution. Based on the equivalent graphical formulation, we propose a low-complexity approximate algorithm to tackle the NP-hardness of the problem in large-size emergent networks.

Simulation results show that the proposed method achieves close-to-optimal performance with much lower computational complexity. Besides, compared with conventional scheme with four ground anchors to locate a 3D target, we find that the proposed integrated air-ground network paradigm significantly improves the localization accuracy in both horizontal and vertical directions. This is because the deployed UAV improves not only the altitude diversity, but also the anchor-target localizing link strength especially when the NLoS noise is large in ground-to-ground channels. Overall, the proposed UAV deployment method provides an efficient solution to guarantee both communication and localization performance requirements.

The rest of paper is organized as follows. Section II introduces the system model of UAV-assisted air-ground ILAC scheme and we formulation the minimum UAV deployment problem in Section III. In Section IV and Section V, we analyze the feasible UAV hovering regions and propose a low-complexity deployment algorithm. Section VI presents the simulation results to evaluate the algorithm performance. Lastly, Section VII concludes the paper.

II System Model

As shown in Fig. 1, we consider an emergency network consisting of 3 terrestrial BSs, UU rotary-wing UAVs and KK UEs. The locations of the nn-th BS, the uu-th UAV and the kk-th UE are denoted as 𝒃n=[xnb,ynb,hnb,],n𝒩{1,2,3}\bm{b}_{n}=[x_{n}^{b},y_{n}^{b},h_{n}^{b},],n\in\mathcal{N}\triangleq\{1,2,3\}, 𝒃u=[xua,yua,hua],u𝒰{1,2,,U}\bm{b}_{u}=[x_{u}^{a},y_{u}^{a},h_{u}^{a}],\forall u\in\mathcal{U}\triangleq\{1,2,...,U\} and 𝒎k=[xk,yk,hk],k𝒦{1,2,,K}\bm{m}_{k}=[x_{k},y_{k},h_{k}],\forall k\in\mathcal{K}\triangleq\{1,2,...,K\}, respectively.111Notice that the accurate user location is not known and to be estimated. The location 𝒎k\bm{m}_{k} is in fact a target user location to receive communication and localization service, e.g., from initial coarse location estimation. A naive way to set the target user locations is dividing the area of interest into equally separated points. Without causing confusions, we use target user location and user location interchangeably in this paper. The UAVs and BSs collaboratively provide communication and localization services to ground UEs.

Refer to caption
Figure 1: System model of the air-ground ILAC network.

II-A Communication Model

Considering the occasional blockage between the UAVs and the ground UEs, we adopt the commonly used probabilistic LoS channel model to determine the large-scale attenuation for the ground-to-air (G2A) links[11]. The probability of geometric LoS between the UAV and UE depends on statistical parameters related to the environment and the elevation angle. Specifically, we denote the LoS probability between the UAV at location 𝒃u\bm{b}_{u} and UE kk as (LoS,θku)\mathbb{P}(LoS,\theta_{ku}), which can be approximated as a modified sigmoid function of the following form [11]

(LoS,θku)=11+e1exp(e2(θkue1)),\mathbb{P}(LoS,\theta_{ku})=\tfrac{1}{1+e_{1}\exp\left(-e_{2}(\theta_{ku}-e_{1})\right)}, (1)

where e1e_{1} and e2e_{2} are environment-related parameters. θku\theta_{ku} is the elevation angle given by

θku=180πarcsin(|huahk|𝒃u𝒎k),\theta_{ku}=\tfrac{180}{\pi}\arcsin\left(\tfrac{|h_{u}^{a}-h_{k}|}{||\bm{b}_{u}-\bm{m}_{k}||}\right), (2)

and θku[0,90]\theta_{ku}\in[0^{\circ},90^{\circ}]. Accordingly, the expected channel power gain is equal to

gku=(LoS,θku)+(1(LoS,θku))κγ0𝒃u𝒎kα=^(LoS,θku)γ0𝒃u𝒎kα,g_{ku}=\tfrac{\mathbb{P}(LoS,\theta_{ku})+(1-\mathbb{P}(LoS,\theta_{ku}))\kappa}{\gamma_{0}||\bm{b}_{u}-\bm{m}_{k}||^{\alpha}}=\tfrac{\hat{\mathbb{P}}(LoS,\theta_{ku})}{\gamma_{0}||\bm{b}_{u}-\bm{m}_{k}||^{\alpha}}, (3)

where κ<1\kappa<1 is the attenuation effect of the NLoS channel, α2\alpha\geq 2 is the path loss exponent and γ0=(4πfcc)2\gamma_{0}=(\tfrac{4\pi f_{c}}{c})^{2} is the reference free space path loss at a distance of 1 m with fcf_{c} being the carrier frequency of the G2A channel and cc being the speed of light. Then, the uplink transmission rate (bits/s) between the user kk and the UAV is

Rku=Wkulog2(1+PkgkuWkuN0)=Wkulog2(1+^(LoS,θku)PkWkuN0γ0𝒃u𝒎kα),R_{ku}=W_{ku}\log_{2}\left(1+\tfrac{P_{k}g_{ku}}{W_{ku}N_{0}}\right)=W_{ku}\log_{2}\left(1+\tfrac{\hat{\mathbb{P}}(LoS,\theta_{ku})P_{k}}{W_{ku}N_{0}\gamma_{0}||\bm{b}_{u}-\bm{m}_{k}||^{\alpha}}\right), (4)

where WkuW_{ku} is the communication bandwidth, PkP_{k} is the transmission power of user kk, N0N_{0} is the noise power spectral density and α\alpha is the path loss exponent of the G2A channel.

Due to the rich scattering environment in the ground, the ground-to-ground (G2G) channel between the user device and the terrestrial BS can be modeled as a Rayleigh fading channel, which consists of large-scale attenuation and time-varying small-scale fading. We denote the small-scale fading coefficient as hG2G(t)h_{\text{G2G}}(t) and 𝔼[|hG2G(t)|2]=1\mathbb{E}[|h_{\text{G2G}}(t)|^{2}]=1. The instantaneous capacity of the G2G channel is given by

Rkn(t)=Wknlog2(1+|hG2G(t)|2PkWknN0γ0𝒃n𝒎kβ),\displaystyle R_{kn}(t)=W_{kn}\log_{2}\left(1+\tfrac{|h_{\text{G2G}}(t)|^{2}P_{k}}{W_{kn}N_{0}\gamma_{0}||\bm{b}_{n}-\bm{m}_{k}||^{\beta}}\right), (5)

which changes dynamically in the fading channel. Given an outage probability tolerance ε\varepsilon, an achievable transmission rate (bits/s) of the G2G Rayleigh fading channel can be calculated from Jensen’s inequality as

Rkn=Wknlog2(1+F1(ε)PkWknN0γ0𝒃n𝒎kβ),\displaystyle R_{kn}=W_{kn}\log_{2}\left(1+\tfrac{F^{-1}(\varepsilon)P_{k}}{W_{kn}N_{0}\gamma_{0}||\bm{b}_{n}-\bm{m}_{k}||^{\beta}}\right), (6)

where F()F(\cdot) is the cumulative distribution function (CDF) of the Rayleigh fading coefficient, which can be obtained from empirical measurements[24]. The power gain of the G2G channel can be derived as

gkn=F1(ε)γ0𝒃n𝒎kβ.\displaystyle g_{kn}=\tfrac{F^{-1}(\varepsilon)}{\gamma_{0}||\bm{b}_{n}-\bm{m}_{k}||^{\beta}}. (7)

II-B Localization Model

We consider the OTDoA positioning method to localize the ground UEs. To reduce the computational complexity of UE, each UE estimates its 3D location from the reference signals sent by four ANs, including all the three ground BSs and a UAV. We assume that the accurate locations of terrestrial BSs and UAVs are known, since UAVs can use altimeters and satellite systems to locate themselves. Each UE measures the time-of-arrival (ToA) of localization signals from the aerial and terrestrial ANs. The TDoA observations are the time difference between the ToA of a reference node and the ToAs of the remaining ANs. Suppose that all ANs are accurately synchronized in time and BS 1 is the reference node, device kk estimates its location 𝒎k\bm{m}_{k} by solving the TDoA equations:

τn1\displaystyle\tau_{n1} =(𝒃n𝒎k𝒃1𝒎k)/c,n𝒰{2,3},\displaystyle=(||\bm{b}_{n}-\bm{m}_{k}||-||\bm{b}_{1}-\bm{m}_{k}||)/c,\quad n\in\mathcal{U}\cup\{2,3\}, (8)

where cc is the propagation speed of the signals and τn1\tau_{n1} is the TDoA between the nn-th anchor and the reference node BS 1. There exist many linear and non-linear estimation algorithms to obtain 𝒎k\bm{m}_{k} from the TDoA equations[25]. In this paper, we are interested in the theoretical bound of localization accuracy regardless of the specific estimation algorithm.

Without loss of generality, we analyze the performance of the OTDoA method by considering the narrowband positioning reference signal (NPRS) in the narrowband IoT (NB-IoT) system. NPRS is an orthogonal frequency division multiplexing (OFDM) based downlink reference signal occupying 180 kHz bandwidth (one LTE resource block). The variance of the ToA measurement using NsubN_{sub} OFDM subframes is expressed as [26]

σToA2=Ts2Nsub8π2s𝒮i𝒩spi2i21SNR=ψSNR,\displaystyle\sigma_{\text{ToA}}^{2}=\tfrac{T_{s}^{2}}{N_{sub}\cdot 8\pi^{2}\cdot\sum_{s\in\mathcal{S}}\sum_{i\in\mathcal{N}_{s}}p_{i}^{2}i^{2}}\cdot\tfrac{1}{\text{SNR}}=\tfrac{\psi}{\text{SNR}}, (9)

where TsT_{s} and SNR are the symbol duration and signal-to-noise ratio of the received signal, respectively. In one localization period, we have NsubN_{sub} OFDM subframes and each subframe have a set 𝒮={1,2,,S}\mathcal{S}=\{1,2,...,S\} of symbols containing NPRS signal. In symbol ss, the subset of subcarriers containing NPRS signal is denoted as 𝒩s\mathcal{N}_{s} and pi[0,1]p_{i}\in[0,1] is the relative power weight of each subcarrier ii. According to (9), the variance of the ToA measurement from UAV uu to UE kk is given by

σuk2=ψWN0gkuPu,\displaystyle\sigma_{uk}^{2}=\psi\tfrac{WN_{0}}{g_{ku}P_{u}}, (10)

where WW is the NPRS bandwidth, N0N_{0} is the noise power density, PuP_{u} is the transmission power of the UAV, and gkug_{ku} is the power gain of G2A channel.

In the G2G channel, advanced signal processing algorithms are needed to eliminate the impacts of multi-path and NLoS propagation on the ToA measurement. The random estimation error is commonly modelled as an additional Gaussian noise term with variance σ NLoS2\sigma_{\text{ NLoS}}^{2}. With the power gain in (7), we derive the variance of the ToA measurements for the G2G channel as

σnk2ψWN0gknPn+σ NLoS2=ψWN0γ0𝒃n𝒎kβF1(ε)Pn+σ NLoS2,n𝒩,\displaystyle\sigma_{nk}^{2}\triangleq\psi\tfrac{WN_{0}}{g_{kn}P_{n}}+\sigma_{\text{ NLoS}}^{2}=\psi\tfrac{WN_{0}\gamma_{0}||\bm{b}_{n}-\bm{m}_{k}||^{\beta}}{F^{-1}(\varepsilon)P_{n}}+\sigma_{\text{ NLoS}}^{2},\quad n\in\mathcal{N}, (11)

where PnP_{n} is the transmission power of the BS nn. Then, the covariance matrix 𝐑TDoA\mathbf{R}_{\text{TDoA}} of the TDoA observations in unit s2\text{s}^{2} is given by [27]

𝐑TDoA=[var(τ21)cov(τ21,τ31)cov(τ21,τu1)cov(τ31,τ21)var(τ31)cov(τ31,τu1)cov(τu1,τ21)cov(τu1,τ31)var(τu1)]=[σ1k2+σ2k2σ1k2σ1k2σ1k2σ1k2+σ3k2σ1k2σ1k2σ1k2σ1k2+σuk2],\displaystyle\mathbf{R}_{\text{TDoA}}=\begin{bmatrix}\text{var}(\tau_{21})&\text{cov}(\tau_{21},\tau_{31})&\text{cov}(\tau_{21},\tau_{u1})\\ \text{cov}(\tau_{31},\tau_{21})&\text{var}(\tau_{31})&\text{cov}(\tau_{31},\tau_{u1})\\ \text{cov}(\tau_{u1},\tau_{21})&\text{cov}(\tau_{u1},\tau_{31})&\text{var}(\tau_{u1})\end{bmatrix}=\begin{bmatrix}\sigma_{1k}^{2}+\sigma_{2k}^{2}&\sigma_{1k}^{2}&\sigma_{1k}^{2}\\ \sigma_{1k}^{2}&\sigma_{1k}^{2}+\sigma_{3k}^{2}&\sigma_{1k}^{2}\\ \sigma_{1k}^{2}&\sigma_{1k}^{2}&\sigma_{1k}^{2}+\sigma_{uk}^{2}\end{bmatrix}, (12)

where var(x)(x) is the variance of variable xx and cov(x,y)(x,y) is the covariance of variables xx and yy.

II-C Localization Performance Metrics

The Fisher information matrix (FIM) quantifies the amount of information about the unknown parameter that measurement vector carries. The FIM for OTDoA positioning measurements in (8) is defined as

𝐅=𝐇T𝐑1𝐇,\displaystyle\mathbf{F}=\mathbf{H}^{T}\mathbf{R}^{-1}\mathbf{H}, (13)

where 𝐑=c2𝐑TDoA\mathbf{R}=c^{2}\cdot\mathbf{R}_{\text{TDoA}} is the covariance matrix of OTDoA positioning in unit m2\text{m}^{2}, and 𝐇\mathbf{H} is the Jacobian matrix of the TDoA equations

𝐇=[τ21xkτ21ykτ21hkτ31xkτ31ykτ31hkτu1xkτu1ykτu1hk],\displaystyle\mathbf{H}=\begin{bmatrix}\tfrac{\partial\tau_{21}}{\partial x_{k}}&\tfrac{\partial\tau_{21}}{\partial y_{k}}&\tfrac{\partial\tau_{21}}{\partial h_{k}}\\ \tfrac{\partial\tau_{31}}{\partial x_{k}}&\tfrac{\partial\tau_{31}}{\partial y_{k}}&\tfrac{\partial\tau_{31}}{\partial h_{k}}\\ \tfrac{\partial\tau_{u1}}{\partial x_{k}}&\tfrac{\partial\tau_{u1}}{\partial y_{k}}&\tfrac{\partial\tau_{u1}}{\partial h_{k}}\end{bmatrix}, (14)

and the elements in the first and second rows of 𝐇\mathbf{H} can be derived as

τn1xk=xnbxk𝒃n𝒎kx1bxk𝒃1𝒎k,τn1yk=ynbyk𝒃n𝒎ky1byk𝒃1𝒎k,τn1hk=hnbhk𝒃n𝒎kh1bhk𝒃1𝒎k,\displaystyle\tfrac{\partial\tau_{n1}}{\partial x_{k}}=\tfrac{x_{n}^{b}-x_{k}}{||\bm{b}_{n}-\bm{m}_{k}||}-\tfrac{x_{1}^{b}-x_{k}}{||\bm{b}_{1}-\bm{m}_{k}||},~{}\tfrac{\partial\tau_{n1}}{\partial y_{k}}=\tfrac{y_{n}^{b}-y_{k}}{||\bm{b}_{n}-\bm{m}_{k}||}-\tfrac{y_{1}^{b}-y_{k}}{||\bm{b}_{1}-\bm{m}_{k}||},~{}\tfrac{\partial\tau_{n1}}{\partial h_{k}}=\tfrac{h_{n}^{b}-h_{k}}{||\bm{b}_{n}-\bm{m}_{k}||}-\tfrac{h_{1}^{b}-h_{k}}{||\bm{b}_{1}-\bm{m}_{k}||}, (15)

with n=2,3n=2,3. The elements in the third row of 𝐇\mathbf{H} can be obtained from (15) by replacing 𝒃n\bm{b}_{n} with 𝒃u\bm{b}_{u}. There are several localization performance metrics defined based on the FIM. A common metric of localization accuracy is CRLB, which represents the theoretical lower bound of mean square estimation error. CRLB can be expressed as a function of UE location and UAV location L(𝒎k,𝒃u)=Tr(𝐅1)L(\bm{m}_{k},\bm{b}_{u})=\text{Tr}\left(\mathbf{F}^{-1}\right), where Tr(\cdot) means the trace of matrix. However, it is difficult to derive an analytical expression of the feasible UAV location with CRLB. In this paper, we adopt the D-optimality criterion to analyze the localization performance, which is a well-known performance metric of localization accuracy [28]. With the D-optimality metric, we will be able to find intuitive and meaningful geometrical characterizations of UAV deployment in Section IV. Specifically, D-optimality seeks to maximize the following opt-DD value

opt-D=det(𝐅1)=det(𝐇)2det(𝐑).\displaystyle\text{opt-}D=\det(\mathbf{F}^{-1})=\tfrac{\det(\mathbf{H})^{2}}{\det(\mathbf{R})}. (16)

The determinant of 𝐅1\mathbf{F}^{-1} is inversely proportional to the uncertainty area of an unbiased location estimation [29]. Intuitively, a D-optimality design minimizes the uncertainty ellipsoid, or equivalently, minimize the average location estimation error.

III Problem Formulation

Before formulating the UAV deployment optimization problem, we first provide a motivating example of using UAV to assist the ground localization service. In particular, we show that the proposed UAV-assisted localization method can effectively improve the localization accuracy of the conventional scheme using only terrestrial BSs. For the ease of exposition, we divide an area 𝒜=[0,600]m×[0,600]m\mathcal{A}=[0,600]~{}\text{m}\times[0,600]~{}\text{m} into small boxes with width of 10 m each. Three BSs are deployed at location (0,0,30)(0,0,30), (500,0,30)(500,0,30) and (250,433,30)(250,433,30) with unit meter. At each candidate location, we optimize the horizontal placement of the fourth AN at h=30h=30 m and calculate the CRLB of the localization variance. For comparison, we place the UAV as the fourth AN at a fixed amplitude 200 m and similarly optimize its horizontal location.222Detailed simulation parameters are provided in the simulation section.

Refer to caption
(a) Horizontal variance without UAV
Refer to caption
(b) Horizontal variance with UAV
Refer to caption
(c) Vertical variance without UAV
Refer to caption
(d) Vertical variance with UAV
Figure 2: Localization estimation variances under proposed design and conventional design, σNLoS2=4×1017\sigma^{2}_{NLoS}=4\times 10^{-17} s2\text{s}^{2}

After traversing all the points to be localized, we generate the heap maps in Fig. 2 according to the recorded estimation variance, when σNLoS2\sigma^{2}_{NLoS} is equal to 4×1017s24\times 10^{-17}~{}\text{s}^{2}. Each point in the heat map shows the minimum localization variance achievable by optimizing the location of the fourth AN, either the ground BS or UAV. Fig. 2(a) and Fig. 2(b) show the horizontal variance under both designs. Without the UAV, the horizontal variance is in the range of [1.80,7.12][1.80,7.12]. With UAV as the additional AN, the horizontal variance reduced to the range of [0.71,2.45][0.71,2.45]. The improvement is more significant in the vertical direction as shown in Fig. 2(c) and Fig. 2(d). The variance ranges are [3.75,5.63][3.75,5.63] and [1.25,1.88][1.25,1.88] for the conventional design and the UAV-assisted design, respectively.

Refer to caption
(a) Average localization variance versus σNLoS2\sigma_{NLoS}^{2}
Refer to caption
(b) Localization and communication capabilities
Figure 3: Variance and capability comparisons

In Fig. 3, we observe the localization accuracy improvement and the conflicting impact of UAV placement. Fig. 3(a) shows the average variance under different NLoS noise. Each sample point is the average performance of 10 localization points distributed in the area with random height from the range [10,20][10,20] m. For both methods, the average variance will increase when the NLoS noise becomes larger. The UAV-assisted localization method produces much lower localization variance than the conventional scheme in both horizontal and vertical directions. The improvement is more significant in the vertical direction when σNLoS2\sigma_{NLoS}^{2} is large. For example, when σNLoS2\sigma_{NLoS}^{2} is equal to 1015s210^{-15}~{}\text{s}^{2}, the proposed method reduces 57.3%57.3\% horizontal variance and 80.1%80.1\% vertical variance. To achieve localization accuracy at 1 m precision in both horizontal and vertical directions, the σNLoS2\sigma_{NLoS}^{2} is required to be lower than 4×1018s24\times 10^{-18}~{}\text{s}^{2} for the conventional method and 2.5×1017s22.5\times 10^{-17}~{}\text{s}^{2} for the UAV-assisted method. The above observations demonstrate the advantage of integrating UAVs for accurate 3D localization, especially in the vertical dimension. That is, the amplitude of UAV AN provides not only strong LoS link quality, but also the critical diversity in AN locations.

With fixed terrestrial BSs, we aim to deploy a minimum number of UAVs to satisfy the localization and communication requirements of all UEs. The problem is formulated as

𝒫1:\displaystyle\mathcal{P}1\mathrel{\mathop{\ordinarycolon}}\quad min{𝒃u}u𝒰|𝒰|,\displaystyle\min_{\{\bm{b}_{u}\}_{u\in\mathcal{U}}}\quad|\mathcal{U}|, (17a)
s.t. max{𝒃u}u𝒰opt-D(𝒎k,𝒃u)ϵk,k𝒦,\displaystyle\max_{\{\bm{b}_{u}\}_{u\in\mathcal{U}}}~{}\text{opt-}D(\bm{m}_{k},\bm{b}_{u})\geq\epsilon_{k},\forall k\in\mathcal{K}, (17b)
maxn𝒰𝒩RknRkth,k𝒦,\displaystyle\max_{n\in\mathcal{U}\cup\mathcal{N}}R_{kn}\geq R_{k}^{th},\forall k\in\mathcal{K}, (17c)
𝒃u𝒜,u𝒰,\displaystyle\bm{b}_{u}\in\mathcal{A},\forall u\in\mathcal{U}, (17d)

where |𝒰|=U|\mathcal{U}|=U is the number of UAVs and 𝒜\mathcal{A} is the restricted area to deploy the UAVs. Constraint (17b) is the localization accuracy requirement specified by an individual threshold ϵk\epsilon_{k}. Constraint (17c) means that the communication rate of UE kk should be larger than the threshold RkthR_{k}^{th}. The maximization term in (17b) means that each UE estimates its location using all the three ground BSs and only one UAV. Meanwhile, the maximization term in (17c) means that each UE transmits information to only one base station, either a UAV or a ground BS.

The optimization problem is a cardinality minimization, which is NP-hard in general. An intuitive methodology is to search feasible solutions given fixed cardinality. However, this does not reduce the difficulty because the localization constraints are non-convex in regard to the UAV positions. In addition, 𝒫1\mathcal{P}1 contains two implicit association problems between UEs and BSs or UAVs, which are hard combinatorial optimization problems in multi-UAV and multi-BS scenarios. Another major difficulty arises from the potential conflicting impact of UAV placement to the communication and localization performance. As an illustrating example, in Fig. 3(b), we constraint the UAV flying at a fixed amplitude and in a straight line passing over a UE at x=50x=50 m. We see that from x=50x=50 to 8080 m, the communication rate drops while the localization accuracy improves.

Overall, 𝒫1\mathcal{P}1 is difficult to solve, and it is even difficult to determine whether there exists a feasible solution satisfying all the constraints given the number of UAVs. In the next section, we analyze the localization performance constraints (17b) and derive closed-form expressions of feasible UAV hovering region.

IV Geometric Characterization of Localization Constraints

In this section, we characterize the localization performance constraint (17b) in a geometric form. This enables the design of efficient graph-based algorithm to solve 𝒫1\mathcal{P}1 in the next section.

IV-A Approximation of opt-DD Value

To facilitate the analysis, we propose in this subsection an approximation of the opt-DD value for a tagged UE kk. For simplicity, we drop the index kk and denote σnk\sigma_{nk} as σn\sigma_{n}. We calculate the determinant of the covariance matrix

det(𝐑)=c6σ12σ22σ32+c6(σ12σ32+σ12σ22+σ22σ32)σu2D1+D2ψSNRu,\displaystyle\det(\mathbf{R})=c^{6}\sigma_{1}^{2}\sigma_{2}^{2}\sigma_{3}^{2}+c^{6}(\sigma_{1}^{2}\sigma_{3}^{2}+\sigma_{1}^{2}\sigma_{2}^{2}+\sigma_{2}^{2}\sigma_{3}^{2})\sigma_{u}^{2}\triangleq D_{1}+D_{2}\cdot\tfrac{\psi}{\text{SNR}_{u}}, (18)

where D1c6σ12σ22σ32,D2c6(σ12σ32+σ12σ22+σ22σ32)D_{1}\triangleq c^{6}\sigma_{1}^{2}\sigma_{2}^{2}\sigma_{3}^{2},D_{2}\triangleq c^{6}(\sigma_{1}^{2}\sigma_{3}^{2}+\sigma_{1}^{2}\sigma_{2}^{2}+\sigma_{2}^{2}\sigma_{3}^{2}). Supposing that D1D2ψSNRuD_{1}\gg D_{2}\cdot\tfrac{\psi}{\text{SNR}_{u}}, we can ignore the second term and approximate det(𝐑)\det(\mathbf{R}) using D1D_{1}. Then, we denote the corresponding value as opt-D1D_{1}

opt-D1=det(𝐇)2D1.\displaystyle\text{opt-}D_{1}=\tfrac{\det(\mathbf{H})^{2}}{D_{1}}. (19)

In contrast, when D1D2ψSNRuD_{1}\ll D_{2}\cdot\tfrac{\psi}{\text{SNR}_{u}}, we ignore the constant term D1D_{1} and approximate det(𝐑)\det(\mathbf{R}) using the second term. We denote this approximation as opt-D2D_{2}, where

opt-D2=det(𝐇)2ψD2SNRu.\displaystyle\text{opt-}D_{2}=\tfrac{\det(\mathbf{H})^{2}\psi}{D_{2}\text{SNR}_{u}}. (20)

In the following lemma, we show the condition when opt-D1D_{1} is an accurate approximation.

Lemma 1.

When SNRuSNRn3σ NLoS2σu2,n𝒩\frac{\text{SNR}_{u}}{\text{SNR}_{n}}\gg 3-\tfrac{\sigma_{\text{ NLoS}}^{2}}{\sigma_{u}^{2}},\forall n\in\mathcal{N}, opt-DD converges to opt-D1D_{1}.

Proof:.

The condition implies

SNRuSNRn3σ NLoS2SNRuψSNRuSNRn+σ NLoS2SNRuψ3\displaystyle\tfrac{\text{SNR}_{u}}{\text{SNR}_{n}}\gg 3-\tfrac{\sigma_{\text{ NLoS}}^{2}\text{SNR}_{u}}{\psi}\Rightarrow\tfrac{\text{SNR}_{u}}{\text{SNR}_{n}}+\tfrac{\sigma_{\text{ NLoS}}^{2}\text{SNR}_{u}}{\psi}\gg 3
\displaystyle\Rightarrow ψSNRn+σ NLoS23ψSNRuσn23σu2,nN\displaystyle\tfrac{\psi}{\text{SNR}_{n}}+\sigma_{\text{ NLoS}}^{2}\gg\tfrac{3\psi}{\text{SNR}_{u}}\Rightarrow\tfrac{\sigma_{n}^{2}}{3}\gg\sigma_{u}^{2},~{}\forall n\in N
\displaystyle\Rightarrow σ12σ22σ323σ22σ32σu2,σ12σ22σ323σ12σ32σu2,σ12σ22σ323σ12σ22σu2.\displaystyle\tfrac{\sigma_{1}^{2}\sigma_{2}^{2}\sigma_{3}^{2}}{3}\gg\sigma_{2}^{2}\sigma_{3}^{2}\sigma_{u}^{2},\tfrac{\sigma_{1}^{2}\sigma_{2}^{2}\sigma_{3}^{2}}{3}\gg\sigma_{1}^{2}\sigma_{3}^{2}\sigma_{u}^{2},\tfrac{\sigma_{1}^{2}\sigma_{2}^{2}\sigma_{3}^{2}}{3}\gg\sigma_{1}^{2}\sigma_{2}^{2}\sigma_{u}^{2}. (21)

Summing up both sides of the three inequalities, we have

σ12σ22σ32(σ12σ32+σ12σ22+σ22σ32)σu2D1D2ψSNRu,\displaystyle\sigma_{1}^{2}\sigma_{2}^{2}\sigma_{3}^{2}\gg(\sigma_{1}^{2}\sigma_{3}^{2}+\sigma_{1}^{2}\sigma_{2}^{2}+\sigma_{2}^{2}\sigma_{3}^{2})\sigma_{u}^{2}\Leftrightarrow D_{1}\gg D_{2}\cdot\tfrac{\psi}{\text{SNR}_{u}}, (22)

which is a sufficient condition for opt-DD converging to opt-D1D_{1}. ∎

In practice, the random estimation error σ NLoS2\sigma_{\text{ NLoS}}^{2} could be larger than the noise variance of G2A channel σu2\sigma_{u}^{2}, and thus the condition for Lemma 1 is easily satisfied. In Fig. 4(a), we compare the two approximations and the opt-DD value with different ratios SNRuSNRn[102,10]\frac{\text{SNR}_{u}}{\text{SNR}_{n}}\in[10^{-2},10], and depict the values in a log scale. We observe that opt-D1D_{1} is much more accurate than opt-D2D_{2} within the considered ratio range. In Fig. 4(b), the opt-DD and opt-D1D_{1} values are almost on top with each other when the ratio is greater than 1, and the gap is less that 2% when the ratio is larger than 0.1. Therefore, we can safely adopt opt-D1D_{1} as an accurate approximation in the following analysis.

Refer to caption
(a) The logarithm of det(𝐑)\det(\mathbf{R}) versus the SNR ratio
Refer to caption
(b) opt-D1D_{1} and opt-DD
Figure 4: Approximations of opt-DD values

IV-B Equivalent Geometric Characterization

Firstly, we define the unit vector from the uu-th UAV to a location point 𝒎=[x0,y0,h0]\bm{m}=[x_{0},y_{0},h_{0}] as 𝒒u\bm{q}_{u}, and that from ground AN nn to 𝒎\bm{m} as 𝒒n\bm{q}_{n}, where

𝒒u\displaystyle\bm{q}_{u} =𝒃𝒖𝒎𝒃𝒖𝒎=[qu1,qu2,qu3],u𝒰,\displaystyle=\tfrac{\bm{b_{u}-m}}{||\bm{b_{u}-m}||}=[q_{u1},q_{u2},q_{u3}],\forall u\in\mathcal{U}, (23)
𝒒n\displaystyle\bm{q}_{n} =𝒃𝒏𝒎𝒃𝒏𝒎=[qn1,qn2,qn3],n𝒩.\displaystyle=\tfrac{\bm{b_{n}-m}}{||\bm{b_{n}-m}||}=[q_{n1},q_{n2},q_{n3}],\forall n\in\mathcal{N}. (24)

Then, 𝐇\mathbf{H} can be represented by the unit vectors

𝐇=[𝒒2𝒒1𝒒3𝒒1𝒒u𝒒1],\displaystyle\mathbf{H}=\begin{bmatrix}\bm{q}_{2}-\bm{q}_{1}\\ \bm{q}_{3}-\bm{q}_{1}\\ \bm{q}_{u}-\bm{q}_{1}\end{bmatrix}, (25)

and we explicitly express det(𝐇)\det(\mathbf{H}) using the elements in (15) such that

det(𝐇)=α1(xuax0𝒃u𝒎q11)+α2(yuay0𝒃u𝒎q12)+α3(huah0𝒃u𝒎q13),\displaystyle\det(\mathbf{H})=\alpha_{1}\left(\tfrac{x_{u}^{a}-x_{0}}{||\bm{b}_{u}-\bm{m}||}-q_{11}\right)+\alpha_{2}\left(\tfrac{y_{u}^{a}-y_{0}}{||\bm{b}_{u}-\bm{m}||}-q_{12}\right)+\alpha_{3}\left(\tfrac{h_{u}^{a}-h_{0}}{||\bm{b}_{u}-\bm{m}||}-q_{13}\right), (26)

where the coefficients αn\alpha_{n} for n=1,2,3n=1,2,3 are derived using (24)

α1\displaystyle\alpha_{1} =(q22q12)(q33q13)(q23q13)(q32q12),\displaystyle=(q_{22}-q_{12})(q_{33}-q_{13})-(q_{23}-q_{13})(q_{32}-q_{12}), (27)
α2\displaystyle\alpha_{2} =(q23q13)(q31q11)(q21q11)(q33q13),\displaystyle=(q_{23}-q_{13})(q_{31}-q_{11})-(q_{21}-q_{11})(q_{33}-q_{13}), (28)
α3\displaystyle\alpha_{3} =(q21q11)(q32q12)(q22q12)(q31q11).\displaystyle=(q_{21}-q_{11})(q_{32}-q_{12})-(q_{22}-q_{12})(q_{31}-q_{11}). (29)

The localization requirement opt-Dϵ\text{opt-}D\geq\epsilon with opt-D1D_{1} approximation in (19) becomes

det(𝐇)2D1ϵ.\displaystyle\tfrac{\det(\mathbf{H})^{2}}{D_{1}}\geq\epsilon. (30)

Based on the value of det(𝐇)\det(\mathbf{H}), we derive the implicit geometry of (30) in two cases.

IV-B1 Case 1

When det(𝐇)0\det(\mathbf{H})\geq 0, constraint (30) is equivalent to

α1(xuax0)+α2(yuay0)+α3(huah0)ϵ~1𝒃u𝒎,\displaystyle\alpha_{1}(x_{u}^{a}-x_{0})+\alpha_{2}(y_{u}^{a}-y_{0})+\alpha_{3}(h_{u}^{a}-h_{0})\geq\tilde{\epsilon}_{1}||\bm{b}_{u}-\bm{m}||, (31)

where ϵ~1=D1ϵ+α1q11+α2q12+α1q13\tilde{\epsilon}_{1}=\sqrt{D_{1}\epsilon}+\alpha_{1}q_{11}+\alpha_{2}q_{12}+\alpha_{1}q_{13}. The constraint (31) is a standard second-order cone constraint of dimension 4, and it is equivalent to

α1qu1+α2qu2+α3qu3ϵ~1.\displaystyle\alpha_{1}q_{u1}+\alpha_{2}q_{u2}+\alpha_{3}q_{u3}\geq\tilde{\epsilon}_{1}. (32)

Geometrically, the relative UAV location 𝒒u=[qu1,qu2,qu3]\bm{q}_{u}=[q_{u1},q_{u2},q_{u3}] that satisfies (32) can be viewed as the intersection of the sphere 𝕊={[x,y,h]:x2+y2+h2=1}\mathbb{S}=\{[x,y,h]\mathrel{\mathop{\ordinarycolon}}x^{2}+y^{2}+h^{2}=1\} and the half space ={[x,y,h]:α1x+α2y+α3hϵ~1}\mathbb{H}=\{[x,y,h]\mathrel{\mathop{\ordinarycolon}}\alpha_{1}x+\alpha_{2}y+\alpha_{3}h\geq\tilde{\epsilon}_{1}\}. The normal vector of the plane ={[x,y,h]:α1x+α2y+α3h=ϵ~1}\mathbb{P}=\{[x,y,h]\mathrel{\mathop{\ordinarycolon}}\alpha_{1}x+\alpha_{2}y+\alpha_{3}h=\tilde{\epsilon}_{1}\} is 𝒏=[α1,α2,α3]\bm{n}=[\alpha_{1},\alpha_{2},\alpha_{3}] and the perpendicular distance from the origin to the plane is ρ=|ϵ~1|α12+α22+α32\rho=\tfrac{|\tilde{\epsilon}_{1}|}{\sqrt{\alpha_{1}^{2}+\alpha_{2}^{2}+\alpha_{3}^{2}}}. The intersecting circle has radius r=1ρ2r=\sqrt{1-\rho^{2}} and its center is

𝒄0=ρ𝒏𝒏=ρ[α1,α2,α3]α12+α22+α32=|ϵ~1|α12+α22+α32[α1,α2,α3].\displaystyle\bm{c}_{0}=\rho\tfrac{\bm{n}}{||\bm{n}||}=\rho\tfrac{[\alpha_{1},\alpha_{2},\alpha_{3}]}{\sqrt{\alpha_{1}^{2}+\alpha_{2}^{2}+\alpha_{3}^{2}}}=\tfrac{|\tilde{\epsilon}_{1}|}{\alpha_{1}^{2}+\alpha_{2}^{2}+\alpha_{3}^{2}}[\alpha_{1},\alpha_{2},\alpha_{3}]. (33)

For the sphere and plane to have an intersection, it must hold that ρ1\rho\leq 1, i.e., |ϵ~1|α12+α22+α32|\tilde{\epsilon}_{1}|\leq\sqrt{\alpha_{1}^{2}+\alpha_{2}^{2}+\alpha_{3}^{2}}. Accordingly, we establish in the following proposition a condition to check the feasibility of localization requirement.

Proposition 1.

When det(𝐇)0\det(\mathbf{H})\geq 0, the localization requirement for UE at 𝒎\bm{m} is feasible if and only if the value of ϵ\epsilon satisfies

0ϵ(c1c2)2D1,\displaystyle 0\leq\epsilon\leq\tfrac{\left(c_{1}-c_{2}\right)^{2}}{D_{1}}, (34)

where c1c_{1} and c2c_{2} are given by

c1=α12+α22+α32,c2=α1q11+α2q12+α3q13.\displaystyle c_{1}=\sqrt{\alpha_{1}^{2}+\alpha_{2}^{2}+\alpha_{3}^{2}},\quad c_{2}=\alpha_{1}q_{11}+\alpha_{2}q_{12}+\alpha_{3}q_{13}. (35)
Proof:.

Please see the detailed proof in Appendix A. ∎

Refer to caption
(a) 𝒎=(250,135,10)\bm{m}=(250,135,10)
Refer to caption
(b) 𝒎=(100,50,10)\bm{m}=(100,50,10)
Refer to caption
(c) 𝒎=(0,10,10)\bm{m}=(0,10,10)
Figure 5: Feasibility of different location points under ϵ=8×103\epsilon=8\times 10^{-3}

Proposition 1 shows that by setting a reasonably small ϵ\epsilon specified by (34), we can always find a UAV location to satisfy the localization accuracy requirement. Otherwise, if ϵ\epsilon is beyond the range, it could be the case that no UAV placement can achieve the required accuracy level. Fig. 5 showcases that the feasibility of different UE location points under the same settings. For UE location (250,135,10)(250,135,10), the localization requirement is feasible when ϵ0.12\epsilon\leq 0.12; for UE location (100,50,10)(100,50,10), it is feasible when ϵ0.081\epsilon\leq 0.081; for UE location (0,10,10)(0,10,10), it is feasible when ϵ7.7×103\epsilon\leq 7.7\times 10^{-3}. As shown in Fig. 5, under the same ϵ=8×103\epsilon=8\times 10^{-3}, the sphere and the plane has intersection for UE locations (250,135,10)(250,135,10) and (100,50,10)(100,50,10), which means that the localization requirement is feasible for some UAV deployment solution. In Fig. 5(c), the sphere and the plane has no intersection, showing that no UAV deployment can satisfy the localization accuracy requirement for UE location (0,10,10)(0,10,10) when ϵ=8×103\epsilon=8\times 10^{-3}. Proposition 1 provides a convenient method to set a proper ϵ\epsilon for the constraint (17b) to be feasible. Suppose that all the localization constraints (17b) are feasible by Proposition 1. We continue to derive in the following proposition the feasible UAV hovering region for (17b) assuming the UAV flies at a fixed altitude hfh_{f}.

Proposition 2.

For a fixed altitude hfh_{f}, the the localization constraint (30) is satisfied if and only if the UAV 𝒃u=[xua,yua,hf]\bm{b}_{u}=[x^{a}_{u},y^{a}_{u},h_{f}] lies within an ellipse defined by the following polynomial equation

1:\displaystyle\mathcal{E}^{1}\mathrel{\mathop{\ordinarycolon}}\quad (α12ϵ~121)(xuax0)2+2α1α2ϵ~12(xuax0)(yuay0)+(α22ϵ~121)(yuay0)2\displaystyle(\tfrac{\alpha_{1}^{2}}{\tilde{\epsilon}_{1}^{2}}-1)(x_{u}^{a}-x_{0})^{2}+\tfrac{2\alpha_{1}\alpha_{2}}{\tilde{\epsilon}_{1}^{2}}(x_{u}^{a}-x_{0})(y_{u}^{a}-y_{0})+(\tfrac{\alpha_{2}^{2}}{\tilde{\epsilon}_{1}^{2}}-1)(y_{u}^{a}-y_{0})^{2}
+2α1α3hrϵ~12(xuax0)+2α2α3hrϵ~12(yuay0)+(α32ϵ~121)hr2=0,\displaystyle+\tfrac{2\alpha_{1}\alpha_{3}h_{r}}{\tilde{\epsilon}_{1}^{2}}(x_{u}^{a}-x_{0})+\tfrac{2\alpha_{2}\alpha_{3}h_{r}}{\tilde{\epsilon}_{1}^{2}}(y_{u}^{a}-y_{0})+(\tfrac{\alpha_{3}^{2}}{\tilde{\epsilon}_{1}^{2}}-1)h_{r}^{2}=0, (36)

where hr=hfh0h_{r}=h_{f}-h_{0} is the relative altitude. The center 𝒄1e\bm{c}_{1}^{e} of the ellipse, the rotation angle θ1\theta_{1}, the semi-major axis l1al_{1}^{a} and the semi-minor axis l1il_{1}^{i} are respectively given by

𝒄1e=[α1α3hrϵ~12α12α22+x0,α2α3hrϵ~12α12α22+y0,hf],θ1\displaystyle\bm{c}_{1}^{e}=[\tfrac{\alpha_{1}\alpha_{3}h_{r}}{\tilde{\epsilon}_{1}^{2}-\alpha_{1}^{2}-\alpha_{2}^{2}}+x_{0},\tfrac{\alpha_{2}\alpha_{3}h_{r}}{\tilde{\epsilon}_{1}^{2}-\alpha_{1}^{2}-\alpha_{2}^{2}}+y_{0},h_{f}],\quad\theta_{1} =arctan(α1α2),\displaystyle=\arctan(-\tfrac{\alpha_{1}}{\alpha_{2}}), (37)
l1a=hr2(c12ϵ~12)ϵ~12α12α22,l1i=hrϵ~1c12ϵ~12ϵ~12α12α22.\displaystyle l_{1}^{a}=\sqrt{\tfrac{h_{r}^{2}(c_{1}^{2}-\tilde{\epsilon}_{1}^{2})}{\tilde{\epsilon}_{1}^{2}-\alpha_{1}^{2}-\alpha_{2}^{2}}},\quad l_{1}^{i}=\tfrac{h_{r}\tilde{\epsilon}_{1}\sqrt{c_{1}^{2}-\tilde{\epsilon}_{1}^{2}}}{\tilde{\epsilon}_{1}^{2}-\alpha_{1}^{2}-\alpha_{2}^{2}}. (38)
Proof.

We substitute hua=hfh_{u}^{a}=h_{f} to let the equality in (31) hold. Then, we square both sides of (31) and reformulate it into (2). For an ellipse with the general form

Ax2+Bxy+Cy2+Dx+Ey+F=0,\displaystyle Ax^{2}+Bxy+Cy^{2}+Dx+Ey+F=0, (39)

its center 𝒄e\bm{c}^{e}, rotation angle θr\theta^{r}, semi-major axis lal^{a} and semi-minor axis lil^{i} are given by

𝒄e=[2CDBEB24AC,2AEBDB24AC],θr=arctan(CA(AC)2+B2B),\displaystyle\bm{c}^{e}=[\tfrac{2CD-BE}{B^{2}-4AC},\tfrac{2AE-BD}{B^{2}-4AC}],\quad\theta^{r}=\arctan\left(\tfrac{C-A-\sqrt{(A-C)^{2}+B^{2}}}{B}\right), (40)
la,li=2(AE2+CD2BDE+(B24AC)F)((A+C)±(AC)2+B2)B24AC.\displaystyle l^{a},l^{i}=\tfrac{-\sqrt{2\left(AE^{2}+CD^{2}-BDE+(B^{2}-4AC)F\right)\left((A+C)\pm\sqrt{(A-C)^{2}+B^{2}}\right)}}{B^{2}-4AC}. (41)

By substituting (2) into (39)-(41), we obtain (37) and (38). ∎

Refer to caption
(a) 3D intersection of plane h=hfh=h_{f} and cone (31)
Refer to caption
(b) 2D projection of feasible region
Figure 6: Intersections of hf=100h_{f}=100 and the extended cone when 𝒎=(100,50,10)\bm{m}=(100,50,10)

Fig. 6(a) shows the 3D intersection of the extended cone and the plane at hf=100h_{f}=100 m when 𝒎=(100,50,10)\bm{m}=(100,50,10). Fig. 6(b) shows the 2D projection of the feasible UAV hovering region. We also denote the center, the rotation angle, the semi-major axis and the semi-minor axis of the ellipse in Fig. 6(b). In Fig. 6(a), the UAV must be placed within the cone to satisfy the localization performance constraint. In Fig. 6(b), given a fixed altitude, the UAV must be placed within the eclipse to meet the localization requirement. Although we derive the feasible hovering region for any given hfh_{f} in Proposition 2, the distance between UAV and point 𝒎\bm{m} cannot be too large for two reasons. Firstly, when hfh_{f} is too large, the ellipse and its center defined in (2) and (37) could deviate from the UAV restricted area 𝒜\mathcal{A}. In this case, we cannot find a feasible UAV location in 𝒜\mathcal{A}. Secondly, the strength of localization signal from UAV to UE becomes very weak when the distance is too large, and thus the condition for an accurate opt-D1D_{1} approximation no longer holds.

IV-B2 Case 2

When det(𝐇)<0\det(\mathbf{H})<0, constraint (30) is equivalent to

α1(xuax0)+α2(yuay0)+α3(huah0)<ϵ~2𝒃u𝒎,\displaystyle\alpha_{1}(x_{u}^{a}-x_{0})+\alpha_{2}(y_{u}^{a}-y_{0})+\alpha_{3}(h_{u}^{a}-h_{0})<\tilde{\epsilon}_{2}||\bm{b}_{u}-\bm{m}||, (42)

where ϵ~2=D1ϵ+α1q11+α2q12+α1q13\tilde{\epsilon}_{2}=-\sqrt{D_{1}\epsilon}+\alpha_{1}q_{11}+\alpha_{2}q_{12}+\alpha_{1}q_{13}. Similar to the first case, constraint (42) is a standard second-order cone constraint.

Proposition 3.

When det(𝐇)<0\det(\mathbf{H})<0, the localization requirement for UE at 𝒎\bm{m} is feasible if and only if ϵ\epsilon satisfies

0ϵ(c1+c2)2D1,\displaystyle 0\leq\epsilon\leq\tfrac{\left(c_{1}+c_{2}\right)^{2}}{D_{1}}, (43)

where c1c_{1} and c2c_{2} are the same as in (35).

Proof:.

The proof is similar to that of Proposition 1, and thus we omit it here. ∎

Proposition 4.

For a fixed altitude hfh_{f}, the the localization constraint (42) is satisfied if and only if the UAV 𝒃u=[xua,yua,hf]\bm{b}_{u}=[x^{a}_{u},y^{a}_{u},h_{f}] lies within an ellipse defined by the following polynomial equation

2:\displaystyle\mathcal{E}^{2}\mathrel{\mathop{\ordinarycolon}}\quad (α12ϵ~221)(xuax0)2+2α1α2ϵ~22(xuax0)(yuay0)+(α22ϵ~221)(yuay0)2\displaystyle(\tfrac{\alpha_{1}^{2}}{\tilde{\epsilon}_{2}^{2}}-1)(x_{u}^{a}-x_{0})^{2}+\tfrac{2\alpha_{1}\alpha_{2}}{\tilde{\epsilon}_{2}^{2}}(x_{u}^{a}-x_{0})(y_{u}^{a}-y_{0})+(\tfrac{\alpha_{2}^{2}}{\tilde{\epsilon}_{2}^{2}}-1)(y_{u}^{a}-y_{0})^{2}
+2α1α3hrϵ~22(xuax0)+2α2α3hrϵ~22(yuay0)+(α32ϵ~221)hr2=0.\displaystyle+\tfrac{2\alpha_{1}\alpha_{3}h_{r}}{\tilde{\epsilon}_{2}^{2}}(x_{u}^{a}-x_{0})+\tfrac{2\alpha_{2}\alpha_{3}h_{r}}{\tilde{\epsilon}_{2}^{2}}(y_{u}^{a}-y_{0})+(\tfrac{\alpha_{3}^{2}}{\tilde{\epsilon}_{2}^{2}}-1)h_{r}^{2}=0. (44)

The center 𝒄2e\bm{c}_{2}^{e} of the ellipse, the rotation angle θ2\theta_{2}, the semi-major axis l2al_{2}^{a} and the semi-minor axis l2il_{2}^{i} are respectively given by

𝒄2e=[α1α3hrϵ~22α12α22+x0,α2α3hrϵ~22α12α22+y0,hf],θ2\displaystyle\bm{c}_{2}^{e}=[\tfrac{\alpha_{1}\alpha_{3}h_{r}}{\tilde{\epsilon}_{2}^{2}-\alpha_{1}^{2}-\alpha_{2}^{2}}+x_{0},\tfrac{\alpha_{2}\alpha_{3}h_{r}}{\tilde{\epsilon}_{2}^{2}-\alpha_{1}^{2}-\alpha_{2}^{2}}+y_{0},h_{f}],\quad\theta_{2} =arctan(α1α2),\displaystyle=\arctan(-\tfrac{\alpha_{1}}{\alpha_{2}}), (45)
l2a=hr2(c12ϵ~22)ϵ~22α12α22,l2i=hrϵ~2c12ϵ~22ϵ~22α12α22.\displaystyle l_{2}^{a}=\sqrt{\tfrac{h_{r}^{2}(c_{1}^{2}-\tilde{\epsilon}_{2}^{2})}{\tilde{\epsilon}_{2}^{2}-\alpha_{1}^{2}-\alpha_{2}^{2}}},\quad l_{2}^{i}=\tfrac{h_{r}\tilde{\epsilon}_{2}\sqrt{c_{1}^{2}-\tilde{\epsilon}_{2}^{2}}}{\tilde{\epsilon}_{2}^{2}-\alpha_{1}^{2}-\alpha_{2}^{2}}. (46)
Proof.

By substituting (4) into (39)-(41), we obtain (45) and (46). ∎

In general, the overall feasible hovering region of a UAV can be specified by the union of two eclipses in Proposition 2 and 4, or just one of them. To simplify the algorithm design to solve 𝒫1\mathcal{P}1 in the next section, we prove in the following corollary that we can set a proper value ϵ\epsilon for each UE such that the feasible hovering region of the UAV is specified by only one of the two eclipses in (2) and (4).

Corollary 1.

By setting ϵ\epsilon such that |c3|c2||D1ϵc3+|c2|\left|c_{3}-|c_{2}|\right|\leq\sqrt{D_{1}\epsilon}\leq c_{3}+|c_{2}| with c3=α12+α22c_{3}=\sqrt{\alpha_{1}^{2}+\alpha_{2}^{2}}, the feasible hovering region of the UAV is 1\mathcal{E}^{1} in (2) if c20c_{2}\geq 0. Otherwise, it is 2\mathcal{E}^{2} in (4) if c2<0c_{2}<0.

Proof:.

Please see the detailed proof in Appendix B. ∎

V Proposed Solution

By replacing the opt-DD value with opt-D1D_{1}, we transfer 𝒫1\mathcal{P}1 into the following optimization problem

𝒫2:\displaystyle\mathcal{P}2\mathrel{\mathop{\ordinarycolon}}\quad min{𝒃u}u𝒰|𝒰|,\displaystyle\min_{\{\bm{b}_{u}\}_{u\in\mathcal{U}}}\quad|\mathcal{U}|, (47a)
s.t. max{𝒃u}u𝒰opt-D1(𝒎k,𝒃u)ϵ,k𝒦,\displaystyle\max_{\{\bm{b}_{u}\}_{u\in\mathcal{U}}}~{}\text{opt-}D_{1}(\bm{m}_{k},\bm{b}_{u})\geq\epsilon,\forall k\in\mathcal{K}, (47b)
maxn𝒰𝒩RknRkth,k𝒦,\displaystyle\max_{n\in\mathcal{U}\cup\mathcal{N}}~{}R_{kn}\geq R_{k}^{th},\forall k\in\mathcal{K}, (47c)
𝒃u𝒜,u𝒰.\displaystyle\bm{b}_{u}\in\mathcal{A},\forall u\in\mathcal{U}. (47d)

In this section, we propose a low-complexity algorithm to solve 𝒫2\mathcal{P}2. In addition to the feasible localization regions specified by Corollary 1, we also need to determine the feasible UAV region to meet communication requirements. According to the communication rate of G2A channel in (4), the communication requirement for UEs is equivalent to

𝒃u𝒎kαPk^(LoS,θku)WkuN0γ0(2Rkth/Wku1).\displaystyle||\bm{b}_{u}-\bm{m}_{k}||^{\alpha}\leq\tfrac{P_{k}\hat{\mathbb{P}}(LoS,\theta_{ku})}{W_{ku}N_{0}\gamma_{0}(2^{R_{k}^{th}/W_{ku}}-1)}. (48)

Because ^(LoS,θku)\hat{\mathbb{P}}(LoS,\theta_{ku}) is also a function of 𝒃u𝒎k||\bm{b}_{u}-\bm{m}_{k}||, it is difficult to depict (48) in graph. To efficiently characterize the feasible region, we restrict the communication requirement by finding a θ^ku\hat{\theta}_{ku} such that it is irrelevant to 𝒃u𝒎k||\bm{b}_{u}-\bm{m}_{k}|| and satisfies ^(LoS,θ^ku)^(LoS,θku)\hat{\mathbb{P}}(LoS,\hat{\theta}_{ku})\leq\hat{\mathbb{P}}(LoS,\theta_{ku}).

Proposition 5.

Let

θ^ku=180πarcsin(|hfhk|(WkuN0γ0(2Rkth/Wku1)Pk)1α),\displaystyle\hat{\theta}_{ku}=\tfrac{180}{\pi}\arcsin\left(|h_{f}-h_{k}|\big{(}\tfrac{W_{ku}N_{0}\gamma_{0}(2^{R_{k}^{th}/W_{ku}}-1)}{P_{k}}\big{)}^{\frac{1}{\alpha}}\right), (49)

it holds that ^(LoS,θ^ku)^(LoS,θku),θku[0,90]\hat{\mathbb{P}}(LoS,\hat{\theta}_{ku})\leq\hat{\mathbb{P}}(LoS,\theta_{ku}),\forall\theta_{ku}\in[0^{\circ},90^{\circ}].

Proof:.

Please see the detailed proof in Appendix C. ∎

Then, the restricted communication requirement of UE kk in G2A channels becomes

𝒃u𝒎k(Pk^(LoS,θ^ku)WkuN0γ0(2Rkth/Wku1))1α.\displaystyle||\bm{b}_{u}-\bm{m}_{k}||\leq\left(\tfrac{P_{k}\hat{\mathbb{P}}(LoS,\hat{\theta}_{ku})}{W_{ku}N_{0}\gamma_{0}(2^{R_{k}^{th}/W_{ku}}-1)}\right)^{\frac{1}{\alpha}}. (50)

Notice that (48) is automatically satisfied if (50) holds. Recall that the communication rate of G2G channel is RknR_{kn} in (6). Then, BS nn can meet the communication requirement of UE kk if its location satisfies

𝒃n𝒎k(F1(ε)PkWknN0γ0(2Rkth/Wku1))1β.\displaystyle||\bm{b}_{n}-\bm{m}_{k}||\leq\left(\tfrac{F^{-1}(\varepsilon)P_{k}}{W_{kn}N_{0}\gamma_{0}(2^{R_{k}^{th}/W_{ku}}-1)}\right)^{\frac{1}{\beta}}. (51)

Given a fixed altitude hfh_{f}, the feasible region of opt-D1(𝒎k,𝒃u)ϵ\text{opt-}D_{1}(\bm{m}_{k},\bm{b}_{u})\geq\epsilon is an ellipse denoted by k\mathcal{E}_{k} and the feasible region of the communication requirement is a circle denoted by 𝒞k\mathcal{C}_{k}. We define a region set \mathcal{R} as =k=1K(𝒞kk)\mathcal{R}=\bigcup_{k=1}^{K}(\mathcal{C}_{k}\cup\mathcal{E}_{k}), which includes all feasible regions of the communication and localization requirements. Firstly, we consider the communication requirement of each UE. If the location of UE kk satisfies (51), BS nn can already serve UE kk’s communication demand. We denote the UEs served by BSs as 𝒦BS\mathcal{K}_{BS} and their corresponding circles as 𝒞BS=k𝒦BS𝒞k\mathcal{C}_{BS}=\bigcup_{k\in\mathcal{K}_{BS}}\mathcal{C}_{k}. Then, when considering the placement of UAVs, we can exclude 𝒞BS\mathcal{C}_{BS} from \mathcal{R}. Therefore, the new set becomes new=\𝒞BS\mathcal{R}_{new}=\mathcal{R}\backslash\mathcal{C}_{BS}. Our goal is to select a minimum-size subset ={𝒃u}u𝒰\mathcal{M}=\{\bm{b}_{u}\}_{u\in\mathcal{U}} of points such that every region in new\mathcal{R}_{new} has nonempty intersection with \mathcal{M},. We recognize this as a classical minimum hitting set (MHS) problem, and summarize the solution algorithm to UAV deployment in Algorithm 1.

Algorithm 1 Solution algorithm to UAV deployment
1:Input: The UE locations {𝒎k}k=1K\{\bm{m}_{k}\}_{k=1}^{K}; the fixed UAV altitude hfh_{f};
2:Output: The required number of UAVs |𝒰||\mathcal{U}|; the UAV locations ={𝒃u}u𝒰\mathcal{M}=\{\bm{b}_{u}\}_{u\in\mathcal{U}}
3:Initialization: transmission power, bandwidth, RkthR_{k}^{th}, ϵk\epsilon_{k}, 𝒦BS=\mathcal{K}_{BS}=\varnothing,=\mathcal{R}=\varnothing;
4:Use Proposition 1 and 3 to check feasibility; otherwise, use Proposition 5 to adjust the values of ϵk\epsilon_{k};
5:for k=1k=1 to KK do
6:   Obtain 𝒞k\mathcal{C}_{k} according to (50) and determine k\mathcal{E}_{k} using (2) or (4);
7:   =𝒞kk\mathcal{R}=\mathcal{R}\cup\mathcal{C}_{k}\cup\mathcal{E}_{k};
8:   if 𝒎k\bm{m}_{k} satisfies (51)  then
9:      𝒦BS=𝒦BS{k}\mathcal{K}_{BS}=\mathcal{K}_{BS}\cup\{k\}; 𝒞BS=𝒞BS{𝒞k}\mathcal{C}_{BS}=\mathcal{C}_{BS}\cup\{\mathcal{C}_{k}\};
10:   end if
11:end for
12:Obtain new=\𝒞BS\mathcal{R}_{new}=\mathcal{R}\backslash\mathcal{C}_{BS};
13:Obtain |𝒰|,|\mathcal{U}|,\mathcal{M} by solving the MHS problem for new\mathcal{R}_{new};
14:Return: |𝒰|,|\mathcal{U}|,\mathcal{M}

The MHS problem can be equivalently transferred into an integer liner programming (ILP) problem. The restricted area 𝒜\mathcal{A} is first discretized into a set of grid points 𝒢={𝒈1,𝒈2,,𝒈L}\mathcal{G}=\{\bm{g}_{1},\bm{g}_{2},...,\bm{g}_{L}\}, which are candidates for the deployment of UAVs. Given the candidate UAV points and the new\mathcal{R}_{new}, we use a binary variable vij=1v_{ij}=1 to denote that a grid point 𝒈i\bm{g}_{i} is in set element SjnewS_{j}\in\mathcal{R}_{new}, where SjS_{j} could be a circle or an ellipse region. Otherwise, we set vijv_{ij} to be zero. Then, the ILP problem is formulated as

𝒫3:minvij\displaystyle\mathcal{P}3\mathrel{\mathop{\ordinarycolon}}\quad\min_{v_{ij}}\quad i=1Lj=1|new|vij\displaystyle\sum_{i=1}^{L}\sum_{j=1}^{|\mathcal{R}_{new}|}v_{ij} (52a)
s.t. i=1Lvij1,Sjnew.\displaystyle\sum_{i=1}^{L}v_{ij}\geq 1,\forall S_{j}\in\mathcal{R}_{new}. (52b)

We explain the ILP problem using a simple case with two UEs as shown in Fig. 7. The red circles are the feasible communication regions and the blue ellipses are the feasible localization regions. Therefore, the region set is new={𝒞1,𝒞2,1,2}\mathcal{R}_{new}=\{\mathcal{C}_{1},\mathcal{C}_{2},\mathcal{E}_{1},\mathcal{E}_{2}\}. The small blue triangles are the candidate points 𝒢={𝒈1,𝒈2,,𝒈6}\mathcal{G}=\{\bm{g}_{1},\bm{g}_{2},...,\bm{g}_{6}\} to deploy the UAVs.333The candidate points are randomly selected in space for illustration. In practice, the candidate points could be predetermined or calculated based on environment conditions and parameters. The ILP problem becomes

minvij\displaystyle\min_{v_{ij}}\quad i=16j=14vij\displaystyle\sum_{i=1}^{6}\sum_{j=1}^{4}v_{ij} (53a)
s.t. i=16vij1,Sj{𝒞1,𝒞2,1,2},\displaystyle\sum_{i=1}^{6}v_{ij}\geq 1,\forall S_{j}\in\{\mathcal{C}_{1},\mathcal{C}_{2},\mathcal{E}_{1},\mathcal{E}_{2}\}, (53b)

and the optimal solution is to deploy two UAVs at 𝒈1\bm{g}_{1} and 𝒈4\bm{g}_{4}. By doing so, all the four circles/eclipses are hit by the two points.

Refer to caption
Figure 7: Explanation with two UEs

The ILP problem is NP-hard and requires high computational complexity to obtain the optimal solution. Thus, we propose a Depth-first (DF) algorithm to solve the minimum hitting set problem. Firstly, we define the depth of point 𝒈l\bm{g}_{l} as Δl\Delta_{l}, which is equal to the number of regions containing point 𝒈l\bm{g}_{l}, i.e., |l||\mathcal{R}_{l}|. Then, we select the grid point with the largest depth as the first UAV location. We remove the regions containing 𝒈l\bm{g}_{l} and update the depth of grid points. The procedure is repeated until all regions are covered by at least one UAV. We use Fig. 7 to illustrate the algorithm. To start with, we observe that 𝒈1\bm{g}_{1}, 𝒈3\bm{g}_{3} and 𝒈4\bm{g}_{4} have the largest depth 2. Suppose that we firstly select 𝒈1\bm{g}_{1} in \mathcal{M}. Since 𝒈1\bm{g}_{1} is in 𝒞1\mathcal{C}_{1} and 1\mathcal{E}_{1}, we remove these two regions from new\mathcal{R}_{new} and update the depth of grid points. Then, we see that 𝒈4\bm{g}_{4} has the largest depth as it is inside the regions 𝒞2\mathcal{C}_{2} and 2\mathcal{E}_{2}. Therefore, we find out that the solution is to deploy UAVs at 𝒈1\bm{g}_{1} and 𝒈4\bm{g}_{4}. Nonetheless, the proposed solution may lead to suboptimal solution, e.g., selecting 𝒈3\bm{g}_{3} in the first step would lead to deploy 3 UAVs at 𝒈1\bm{g}_{1}, 𝒈3\bm{g}_{3} and 𝒈4\bm{g}_{4}. Still, we can improve the performance by executing the algorithm multiple times using randomized selection method and selecting the one produces the best solution.

The computation complexity of Algorithm 2 is 𝒪(LK+K2)\mathcal{O}(LK+K^{2}), where LL is the number of grid points and KK is the number of UEs. The complexity can be further reduced by removing points not in any regions, i.e., Δl=0\Delta_{l}=0, and the number of candidate points would be significantly deducted. The DF algorithm is summarized in Algorithm 2.

Algorithm 2 Depth-first algorithm
1:Input: new\mathcal{R}_{new}, grid points 𝒢={𝒈1,𝒈2,,𝒈L}\mathcal{G}=\{\bm{g}_{1},\bm{g}_{2},...,\bm{g}_{L}\} ;
2:Output: |𝒰|,|\mathcal{U}|,\mathcal{M};
3:Initialization: =\mathcal{M}=\varnothing;
4:repeat
5:   for l=1l=1 to LL do
6:      Find all regions in new\mathcal{R}_{new} containing point 𝒈l\bm{g}_{l} and store them into l\mathcal{R}_{l};
7:      The depth of point 𝒈l\bm{g}_{l} is Δl=|l|\Delta_{l}=|\mathcal{R}_{l}|;
8:   end for
9:   Find one 𝒈l\bm{g}_{l} with the largest depth Δl\Delta_{l};
10:   ={𝒈l}\mathcal{M}=\mathcal{M}\cup\{\bm{g}_{l}\};
11:   Remove the regions containing 𝒈l\bm{g}_{l} from new\mathcal{R}_{new}, new=new\{Si|Si𝒈l,Sinew}\mathcal{R}_{new}=\mathcal{R}_{new}\backslash\{S_{i}|S_{i}\ni\bm{g}_{l},\forall S_{i}\in\mathcal{R}_{new}\};
12:until new=\mathcal{R}_{new}=\varnothing
13:|𝒰|=|||\mathcal{U}|=|\mathcal{M}|;
14:Return: |𝒰|,|\mathcal{U}|,\mathcal{M};

VI Simulation Results

TABLE I: Simulation Parameters
System Parameters Value System Parameters Value
Main frequency, fcf_{c} 2.1 GHz Free space path loss at 1 m, γ0\gamma_{0} 38.89 dB
Noise power spectral density, N0N_{0} -174 dbm/Hz Reference signal bandwidth, WW 180 kHz
G2A path loss exponent, α\alpha 2 G2G path loss exponent, β\beta 2.2
Transmission power of the BSs, PnP_{n} 1 W Transmission power of the UAV, PuP_{u} 1 W
Transmission power of the UEs, PkP_{k} 0.01 W UE uplink transmission bandwidth, Wku,WknW_{ku},W_{kn} 180 kHz
Maximum tolerable outage probability ε\varepsilon 0.1 Inverse of the CDF, F1(ε)F^{-1}(\varepsilon) 0.11
Environmental parameter, aa 15 Environmental parameter, bb 0.5
Symbol duration of the OFDM signal, TsT_{s} 11.5×104\tfrac{1}{1.5\times 10^{4}} s Number of subframes containing NPRS 160
Location of BS 1, 𝒃1\bm{b}_{1} [100,100,30][100,100,30] Location of BS 2, 𝒃2\bm{b}_{2} [250,433,30][250,433,30]
Location of BS 3, 𝒃3\bm{b}_{3} [500,250,30][500,250,30]

In this section, we conduct simulation experiments to verify our analysis and evaluate the performance of our proposed algorithm. The simulation parameters are summarized in Table I unless otherwise stated. We compare our proposed algorithm with the following benchmark methods:

VI-1 Integer Linear Programming (ILP) Method

The ILP problem 𝒫3\mathcal{P}3 is NP-hard and requires high computational complexity to obtain the optimal solution. We use the solution of ILP method as baseline to evaluate the performance of our proposed method.

VI-2 Communication First Method

In this method, we firstly deploy the UAVs the satisfy the communication requirements of all UEs. The deployed UAVs can satisfy the localization requirements of some UEs. Afterwards, we deploy additional UAVs to meet the localization demands of the remaining UEs.

VI-3 Spiral Searching Method

In [13], the authors proposed a polynomial-time algorithm to sequentially deploy the UAVs along a spiral path toward the center to provide wireless communication coverage to ground users. Similarly, we deploy the UAVs to satisfy the communication and localization requirements of all UEs along a simplified spiral path shown in Fig. 8(a).

VI-4 Strip Searching Method

In [30], the authors proposed a near-linear-time approximation algorithm for the hitting set problem under specific geometric settings. The main idea is to use vertical decomposition to obtain overlapping regions. We adopt the strip searching as a benchmark method, which deploys the UAVs in the sequence shown in Fig. 8(b) from left to right.

Refer to caption
(a) Spiral searching method
Refer to caption
(b) Strip searching method
Figure 8: Heuristic searching methods
Refer to caption
(a) DF algorithm
Refer to caption
(b) ILP method
Refer to caption
(c) Communication first
Refer to caption
(d) Spiral Searching
Refer to caption
(e) Strip Searching
Figure 9: Placement of UAVs under different methods

Fig. 9 shows the required numbers and the placements of UAVs under different methods for 10 UEs. The localization accuracy requirement ϵk\epsilon_{k} is randomly selected from the range specified by Corollary 1 to ensure feasibility. The communication requirement is randomly chosen from 3Rkth53\leq R_{k}^{th}\leq 5 Mbps. Each UE is associated with one circular region (red circle) to meet the communication performance and an elliptical region (blue ellipse) to meet the localization performance. The dashed black circles are the communication coverage of the three BSs. As long as there is a UAV hovering in its corresponding blue area, its localization accuracy requirement is satisfied. Likewise, as long as there is a UAV or ground base station in the red area, the communication requirement can be satisfied. As shown in Fig. 9, the ILP method and the proposed DF method achieve the minimal number of UAVs, which is 8 in this scenario. The spiral searching method and the strip searching method require 13 UAVs and 10 UAVs, respectively. The communication first method requires 14 UAVs, which is the largest among all methods. Although we use the approximation opt-D1D_{1} values to determine the feasible localization regions, we find that the obtained UAV locations always satisfy the original localization requirement (17b) in opt-DD values.

Refer to caption
Figure 10: UAV number v.s. UE number under different methods

In Fig. 10, we show the average required number of UAVs under all methods from 2 UEs to 40 UEs. Each sample point is the average of 100 simulation runs. The ILP method attains the optimal solutions and provides the baseline for comparison. As shown in Fig. 10, the DF method is the closest to the ILP method. The communication first method and the spiral searching method require more than twice the optimal UAV numbers. The reason is that these methods are based on the communication coverage method. Therefore, they are not suitable for the UAV deployment for joint communication and localization scenarios. The performance of the strip searching method is slightly better than these two methods, which requires less than twice the optimal UAV numbers. When the number of UEs is 40, the average UAV number of the ILP method is 16.716.7. The DF method on average needs 1.951.95 more UAVs than the ILP method, while the strip searching method, the spiral searching method and the communication first method require 12.5612.56, 17.7717.77 and 18.9818.98 more UAVs, respectively.

VII Conclusion

In this paper, we investigate the optimization problem of deploying the minimal number of UAVs in feasible regions to satisfy the communication and localization requirements of the ground users. We compare the localization performance of the UAV-assisted air-ground cooperative ILAC scheme and the conventional scheme using only terrestrial networks. We observe that the scheme with UAVs can greatly improve the localization accuracy in both horizontal and vertical directions. By adopting DD-optimality as the localization performance metric, we derive the closed-form expression and the spatial characteristics of the feasible UAV hovering regions. We solve the deployment problem by transforming the problem into a geometric minimum hitting set problem, and propose a low-complexity sub-optimal algorithm to solve it. We compare our proposed algorithm with benchmark methods. The number of UAVs required by the proposed algorithm is close to the optimal number, while the other benchmark methods require much more UAVs.

Appendix A Proof of Proposition 1

With c1=α12+α22+α32c_{1}=\sqrt{\alpha_{1}^{2}+\alpha_{2}^{2}+\alpha_{3}^{2}} and c2=α1q11+α2q12+α3q13c_{2}=\alpha_{1}q_{11}+\alpha_{2}q_{12}+\alpha_{3}q_{13}, we have |c2|c1|c_{2}|\leq c_{1} according to Cauchy-Schwartz inequality:

|α1q11+α2q12+α3q13|α12+α22+α32q112+q122+q132\displaystyle|\alpha_{1}q_{11}+\alpha_{2}q_{12}+\alpha_{3}q_{13}|\leq\sqrt{\alpha_{1}^{2}+\alpha_{2}^{2}+\alpha_{3}^{2}}\cdot\sqrt{q_{11}^{2}+q_{12}^{2}+q_{13}^{2}}
α12+α22+α32𝒒1=α12+α22+α32.\displaystyle\leq\sqrt{\alpha_{1}^{2}+\alpha_{2}^{2}+\alpha_{3}^{2}}||\bm{q}_{1}||=\sqrt{\alpha_{1}^{2}+\alpha_{2}^{2}+\alpha_{3}^{2}}. (54)

The feasible condition for the intersection of sphere and plane is ρ1\rho\leq 1. Therefore, we have

ρ=|ϵ~1|c11|ϵ~1|c1|D1ϵ+c2|c1c1c2D1ϵc1c2.\displaystyle\rho=\tfrac{|\tilde{\epsilon}_{1}|}{c_{1}}\leq 1\Rightarrow|\tilde{\epsilon}_{1}|\leq c_{1}\Rightarrow|\sqrt{D_{1}\epsilon}+c_{2}|\leq c_{1}\Rightarrow-c_{1}-c_{2}\leq\sqrt{D_{1}\epsilon}\leq c_{1}-c_{2}. (55)

Since |c2|c1|c_{2}|\leq c_{1}, we have c1c20-c_{1}-c_{2}\leq 0 and (55) becomes D1ϵc1c2\sqrt{D_{1}\epsilon}\leq c_{1}-c_{2}.

Appendix B Proof of Corollary 1

The general conic equation Ax2+Bxy+Cy2+Dx+Ey+F=0Ax^{2}+Bxy+Cy^{2}+Dx+Ey+F=0 represents an ellipse if and only if

B24AC<0.\displaystyle B^{2}-4AC<0. (56)

For (2), condition (56) is equivalent to

(2α1α2ϵ~12)24(α12ϵ~121)(α22ϵ~121)<0α12+α22ϵ~121<0.\displaystyle(\tfrac{2\alpha_{1}\alpha_{2}}{\tilde{\epsilon}_{1}^{2}})^{2}-4(\tfrac{\alpha_{1}^{2}}{\tilde{\epsilon}_{1}^{2}}-1)(\tfrac{\alpha_{2}^{2}}{\tilde{\epsilon}_{1}^{2}}-1)<0\Longleftrightarrow\tfrac{\alpha_{1}^{2}+\alpha_{2}^{2}}{\tilde{\epsilon}_{1}^{2}}-1<0. (57)

Since ϵ~1=D1ϵ+c2\tilde{\epsilon}_{1}=\sqrt{D_{1}\epsilon}+c_{2} and we define c3=α12+α220c_{3}=\sqrt{\alpha_{1}^{2}+\alpha_{2}^{2}}\geq 0, the condition is equivalent to

|D1ϵ+c2|>c3D1ϵ>c3c2, or D1ϵ<c3c2,\displaystyle|\sqrt{D_{1}\epsilon}+c_{2}|>c_{3}\Leftrightarrow\sqrt{D_{1}\epsilon}>c_{3}-c_{2},\text{~{}or~{}}\sqrt{D_{1}\epsilon}<-c_{3}-c_{2}, (58)

Similarly, because ϵ~2=D1ϵ+c2\tilde{\epsilon}_{2}=-\sqrt{D_{1}\epsilon}+c_{2}, the condition (56) for (4) is equivalent to

(2α1α2ϵ~22)24(α12ϵ~221)(α22ϵ~221)<0|D1ϵ+c2|>c3,\displaystyle(\tfrac{2\alpha_{1}\alpha_{2}}{\tilde{\epsilon}_{2}^{2}})^{2}-4(\tfrac{\alpha_{1}^{2}}{\tilde{\epsilon}_{2}^{2}}-1)(\tfrac{\alpha_{2}^{2}}{\tilde{\epsilon}_{2}^{2}}-1)<0\Leftrightarrow|-\sqrt{D_{1}\epsilon}+c_{2}|>c_{3},
D1ϵ>c2+c3, or D1ϵ<c2c3.\displaystyle\Leftrightarrow\sqrt{D_{1}\epsilon}>c_{2}+c_{3},\text{~{}or~{}}\sqrt{D_{1}\epsilon}<c_{2}-c_{3}. (59)

When c20c_{2}\geq 0, D1ϵ<c3c20\sqrt{D_{1}\epsilon}<-c_{3}-c_{2}\leq 0 in (58) can be discarded. If ϵ\epsilon satisfies |c3c2|<D1ϵc3+c2|c_{3}-c_{2}|<\sqrt{D_{1}\epsilon}\leq c_{3}+c_{2}, (58) holds while (B) does not hold. When c2<0c_{2}<0, D1ϵ<c2c3<0\sqrt{D_{1}\epsilon}<c_{2}-c_{3}<0 in (B) can be ignored. If |c3+c2|<D1ϵc3c2|c_{3}+c_{2}|<\sqrt{D_{1}\epsilon}\leq c_{3}-c_{2}, (B) holds while (58) does not hold.

Appendix C Proof of Proposition 5

Since ^(LoS,θku)1\hat{\mathbb{P}}(LoS,\theta_{ku})\leq 1, we have

𝒃u𝒎kαPk^(LoS,θku)WkuN0γ0(2Rkth/Wku1)PkWkuN0γ0(2Rkth/Wku1)\displaystyle||\bm{b}_{u}-\bm{m}_{k}||^{\alpha}\leq\tfrac{P_{k}\hat{\mathbb{P}}(LoS,\theta_{ku})}{W_{ku}N_{0}\gamma_{0}(2^{R_{k}^{th}/W_{ku}}-1)}\leq\tfrac{P_{k}}{W_{ku}N_{0}\gamma_{0}(2^{R_{k}^{th}/W_{ku}}-1)}
\displaystyle\Rightarrow 𝒃u𝒎k(PkWkuN0γ0(2Rkth/Wku1))1α=R0\displaystyle||\bm{b}_{u}-\bm{m}_{k}||\leq\big{(}\tfrac{P_{k}}{W_{ku}N_{0}\gamma_{0}(2^{R_{k}^{th}/W_{ku}}-1)}\big{)}^{\frac{1}{\alpha}}=R_{0}
\displaystyle\Rightarrow |hfhk|𝒃u𝒎k|hfhk|R0sinθkusinθ^ku.\displaystyle\tfrac{|h_{f}-h_{k}|}{||\bm{b}_{u}-\bm{m}_{k}||}\geq\tfrac{|h_{f}-h_{k}|}{R_{0}}\Rightarrow\sin\theta_{ku}\geq\sin\hat{\theta}_{ku}. (60)

In addition, both sinθku\sin\theta_{ku} and ^(LoS,θku)\hat{\mathbb{P}}(LoS,\theta_{ku}) are monotonically increasing when θku[0,90]\theta_{ku}\in[0^{\circ},90^{\circ}], thus sinθkusinθ^ku\sin\theta_{ku}\geq\sin\hat{\theta}_{ku} implies ^(LoS,θku)^(LoS,θ^ku)\hat{\mathbb{P}}(LoS,\theta_{ku})\geq\hat{\mathbb{P}}(LoS,\hat{\theta}_{ku}). Hence, the proof is complete.

References

  • [1] C. Hu, W. Fan, E. Zeng, Z. Hang, F. Wang, L. Qi, and M. Z. A. Bhuiyan, “Digital Twin-Assisted Real-Time Traffic Data Prediction Method for 5G-Enabled Internet of Vehicles,” IEEE Transactions on Industrial Informatics, vol. 18, no. 4, pp. 2811–2819, 2021.
  • [2] L. Liu, X. Guo, and C. Lee, “Promoting smart cities into the 5G era with multi-field Internet of Things (IoT) applications powered with advanced mechanical energy harvesters,” Nano Energy, vol. 88, p. 106304, 2021.
  • [3] M. Kumhar and J. Bhatia, “Emerging communication technologies for 5G-Enabled internet of things applications,” in Blockchain for 5G-Enabled IoT.   Springer, 2021, pp. 133–158.
  • [4] M. M. Hasan, M. A. Rahman, A. Sedigh, A. U. Khasanah, A. T. Asyhari, H. Tao, and S. A. Bakar, “Search and rescue operation in flooded areas: a survey on emerging sensor networking-enabled IoT-oriented technologies and applications,” Cognitive Systems Research, vol. 67, pp. 104–123, 2021.
  • [5] R. Shahzadi, M. Ali, H. Z. Khan, and M. Naeem, “UAV assisted 5G and beyond wireless networks: A survey,” Journal of Network and Computer Applications, vol. 189, p. 103114, 2021.
  • [6] X. Zhang, X. Tao, F. Zhu, X. Shi, and F. Wang, “Quality assessment of gnss observations from an android n smartphone and positioning performance analysis using time-differenced filtering approach,” Gps Solutions, vol. 22, no. 3, pp. 1–11, 2018.
  • [7] Z. Wang, R. Liu, Q. Liu, L. Han, J. S. Thompson, Y. Lin, and W. Mu, “Toward reliable uav-enabled positioning in mountainous environments: System design and preliminary results,” IEEE Transactions on Reliability, 2021.
  • [8] Z. Xiao and Y. Zeng, “An overview on integrated localization and communication towards 6g,” Science China Information Sciences, vol. 65, no. 3, pp. 1–46, 2022.
  • [9] S. Fischer, “Observed time difference of arrival (otdoa) positioning in 3gpp lte,” Qualcomm White Pap, vol. 1, no. 1, pp. 1–62, 2014.
  • [10] C.-Y. Chen and W.-R. Wu, “Three-dimensional positioning for lte systems,” IEEE Transactions on vehicular technology, vol. 66, no. 4, pp. 3220–3234, 2016.
  • [11] A. Al-Hourani, S. Kandeepan, and S. Lardner, “Optimal lap altitude for maximum coverage,” IEEE Wireless Communications Letters, vol. 3, no. 6, pp. 569–572, 2014.
  • [12] Y. Chen, W. Feng, and G. Zheng, “Optimum placement of uav as relays,” IEEE Communications Letters, vol. 22, no. 2, pp. 248–251, 2017.
  • [13] J. Lyu, Y. Zeng, R. Zhang, and T. J. Lim, “Placement optimization of uav-mounted mobile base stations,” IEEE Communications Letters, vol. 21, no. 3, pp. 604–607, 2016.
  • [14] M. A. Ali and A. Jamalipour, “Uav placement and power allocation in uplink and downlink operations of cellular network,” IEEE Transactions on Communications, vol. 68, no. 7, pp. 4383–4393, 2020.
  • [15] H. Ren, C. Pan, K. Wang, W. Xu, M. Elkashlan, and A. Nallanathan, “Joint transmit power and placement optimization for urllc-enabled uav relay systems,” IEEE Transactions on vehicular technology, vol. 69, no. 7, pp. 8003–8007, 2020.
  • [16] R. Fan, J. Cui, S. Jin, K. Yang, and J. An, “Optimal node placement and resource allocation for uav relaying network,” IEEE Communications Letters, vol. 22, no. 4, pp. 808–811, 2018.
  • [17] J. Sabzehali, V. K. Shah, H. S. Dhillon, and J. H. Reed, “3D Placement and Orientation of mmWave-based UAVs for Guaranteed LoS Coverage,” IEEE Wireless Communications Letters, vol. 10, no. 8, pp. 1662–1666, 2021.
  • [18] J. A. del Peral-Rosado, R. Raulefs, J. A. López-Salcedo, and G. Seco-Granados, “Survey of Cellular Mobile Radio Localization Methods: From 1G to 5G,” IEEE Communications Surveys & Tutorials, vol. 20, no. 2, pp. 1124–1148, 2018.
  • [19] Y. Liu, J. Wang, and Y. Shen, “Spectrum allocation for UAV-aided relative localization of ground vehicles,” in 2018 IEEE International Conference on Communications Workshops (ICC Workshops).   IEEE, 2018, pp. 1–5.
  • [20] Z. Wu, W. Quan, and T. Zhang, “Resource allocation in UAV-aided vehicle localization frameworks,” in 2019 IEEE/CIC International Conference on Communications Workshops in China (ICCC Workshops).   IEEE, 2019, pp. 98–103.
  • [21] F. B. Sorbelli, S. K. Das, C. M. Pinotti, and S. Silvestri, “Range based algorithms for precise localization of terrestrial objects using a drone,” Pervasive and Mobile Computing, vol. 48, pp. 20–42, 2018.
  • [22] J. Yang, T. Liang, and T. Zhang, “Deployment Optimization in UAV Aided Vehicle Localization,” in 2021 IEEE 93rd Vehicular Technology Conference (VTC2021-Spring).   IEEE, 2021, pp. 1–6.
  • [23] O. Esrafilian, R. Gangula, and D. Gesbert, “Three-dimensional-map-based trajectory design in UAV-aided wireless localization systems,” IEEE Internet of Things Journal, vol. 8, no. 12, pp. 9894–9904, 2020.
  • [24] C. Zhan, Y. Zeng, and R. Zhang, “Energy-efficient data collection in UAV enabled wireless sensor network,” IEEE Wireless Communications Letters, vol. 7, no. 3, pp. 328–331, 2017.
  • [25] A. W. Al-Asadi and N. S. Ali, “Noise-Robust Least-Squares Method in TDOA Estimation of a Source Location,” in 2021 Palestinian International Conference on Information and Communication Technology (PICICT), 2021, pp. 123–128.
  • [26] J. A. del Peral-Rosado, J. A. López-Salcedo, G. Seco-Granados, F. Zanier, and M. Crisci, “Achievable localization accuracy of the positioning reference signal of 3GPP LTE,” in 2012 International Conference on Localization and GNSS.   IEEE, 2012, pp. 1–6.
  • [27] Z. Wang, R. Liu, Q. Liu, J. S. Thompson, and M. Kadoch, “Energy-efficient data collection and device positioning in UAV-assisted IoT,” IEEE Internet of Things Journal, vol. 7, no. 2, pp. 1122–1139, 2019.
  • [28] D. Ucinski, Optimal measurement methods for distributed parameter system identification.   CRC press, 2004.
  • [29] Y. Zheng, M. Sheng, J. Liu, and J. Li, “Oparray: Exploiting array orientation for accurate indoor localization,” IEEE Transactions on Communications, vol. 67, no. 1, pp. 847–858, 2018.
  • [30] P. K. Agarwal, E. Ezra, and M. Sharir, “Near-linear approximation algorithms for geometric hitting sets,” Algorithmica, vol. 63, no. 1, pp. 1–25, 2012.