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

A Statistical Characterization of Localization Performance in Millimeter-Wave Cellular Networks

Jiajun He,  Young Jin Chun This work was supported by in part by the City University of Hong Kong (CityU), Startup Grant 7200618, and in part by the CityU, Strategic Research Grant 21219520J. He and Y. J. Chun are with the Department of Electrical Engineering, City University of Hong Kong, Hong Kong, China (e-mail: jiajunhe5-c@cityu.edu.hk; yjchun@cityu.edu.hk)
Abstract

Millimeter-wave (mmWave) communication is a promising solution for achieving high data rate and low latency in 5G wireless cellular networks. Since directional beamforming and antenna arrays are exploited in the mmWave networks, accurate angle-of-arrival (AOA) information can be obtained and utilized for localization purposes. The performance of a localization system is typically assessed by the Crame´\bf\acute{\rm e}r-Rao lower bound (CRLB) evaluated based on fixed node locations. However, this strategy only produces a fixed value for the CRLB specific to the scenario of interest. To allow randomly distributed nodes, stochastic geometry has been proposed to study the CRLB for time-of-arrival-based localization. To the best of our knowledge, this methodology has not yet been investigated for AOA-based localization. In this work, we are motivated to consider the mmWave cellular network and derive the CRLB for AOA-based localization and its distribution using stochastic geometry. We analyze how the CRLB is affected by the node locations’ spatial distribution, including the target and participating base stations. To apply the CRLB on a network setting with random node locations, we propose an accurate approximation of the CRLB using the L/4\lceil L/4\rceil-th value of ordered distances where LL is the number of participating base stations. Furthermore, we derive the localizability of mmWave network, which is the probability that a target is localizable, and examine how the network parameters influence the localization performance. These findings provide us deep insight into optimum network design that meets specified localization requirements.

Index Terms:
Millimeter-wave, angle-of-arrival, localizability, Crame´\bf\acute{\rm e}r-Rao lower bound.

I Introduction

Due to the emergence of internet-of-things, positioning techniques have received considerable attention, which can be utilized to enhance user experience of location-based services, including navigation, mapping, and intelligent transportation systems [1]. Fifth-generation (5G) wireless network access interface together with its large bandwidth, high carrier frequency, and massive antenna array offers excellent opportunities for accurate localization, and millimeter-wave (mmWave) is a promising technology for the 5G wireless communication systems to meet such requirements. Wireless networks enable us to obtain accurate location-bearing information from estimating the channel parameters, such as time-of-arrival (TOA), time-difference-of-arrival (TDOA), received signal strength (RSS), and angle-of-arrival (AOA). In mmWave networks, we can exploit the large antenna array and highly directional transmission to acquire the AOAs with high precision[2]. Large-scale directional antenna arrays are leveraged due to the small wavelength of mmWave signals, which can generate highly directional beams and provide large beamforming gain[3]. In this paper, we analyze the localization performance of the mmWave wireless network using the AOA measurements.

A target is localizable if its position can be determined without ambiguity with a sufficient number of participating base stations (BSs). The AOA-based positioning requires at least 22 BSs to determine the location of the target in a two-dimensional (2-D) plane [4]. Since the number of participating BSs determines the accuracy of the localization, we introduce the notion of LL-localizability, which indicates the probability of at least LL BSs participating in the localization procedure.

Furthermore, Crame´\bf\acute{\rm e}r-Rao lower bound (CRLB) is a standard tool to analyze the performance of localization algorithm, which provides a lower bound for the position error of any unbiased estimator [4]. Conventionally, CRLB assumes a fixed scenario, where the nodes are placed at a particular geometry, and this assumption limits the applicability of CRLB as it cannot properly reflect the impact of the random geometry. To evaluate the localization error of a random network, we use stochastic geometry [5, 6] and consider the ensemble average of the node spatial locations. Then the CRLB is no longer a fixed value, but rather a random variable (RV) conditioned on the number of participating BSs, where the randomness of CRLB is induced by the randomness of the nodes. Based on the LL-localizability and random CRLB, we provide a deep insight for the network operator on how to deploy the BSs to achieve a given localization requirement. The main contributions of this paper are summarized as follows.

I-1 LL-Localizability

We derive the tractable expression of LL-localizability to study the number of BSs who can participate in a localization procedure. In [7], the authors studied on how the network parameters affect the localization performance of the Long Term Evolution (LTE) cellular network. In this work, we derive the LL-localizability for the mmWave networks, where the impacts of the directional antenna and Nakagami fading on mmWave-based localization systems are assessed. Furthermore, we introduce asymptotic bounds and approximations for the distribution of the LL-localizability and CRLB to provide analytical tools to track the performance of localization systems.

I-2 Random AOA-based CRLB

In the mmWave networks, accurate AOA measurements can be obtained by using antenna arrays to locate the target of interest with high precision. In this paper, we derive random CRLB for AOA-based positioning. Previous works [8, 9, 10] applied stochastic geometry to TOA-based localization, and to the best of our knowledge, there is no prior work that investigates random geometry on AOA-based localization systems. We derive the distribution of AOA-positioning based CRLB for the mmWave networks by using stochastic geometry and order statistics. The obtained distribution shows how the network parameters affect localization performance in the mmWave wireless networks.

The rest of this paper is organized as follows. Relevant works are reviewed in Section II, the system model is presented in Section III, and we analyze the localization performance in Section IV. Numerical results are provided in Section V and we conclude the paper in Section VI.

II Related Work

The major localization techniques in the LTE mobile network are TDOA [11, 12], uplink TDOA [13], measurement report (MR) [14] and enhanced cell ID (E-CID) [15]. Compared with the LTE mobile network, mmWave is regarded as a promising candidate to meet demands for achieving accurate localization in the 5G mobile network. Conventionally, the localization approaches can be divided into two categories: direct and indirect localization. In the mmWave networks, we focus on the latter due to the high computational complexity of the former. The target of interest can be located in mmWave networks using the indirect approach by estimating the channel parameters, including TOA, AOA, and RSS [16]. Based on the processing methods of mmWave signals, localization approaches can be categorized into proximity, fingerprinting, and geometry-based [17]. In this paper, we mainly focus on the geometry-based positioning approach because large-scale antenna arrays can provide high angular resolution [18].

Localization performance is generally evaluated using CRLB for a fixed geometry [4]. For considering all possible localization scenarios, we aim to derive the network-wide distribution of localization performance, and there are two important metrics, namely, the probability that a given number of BSs can participate in a localization procedure, and the distribution of the CRLB conditioned on the number of participating BSs. The first metric, which includes finding the participation probability of a given number of BSs, was studied in [7]. The authors modeled a cellular network with a homogeneous Poisson point process (PPP) [5] and applied a “dominant interferer analysis” to derive an expression for the probability of LL-localizability. However, this method is only suitable for LTE mobile networks. Compared with [7], we derive an accurate expression of LL-localizability using Alzer’s inequality [19] for characterizing the localization performance of mmWave wireless networks.

Regarding the second metric, there have been several attempts in the literature to achieve this conditional distribution of CRLB. In [20], approximations of this conditional distribution were presented for RSS and TOA localization systems. However, these distributions are sensitive to the number of participating BSs, and it is only accurate for numerous participating BSs. In real-world scenarios, we prefer to measure the conditional distribution using smaller number of participating BSs because this is more common in cellular networks. Additionally, [8] presented an analysis of how the CRLB is affected by the order statistics of internodal angles. This analysis reveals a connection between the second largest internodal angle and the CRLB, leading to an accurate approximation of the CRLB. However, only TOA-based localization is considered in a general fading channel which takes the large-scale fading into consideration. Motivated by these works, we explore the localization performance using the AOA measurements and apply it in the mmWave-based cellular network. Different from [8], we analyze how the CRLB is affected by the ordered distances between BSs and target, and an accurate approximation of the CRLB is provided using the L/4\lceil L/4\rceil-th distance between these ordered distances, where LL is the number of participating BSs in a localization procedure.

III System Model

In this section, we describe the system model where the key notations used in this paper are summarized in Table 11.

III-A Network Model

We consider downlink transmission in a mmWave cellular network where the locations of BSs are modeled using a homogeneous PPP[5]. As illustrated in Fig. 1, we assume that the target is located at the origin O and the BSs are randomly distributed over the 2\mathbb{R}^{2} plane. The red triangle represents the nearest BS to the target that is located inside the disk, whereas the green triangle indicates the furthest BS from the target residing in the disk. Furthermore, blue and yellow triangles represent the BSs that are located inside and outside the disk, respectively. Let us denote the locations of the BS as 𝝍l=[xl,yl]2\bm{\psi}_{l}=[x_{l},y_{l}]\in\mathbb{R}^{2} and the distance between the ll-th BS and target as rl=𝝍lr_{l}=||\bm{\psi}_{l}||. Based on the system model, the probability density function (PDF) and cumulative distribution function (CDF) of the LL-th nearest BS are given by [21]

frL(r)=2(λπr2)Lr(L1)!eλπr2,FrL(r)=1n=0L11n!e2πλr2(2πλr2)n,\begin{split}f_{r_{L}}(r)&=\frac{2(\lambda\pi r^{2})^{L}}{r(L-1)!}e^{-\lambda\pi r^{2}},\\ F_{r_{L}}(r)&=1-\sum_{n=0}^{L-1}\frac{1}{n!}e^{-2\pi\lambda r^{2}}(2\pi\lambda r^{2})^{n},\end{split} (1)

where λ\lambda represents the BS density. Conditioned on the distance of the LL-th BS from O, the remaining BSs closer to the origin than the LL-th BS form a uniform binomial point process (BPP) on 𝒃(O,RL)\bm{b}(\textit{O},R_{L}) [22], where the PDF and CDF of rlr_{l} are given by

frl(r)=2rrL2r12,Frl(r)=r2rL2r12,f_{r_{l}}(r)=\frac{2r}{r_{L}^{2}-r_{1}^{2}},\quad F_{r_{l}}(r)=\frac{r^{2}}{r_{L}^{2}-r_{1}^{2}}, (2)

with r1rlrLr_{1}\leq r_{l}\leq r_{L}. In Section IV, we applied order statistic to obtain the distribution of the ordered distances.

Table I: Summary of Notation
Notation Meaning
T transpose
H conjugate transpose
||||||\cdot|| Euclidean norm
𝝍l\bm{\psi}_{l} location of ll-th BS
𝝍t\bm{\psi}_{t} location of target
rlr_{l} distance between ll-th BS and target
r1r_{1} distance between closest BS and target
rLr_{L} distance between furthest BS and target
λ\lambda BS density in the disk
PtP_{t} BS and target transmit power
NtN_{t} number of antenna elements
NN number of clusters
ρ𝝍n\rho_{\bm{\psi}_{n}} small-scale fading gain
dd antenna spacing
λw\lambda_{w} antenna wavelength
θ𝝍\theta_{\bm{\psi}} AOA of BS at location 𝝍\bm{\psi}
nAOA,ln_{{\rm{AOA}},l} WGN with zero mean and variance of σAOA,l2\sigma_{{\rm{AOA}},l}^{2}
G1G_{1} main-lobe gain
G2G_{2} side-lobe gain
pap_{a} probability of main-lobe gain is received
pbp_{b} probability of side-lobe gain is received
PTP_{T} total transmit power
PmP_{m} power spectrum density of main-lobe
PsP_{s} power spectrum density of side-lobe
σn2\sigma_{n}^{2} normalized noise power
aia_{i} network load indicator
qq probability of BS is activated
α\alpha path-loss exponent
Ω\Omega total number of activated BSs
τ\tau signal-to-interference-plus-noise ratio threshold
γ\gamma maximum number of selectable BSs
σAOA\sigma_{\rm{AOA}} standard deviation of AOA measurement
GcG_{c} average channel gain of mmWave network
N0N_{0} spectral density of WGN
WTOTW_{\rm{TOT}} total mmWave system bandwidth

III-B Channel Model

We assume that each BS is equipped with a directional antenna array composed of NtN_{t} elements and all BSs operate at a constant power PtP_{t}. In the mmWave channel, the non-line-of-sight (NLOS) interference is negligible since the channel gains of NLOS paths are typically 20 dB weaker than those from the line-of-sight (LOS) [23]. The effect of path-loss can be reduced due to the utilization of the directional antenna arrays, and it is also applied to provide highly directional beams. The received signal from the ll-th BS to the origin is given by

y(t)=Ptβ𝒉ψl𝒘ψlrlα2sψl(t)+n(t)+𝝍𝝍Ptβ𝒉𝝍𝒘𝝍𝝍α2s𝝍(t),t[0,T],\begin{split}y(t)&=\sqrt{P_{t}\beta}\bm{h}_{\psi_{l}}\bm{w}_{\psi_{l}}r_{l}^{-\frac{\alpha}{2}}s_{\psi_{l}}(t)+n(t)\\ &+\sum_{\bm{\psi}\in\bm{\psi}^{\prime}}\sqrt{P_{t}\beta}\bm{h}_{\bm{\psi}}\bm{w}_{\bm{\psi}}||\bm{\psi}||^{-\frac{\alpha}{2}}s_{\bm{\psi}}(t),\quad t\in\left[0,T\right],\end{split} (3)

where s𝝍(t)s_{\bm{\psi}}(t) is the transmit signal, 𝒉𝝍\bm{h}_{\bm{\psi}} is the channel vector, α\alpha and β\beta respectively represent the path-loss exponent and path-loss intercept, 𝒘𝝍\bm{w}_{\bm{\psi}} denotes the beamforming vector of the node at location 𝝍\bm{\psi}, and n(t)n(t) represents the additive white Gaussian noise (AWGN) with variance σ2\sigma^{2}. Note that the locations of the interfering transmitters are denoted as 𝝍\bm{\psi}^{\prime}.

Due to high free-space path-loss, the mmWave propagation environment is well characterized by a clustered channel model, known as the Saleh-Valenzuela model[24]:

𝒉𝝍=Ntn=1Nρ𝝍,n𝒂tH(θ𝝍,n),\bm{h}_{\bm{\psi}}=\sqrt{N_{t}}\sum_{n=1}^{N}\rho_{\bm{\psi},{n}}\bm{a}_{t}^{H}(\theta_{\bm{\psi},{n}}), (4)

where NN is the number of clusters and ρ𝝍,n\rho_{\bm{\psi},{n}} represents the complex small-scale fading coefficient of the nn-th cluster. We assume that the fading channel power gain follows a gamma distribution, i.e., |ρ𝝍|2Γ(M,1M)|\rho_{\bm{\psi}}|^{2}\sim\Gamma(M,\frac{1}{M}), with Nakagami parameter MM. In this paper, we focus on LOS paths, i.e., N=1N=1, and adopt a uniformly random single path (UR-SP) channel model that is commonly used in the mmWave network analysis [25]. The 𝒂t(θ𝝍)\bm{a}_{t}(\theta_{\bm{\psi}}) represents the transmit array response vector corresponding to the AOA θ𝝍\theta_{\bm{\psi}}. We consider a uniform linear array (ULA) with NtN_{t} antenna elements, where the transimt array response vectors are given by

𝒂t(θ𝝍)=1Nt[1,,ej2πkθ𝝍1,,ej2π(Nt1)θ𝝍]T,\bm{a}_{t}(\theta_{\bm{\bm{\psi}}})=\frac{1}{\sqrt{N_{t}}}\left[1,\ldots,e^{j2\pi k\theta_{\bm{\psi}_{1}}},\ldots,e^{j2\pi(N_{t}-1)\theta_{\bm{\psi}}}\right]^{T}, (5)

where dd is the antenna spacing, λw\lambda_{w} represents the wavelength, ϕ𝝍\phi_{\bm{\psi}} denotes the AOA, k[0,Nt]k\in\left[0,N_{t}\right] is the antenna index, and θ𝝍=dλwsinϕ𝝍\theta_{\bm{\psi}}=\frac{d}{\lambda_{w}}\sin\phi_{\bm{\psi}} is uniformly distributed over [dλw,dλw]\left[-\frac{d}{\lambda_{w}},\frac{d}{\lambda_{w}}\right].

Refer to caption

Fig. 1: System model of the mmWave wireless networks

Refer to caption

Fig. 2: AOA-based positioning

Once the AOA measurements are obtained, we compute the location of the target, where we assume LOS propagation. As shown in Fig. 2, we denote the AOA between the target and ll-th BS as θl\theta_{l} and the location of target as 𝝍t=[xt,yt]\bm{\psi}_{t}=[x_{t},y_{t}],

tan(θl)=ylytxlxt,l={1,,L}.\tan(\theta_{l})=\frac{y_{l}-y_{t}}{x_{l}-x_{t}},\quad l=\{1,\ldots,L\}. (6)

The AOA measurement at the ll-th BS is modeled as follows

rAOA,l=θl+nAOA,l=tan1(ylytxlxt)+nAOA,l,r_{{\rm{AOA}},l}=\theta_{l}+n_{{\rm{AOA}},l}=\tan^{-1}\left(\frac{y_{l}-y_{t}}{x_{l}-x_{t}}\right)+n_{{\rm{AOA}},l}, (7)

where nAOA,ln_{{\rm{AOA}},l} is the AWGN with variance σAOA,l2\sigma_{{\rm{AOA}},l}^{2}. The AOA measurements in (7) can be represented by a vector form

𝒓AOA=𝒇AOA(𝝍)+𝒏AOA,l,{\bm{r}}_{\rm{AOA}}=\bm{f}_{AOA}(\bm{\psi})+\bm{n}_{{\rm{AOA}},l}, (8)

where 𝒓AOA{\bm{r}}_{\rm{AOA}}, 𝒏AOA{\bm{n}}_{\rm{AOA}}, and 𝒇AOA(𝝍)\bm{f}_{AOA}(\bm{\psi}) are respectively defined by

𝒓AOA=[rAOA,1,rAOA,2,,rAOA,L]T,𝒏AOA=[nAOA,1,nAOA,2,,nAOA,L]T,𝒇AOA(𝝍)=[tan1(y1ytx1xt),,tan1(yLytxLxt)]T.\begin{split}{\bm{r}}_{\rm{AOA}}&=\left[r_{{\rm{AOA}},1},r_{{\rm{AOA}},2},\ldots,r_{{\rm{AOA}},L}\right]^{T},\\ {\bm{n}}_{\rm{AOA}}&=\left[n_{{\rm{AOA}},1},n_{{\rm{AOA}},2},\ldots,n_{{\rm{AOA}},L}\right]^{T},\\ \bm{f}_{AOA}(\bm{\psi})&=\left[\tan^{-1}\left(\frac{y_{1}-y_{t}}{x_{1}-x_{t}}\right),\ldots,\tan^{-1}\left(\frac{y_{L}-y_{t}}{x_{L}-x_{t}}\right)\right]^{T}.\end{split} (9)

III-C Analog Beamforming and Antenna Radiation Pattern

Assuming that the AOA of the channel between the BS at location 𝝍l\bm{\psi}_{l} and its serving user at location 𝝍t\bm{\psi}_{t} is θ𝝍l\theta_{\bm{\psi}_{l}}, the beamforming vector is given by

𝒘𝝍l=𝒂t(θ𝝍l),\bm{w}_{\bm{\psi}_{l}}=\bm{a}_{t}(\theta_{\bm{\psi}_{l}}), (10)

which means that the BS should align the beam direction exactly with the propagation channel to obtain the maximum power gain. However, the beam direction cannot always align with the transmit signal. Hence, we consider the single main-lobe and single side-lobe at antennas of both BS and mobile user, and all lobes are approximated by a flat-top antenna pattern[26]. That is, the single main-lobe with beam-width θ1\theta_{1} has antenna gain G1G_{1} and each side lobe with identical beam-width θ2\theta_{2} has antenna gain G2G_{2}. We assume that the power spectrum density (PSD) of the main-lobe and side-lobe at a distance rr are denoted as PmP_{m} and PsP_{s}. Hence, the total transmit power PTP_{T} consists of the main-lobe and side-lobe radiation powers, which is given by [26]

PT=Pm2πr2[1cosθ12]+NtPs2πr2[1cosθ22],P_{T}=P_{m}2\pi r^{2}\left[1-\cos\frac{\theta_{1}}{2}\right]+N_{t}P_{s}2\pi r^{2}\left[1-\cos\frac{\theta_{2}}{2}\right], (11)

where Pm=G1PT/4πr2P_{m}=G_{1}P_{T}/4\pi r^{2} and Ps=G2PT/4πr2P_{s}=G_{2}P_{T}/4\pi r^{2}. Let us denote k=G2/G1k=G_{2}/G_{1} where k(0,1)k\in(0,1), i.e., G2=kG1G_{2}=kG_{1}.

For the associated signal transmission, we assume perfect alignment where both the BS and user utilize the main-lobe, achieving the squared gain G12G_{1}^{2}. For the interfering signal, the interfering BSs are randomly distributed in [0,2π)[0,2\pi). The transmit antenna gain GTxG_{Tx} at the transmitter and the receive antenna gain GRxG_{Rx} at the receiver are randomly chosen from a discrete set {G1,G2}\left\{G_{1},G_{2}\right\} with probability pa=θ12πp_{a}=\frac{\theta_{1}}{2\pi} and pb=1pap_{b}=1-p_{a}, respectively. Let GTRx=GTxGRxG_{TRx}=G_{Tx}G_{Rx}, we have

GTRx={G12,p1=pa2G1G2,p2=2papbG22,p3=pb2.G_{TRx}=\left\{\begin{array}[]{ll}G_{1}^{2},&p_{1}=p_{a}^{2}\\ G_{1}G_{2},&p_{2}=2p_{a}p_{b}\\ G_{2}^{2},&p_{3}=p_{b}^{2}.\end{array}\right. (12)

Based on the antenna radiation pattern, the product of small-scale fading gain and beamforming gain of the BS at location 𝝍\bm{\psi} is computed as:

|𝒉𝝍𝒘𝝍|2=Nt|ρ𝝍|2GTRx.|\bm{h}_{\bm{\psi}}\bm{w}_{\bm{\psi}}|^{2}=N_{t}|\rho_{\bm{\psi}}|^{2}G_{TRx}. (13)

IV Performance Analysis

In this section, we analyze the performance of AOA-based localization over a mmWave network. To evaluate the localization performance, we will introduce two metrics; LL-localizability and AOA-based random CRLB.

IV-A L-Localizability

A target is localizable if there are a sufficient number of participating BSs such that the localization procedure can be conducted. We introduce L-Localizability, which is a probability to have LL localizable BSs within the network [7]. Conventionally, commonly-accepted minimum values of LL for the unambiguous operation of a localization system are 22, 33, 33 and 33 for AOA, TOA or RSS, and TDOA, respectively [4]. If we treat the interference originated from outside of the circular disk with radius RLR_{L} as a noise, the signal-to-interference-plus-noise ratio (SINR) of the link from the kk-th BSs to the target can be expressed as a function of LL as

SINRk(L)=G12|ρ𝝍k|2rkασn2+J,{\rm{SINR}}_{k}(L)=\frac{G_{1}^{2}|\rho_{\bm{\psi}_{k}}|^{2}r_{k}^{-\alpha}}{\sigma_{n}^{2}+J}, (14)

where σn2=σT2+σout2βPtNt\sigma_{n}^{2}=\frac{\sigma_{T}^{2}+\sigma_{{\rm{out}}}^{2}}{\beta P_{t}N_{t}} is the normalized noise power, including the thermal noise power σT2\sigma_{T}^{2} and interference power σout2\sigma_{{\rm{out}}}^{2} outside the circular disk. The interference from nodes inside the disk, denoted by JJ, is expressed as:

J=i=1,ikL1aiGTRx,i|ρ𝝍i|2𝝍iα,J=\sum_{i=1,i\neq k}^{L-1}a_{i}G_{TRx,i}|\rho_{\bm{\psi}_{i}}|^{2}||\bm{\psi}_{i}||^{-\alpha}, (15)

where ai{0,1}a_{i}\in\{0,1\} is utilized to simulate the network load. The probability of ai=1a_{i}=1 equals qq which is the probability of a BS inside the disk to be activated. The aia_{i} represents whether the BS is activated in the localization procedure and we assume that the activation probability P(ai=1)=qP\left(a_{i}=1\right)=q is fixed throughout the localization procedure.

For a given 𝝍2{\bm{\psi}}\in\mathbb{R}^{2}, a mobile device is said to be LL-localizable if at least LL BSs participate in the localization procedure. Let us denote the SINR threshold as τ\tau and the maximum number of BSs that can participate in the localization procedure as γ\gamma, defined as

γ=argmaxL(Lk=1L𝕀(SINRk(l)τ)),\gamma={\mathop{\arg\max}_{L}}\left(L\cdot\prod_{k=1}^{L}\mathbb{I}\left({\rm{SINR}}_{k}(l)\geq\tau\right)\right), (16)

where 𝕀(.)\mathbb{I}(.) is the indicator function. Then, the LL-localizability, denoted by PLP_{L}, is derived as:

PL=P(γL)=𝔼[k=1L𝕀(SINRk(l)τ)].P_{L}=P\left(\gamma\geq L\right)=\mathbb{E}\left[\prod_{k=1}^{L}\mathbb{I}\left({\rm{SINR}}_{k}(l)\geq\tau\right)\right]. (17)

Since the SINR from a BS farther from the mobile device is lower than that of the closer BS, the following inequality holds: 𝕀(SINRk(L)τ)𝕀(SINRl(L)τ)\mathbb{I}({\rm{SINR}}_{k}(L)\geq\tau)\geq\mathbb{I}({\rm{SINR}}_{l}(L)\geq\tau) for all klLk\geq l\geq L. Then, the LL-localizability PLP_{L} can be computed as follows

PL=𝔼[𝕀(SINRL(L)τ]=P(SINRL(L)τ)=1P(|ρψL|2τrLαG12(σn2+J))𝑎1𝔼rL[(1eντG12rLα(σn2+J))M]=𝑏𝔼rL[i=1M(1)i+1(Mi)esσn2I(s)]=0frL(r)i=1M(1)i+1(Mi)esσn2I(s)dr\begin{split}P_{L}&=\mathbb{E}\left[\mathbb{I}({\rm{SINR}}_{L}(L)\geq\tau\right]=P\left({\rm{SINR}}_{L}(L)\geq\tau\right)\\ &=1-P\left(|\rho_{\psi_{L}}|^{2}\leq\frac{\tau\leavevmode\nobreak\ r_{L}^{\alpha}}{G_{1}^{2}}\left(\sigma_{n}^{2}+J\right)\right)\\ &\overset{a}{\simeq}1-\mathbb{E}_{r_{L}}\left[\left(1-e^{-\nu\frac{\tau}{G_{1}^{2}}r_{L}^{\alpha}\left(\sigma_{n}^{2}+J\right)}\right)^{M}\right]\\ &\overset{b}{=}\mathbb{E}_{r_{L}}\left[\sum_{i=1}^{M}(-1)^{i+1}\binom{M}{i}e^{-s\sigma_{n}^{2}}\mathcal{L}_{I}(s)\right]\\ &=\int_{0}^{\infty}f_{r_{L}}(r)\sum_{i=1}^{M}(-1)^{i+1}\binom{M}{i}e^{-s\sigma_{n}^{2}}\leavevmode\nobreak\ \mathcal{L}_{I}(s)dr\\ \end{split} (18)

where ν=M(M!)1M\nu=M(M!)^{-\frac{1}{M}}, s=iντG12rLαs=i\nu\frac{\tau}{G_{1}^{2}}r_{L}^{\alpha} and I(s)=𝔼I[esJ]\mathcal{L}_{I}(s)=\mathbb{E}_{I}[e^{-sJ}] is the Laplace transform of the interference. Step (a)(a) follows by the Alzer’s inequality and (b)(b) is obtained based on the binomial expansion. The Laplace transform of the interference is [27]

I(s)=𝔼I[esJ]=exp[2πλqr1rL(1𝔼g𝝍[esJ])r𝑑rΛ],\begin{split}\mathcal{L}_{I}(s)&=\mathbb{E}_{I}[e^{-sJ}]\\ &=\exp\bigg{[}-2\pi\lambda q\underbrace{\int_{r_{1}}^{r_{L}}(1-\mathbb{E}_{g_{{\bm{\psi}}}}[e^{-sJ}]){r}dr}_{\triangleq\Lambda}\bigg{]},\\ \end{split} (19)

where g𝝍=GTRx|ρ𝝍|2g_{{\bm{\psi}}}=G_{TRx}|\rho_{{\bm{\psi}}}|^{2} represents the combined effect of antenna gain and channel gain at the location 𝝍{\bm{\psi}}. The term Λ\Lambda is computed as:

Λ=r1rL(1𝔼g𝝍[esJ])r𝑑r=12[rL2δrL2𝔼g𝝍[E1+δ(sg𝝍rLα)]r12+δr12𝔼g𝝍[E1+δ(sg𝝍r1α)]],\begin{split}\Lambda&=\int_{r_{1}}^{r_{L}}\left(1-\mathbb{E}_{g_{{\bm{\psi}}}}[e^{-sJ}]\right)rdr\\ &=-\frac{1}{2}\Big{[}r_{L}^{2}-\delta r_{L}^{2}\mathbb{E}_{g_{{\bm{\psi}}}}\left[E_{1+\delta}\left(sg_{{\bm{\psi}}}r_{L}^{-\alpha}\right)\right]\\ &\quad-r_{1}^{2}+\delta r_{1}^{2}\mathbb{E}_{g_{{\bm{\psi}}}}\left[E_{1+\delta}\left(sg_{{\bm{\psi}}}r_{1}^{-\alpha}\right)\right]\Big{]},\end{split} (20)

where δ=2α\delta=\frac{2}{\alpha} and E1+δ(.)E_{1+\delta}(.) is the generalized exponential integral [28]. The term 𝔼g𝝍[E1+δ(sg𝝍rα)]\mathbb{E}_{g_{{\bm{\psi}}}}[E_{1+\delta}(sg_{{\bm{\psi}}}r^{-\alpha})] is given by

𝔼g𝝍[E1+δ(sg𝝍rα)]=sδΓ(δ)r2[𝔼gψ[gψδ]+α2p=1(s)p𝔼gψ[gψδ]rαpp!(pδ)],\begin{split}&\mathbb{E}_{g_{{\bm{\psi}}}}[E_{1+\delta}(sg_{{\bm{\psi}}}r^{-\alpha})]\\ =&\frac{s^{\delta}\Gamma\left(-\delta\right)}{r^{2}}\left[\mathbb{E}_{g_{\psi}}\left[g_{\psi}^{\delta}\right]+\frac{\alpha}{2}-\sum_{p=1}^{\infty}\frac{(-s)^{p}\cdot\mathbb{E}_{g_{\psi}}\big{[}g_{\psi}^{\delta}\big{]}}{r^{\alpha p}\cdot p!\cdot(p-\delta)}\right],\end{split} (21)

and the fractional moment of g𝝍g_{{\bm{\psi}}} is derived as:

𝔼gψ[gψδ]=𝔼|ρ𝝍|2,GTRx[(|ρ𝝍|2GTRx)δ]=Γ(M+δ)Γ(M)Mδ𝔼GTRx(GTRxδ)=Γ(M+δ)Γ(M)Mδ[G12δpa2+2(G1G2)δpapb+G22δpb2].\begin{split}&\mathbb{E}_{g_{{{\psi}}}}[g_{{{\psi}}}^{\delta}]=\mathbb{E}_{|\rho_{{\bm{\psi}}}|^{2},G_{TRx}}\left[\left(|\rho_{{\bm{\psi}}}|^{2}G_{TRx}\right)^{\delta}\right]\\ &=\frac{\Gamma(M+\delta)}{\Gamma(M)M^{\delta}}\cdot\mathbb{E}_{G_{TRx}}(G_{TRx}^{\delta})\\ &=\frac{\Gamma(M+\delta)}{\Gamma(M)M^{\delta}}\cdot\left[G_{1}^{2\delta}p_{a}^{2}+2(G_{1}G_{2})^{\delta}p_{a}p_{b}+G_{2}^{2\delta}p_{b}^{2}\right].\end{split} (22)

Hence, the LL-localizability can be numerically evaluated by substituting (19)-(22) into (18).

IV-B Approximation of Crame´\bf\acute{\rm e}r-Rao Lower Bound

We derive the AOA-based random CRLB using the Fisher information matrix (FIM), denoted by 𝐈(𝝍)\bm{{\rm{I}}}(\bm{\psi}) [4]

𝐈(𝝍)=(𝒇AOA(𝝍)𝝍)T𝑪AOA1𝒇AOA(𝝍)𝝍,\bm{{\rm{I}}}(\bm{\psi})=\left(\frac{\partial{\bm{f}}_{\rm{AOA}}(\bm{\psi})}{\partial\bm{\psi}}\right)^{T}\bm{C}_{\rm{AOA}}^{-1}\frac{\partial{\bm{f}}_{\rm{AOA}}(\bm{\psi})}{\partial\bm{\psi}}, (23)

where 𝑪AOA1\bm{C}_{\rm{AOA}}^{-1} represents the inverse of the noise covariance matrix and the derivative of 𝒇AOA(𝝍){\bm{f}}_{\rm{AOA}}(\bm{\psi}) which is the angle vector with respect to 𝝍\bm{\psi} are given by

𝑪AOA1=diag(1σAOA,12,1σAOA,22,,1σAOA,L2),𝒇AOA(𝝍)𝝍=[yy1(xx1)2+(yy1)2xx1(xx1)2+(yy1)2yy2(xx2)2+(yy2)2xx2(xx2)2+(yy2)2yyL(xxL)2+(yyL)2xxL(xxL)2+(yyL)2].\begin{split}\bm{C}_{\rm{AOA}}^{-1}&=\text{diag}\left(\frac{1}{\sigma_{{\rm{AOA}},1}^{2}},\frac{1}{\sigma_{{\rm{AOA}},2}^{2}},\cdots,\frac{1}{\sigma_{{\rm{AOA}},L}^{2}}\right),\\ \newline \\ \frac{\partial{\bm{f}}_{\rm{AOA}}(\bm{\psi})}{\partial\bm{\psi}}&=-\begin{bmatrix}\frac{y-y_{1}}{(x-x_{1})^{2}+(y-y_{1})^{2}}&\frac{x-x_{1}}{(x-x_{1})^{2}+(y-y_{1})^{2}}\\ \frac{y-y_{2}}{(x-x_{2})^{2}+(y-y_{2})^{2}}&\frac{x-x_{2}}{(x-x_{2})^{2}+(y-y_{2})^{2}}\\ \vdots&\vdots\\ \frac{y-y_{L}}{(x-x_{L})^{2}+(y-y_{L})^{2}}&\frac{x-x_{L}}{(x-x_{L})^{2}+(y-y_{L})^{2}}\end{bmatrix}.\end{split} (24)

Without loss of generality, σAOA\sigma_{\rm{AOA}} is considered to be a known quantity and assumed to be identical for each BSs, i.e., σAOA,1=σAOA,2==σAOA,L\sigma_{{\rm{AOA}},1}=\sigma_{{\rm{AOA}},2}=\cdots=\sigma_{{\rm{AOA}},L}[8]. The numerical value of σAOA\sigma_{\rm{AOA}} depends on the average SNR of the mmWave networks, denoted by SNR¯\rm{\overline{SNR}}, as follows

SNR¯=GcPtN0WTOT{\rm{\overline{SNR}}}=\frac{G_{c}P_{t}}{N_{0}W_{\rm{TOT}}} (25)

where GcG_{c} is the average channel gain, N0N_{0} is the spectral density of the WGN, and WTOTW_{\rm{TOT}} is the total system bandwidth [29, 30]. Hence, 𝐈(𝝍)\bm{{\rm{I}}}(\bm{\psi}) is

𝐈AOA(𝝍)=σAOA2[i=1L(yyi)2ri4i=1L(xxi)(yyi)ri4i=1L(xxi)(yyi)ri4i=1L(xxi)2ri4].\begin{split}&\bm{{\rm{I}}}_{\rm{AOA}}(\bm{\psi})\\ =&\sigma_{\rm{AOA}}^{2}\begin{bmatrix}\sum_{i=1}^{L}\frac{(y-y_{i})^{2}}{r_{i}^{4}}&-\sum_{i=1}^{L}\frac{(x-x_{i})(y-y_{i})}{r_{i}^{4}}\\ -\sum_{i=1}^{L}\frac{(x-x_{i})(y-y_{i})}{r_{i}^{4}}&\sum_{i=1}^{L}\frac{(x-x_{i})^{2}}{r_{i}^{4}}\end{bmatrix}.\end{split} (26)

To assess the distribution of the CRLB, we introduce the position error bound (PEB), which is the square root of the CRLB [31]. We will denote the PEB by SS and its closed-form expression can be obtained by using (26)

SCRLB=tr(𝑰AOA1(𝝍))=σAOALQ1Q2,\begin{split}S&\triangleq\sqrt{\rm{CRLB}}=\sqrt{{\rm{tr}}(\bm{I}_{\rm{AOA}}^{-1}(\bm{\psi}))}=\sigma_{\rm{AOA}}\frac{\sqrt{L}}{\sqrt{Q_{1}-Q_{2}}},\end{split} (27)

where Q1Q_{1} and Q2Q_{2} are

Q1=i=1L(yiyt)2ri4j=1L(xjxt)2rj4,Q2=i=1L(xixt)2(yiyt)2ri8.\begin{split}Q_{1}&=\sum_{i=1}^{L}\frac{(y_{i}-y_{t})^{2}}{r_{i}^{4}}\sum_{j=1}^{L}\frac{(x_{j}-x_{t})^{2}}{r_{j}^{4}},\\ Q_{2}&=\sum_{i=1}^{L}\frac{(x_{i}-x_{t})^{2}(y_{i}-y_{t})^{2}}{r_{i}^{8}}.\end{split} (28)

Since (27) and (28) are functions of 2L2L random variables, i.e., (xi,yi)\left(x_{i},y_{i}\right) for 1iL1\leq i\leq L, we need to simplify (28) using its asymptotic bounds, which will enable us to characterize the distribution of (27). In the following proposition, we derived a tight upper bound for Q1Q2Q_{1}-Q_{2} and through simulation, we verified that approximation error is less than 5%5\% for L8L\geq 8.

Proposition 1.

The random variable Q1Q2Q_{1}-Q_{2} from (27) can be upper bounded as follows

Q1Q214[(i=1L1ri2)2i=1L1ri4]Q_{1}-Q_{2}\leq\frac{1}{4}\left[\left(\sum_{i=1}^{L}\frac{1}{r_{i}^{2}}\right)^{2}-\sum_{i=1}^{L}\frac{1}{r_{i}^{4}}\right] (29)
Proof.

First, we derive the lower bound of Q2Q_{2} as follows

Q2(a)i=1L14[(xixt)2+(yiyt)2]2ri8=(b)i=1L14ri4,\begin{split}Q_{2}&\overset{(a)}{\geq}\sum_{i=1}^{L}\frac{\frac{1}{4}[(x_{i}-x_{t})^{2}+(y_{i}-y_{t})^{2}]^{2}}{r_{i}^{8}}\overset{(b)}{=}\sum_{i=1}^{L}\frac{1}{4r_{i}^{4}},\end{split} (30)

where the inequality (xixt)2+(yiyt)22(xixt)(yiyt)(x_{i}-x_{t})^{2}+(y_{i}-y_{t})^{2}\geq 2(x_{i}-x_{t})(y_{i}-y_{t}) is applied to step (a) and Cartesian coordinates is converted to polar coordinate in step (b). As shown in Fig. 2, the polar coordinate of (xi,yi)(x_{i},y_{i}) is given by

xixt=ricos(θi),yiyt=risin(θi).\begin{split}x_{i}-x_{t}=r_{i}\cos\left(\theta_{i}\right),\quad y_{i}-y_{t}=r_{i}\sin\left(\theta_{i}\right).\end{split} (31)

Next, we derive the upper bound of Q1Q_{1}

Q1=i=1L(yiyt)2ri4j=1L(xjxt)2rj4=i=1Lsin2(θi)ri2j=1Lcos2(θj)rj2,\begin{split}Q_{1}&=\sum_{i=1}^{L}\frac{(y_{i}-y_{t})^{2}}{r_{i}^{4}}\sum_{j=1}^{L}\frac{(x_{j}-x_{t})^{2}}{r_{j}^{4}}\\ &=\sum_{i=1}^{L}\frac{\sin^{2}\left(\theta_{i}\right)}{r_{i}^{2}}\sum_{j=1}^{L}\frac{\cos^{2}\left(\theta_{j}\right)}{r_{j}^{2}},\end{split} (32)

where we will maximize Q1Q_{1} with respect to the phase {θi}\{\theta_{i}\} for a given distance {θi}\{\theta_{i}\}. Then, (32) can be expressed as

Q1=i=1Lsin2(θi)ri2j=1L1sin2(θj)rj=ξ(j=1L1rj2ξ),\begin{split}Q_{1}&=\sum_{i=1}^{L}\frac{\sin^{2}\left(\theta_{i}\right)}{r_{i}^{2}}\sum_{j=1}^{L}\frac{1-\sin^{2}\left(\theta_{j}\right)}{r_{j}}=\xi\left(\sum_{j=1}^{L}\frac{1}{r_{j}^{2}}-\xi\right),\end{split} (33)

where we denote ξi=1Lsin2(θi)ri2\xi\triangleq\sum_{i=1}^{L}\frac{\sin^{2}\left(\theta_{i}\right)}{r_{i}^{2}}. The first order derivative of Q1Q_{1} is zero when ξ=12i=1L1ri2\xi^{\ast}=\frac{1}{2}\sum_{i=1}^{L}\frac{1}{r_{i}^{2}} and the second order derivative of Q1Q_{1} has a negative value at ξ\xi^{\ast} as follows

Q1ξ=i=1L1ri22ξ=0ξ=12i=1L1ri2,2Q1ξ2=2<0.\begin{split}\frac{\partial Q_{1}}{\partial\xi}&=\sum_{i=1}^{L}\frac{1}{r_{i}^{2}}-2\xi=0\leavevmode\nobreak\ \Rightarrow\leavevmode\nobreak\ \xi^{\ast}=\frac{1}{2}\sum_{i=1}^{L}\frac{1}{r_{i}^{2}},\\ \frac{\partial^{2}Q_{1}}{\partial\xi^{2}}&=-2<0.\end{split} (34)

Hence, the upper bound of Q1Q_{1} is given by

Q1max{θi}Q1|ξ=ξ=(12i=1L1ri2)2.\begin{split}Q_{1}\leq\max_{\{\theta_{i}\}}Q_{1}\bigg{|}_{\xi=\xi^{\ast}}=\left(\frac{1}{2}\sum_{i=1}^{L}\frac{1}{r_{i}^{2}}\right)^{2}.\end{split} (35)

We obtain (29) by (30) and (35). This completes the proof. ∎

Based on Proposition 1, the PEB SS is lower bounded by

S2σAOAL(i=1L1ri2)2i=1L1ri4=2σAOALi,j=1ijL1ri2rj2.\begin{split}S&\geq\frac{2\sigma_{\rm{AOA}}\cdot\sqrt{L}}{\sqrt{\left(\sum_{i=1}^{L}\frac{1}{r_{i}^{2}}\right)^{2}-\sum_{i=1}^{L}\frac{1}{r_{i}^{4}}}}=\frac{2\sigma_{\rm{AOA}}\cdot\sqrt{L}}{\sqrt{\sum\limits_{\begin{subarray}{c}\scriptstyle i,j=1\\ \scriptstyle i\neq j\end{subarray}}^{L}\frac{1}{r_{i}^{2}r_{j}^{2}}}}.\end{split} (36)

In the following assumption, we introduced an approximation of (36), which provides a tractable asymptotic bound of SS. Through simulation, we justified the approximation accuracy.

Assumption 1.

Assume that the link distances are sorted in an ascending order, i.e., R=[r1,,rL]R=\left[r_{1},\cdots,r_{L}\right] and r1r2rLr_{1}\leq r_{2}\leq\cdots\leq r_{L}. The denominator of (36) can be approximated as follows

Di,j=1ijL1ri2rj2L(L1)rL/44,D\triangleq\sum\limits_{\begin{subarray}{c}\scriptstyle i,j=1\\ \scriptstyle i\neq j\end{subarray}}^{L}\frac{1}{r_{i}^{2}r_{j}^{2}}\approx\frac{L(L-1)}{r_{\lceil L/4\rceil}^{4}}, (37)

where rL/4r_{\lceil L/4\rceil} is the L/4\lceil L/4\rceil-th link distance in the ordered set R=[r1,,rL]R=\left[r_{1},\cdots,r_{L}\right] and LL is the number of participating BSs.

Remark 1.

We validated (37) through simulation, where we repeated the realization of the anchor nodes 1010 million times. Since the set RR is sorted, the term DD in (37) is bounded by

L(L1)rL4i,j=1ijL1ri2rj2L(L1)r14.\begin{split}\frac{L\left(L-1\right)}{r_{L}^{4}}\leq\sum\limits_{\begin{subarray}{c}\scriptstyle i,j=1\\ \scriptstyle i\neq j\end{subarray}}^{L}\frac{1}{r_{i}^{2}r_{j}^{2}}\leq\frac{L\left(L-1\right)}{r_{1}^{4}}.\end{split} (38)

We attempt to find the kk-th term rkr_{k} in set RR that provides the most accurate approximation to DD. To solve this problem, we used heuristic approach and evaluated the mutual information between DD and the random variable rkr_{k} for a given LL as follows

min1kL𝔼[|DL(L1)rk4|2]max1kLI(D;rk|L=l),\begin{split}\min_{1\leq k\leq L}\mathbb{E}\left[\bigg{\lvert}D-\frac{L(L-1)}{r_{k}^{4}}\bigg{\rvert}^{2}\right]\leavevmode\nobreak\ \Leftrightarrow\leavevmode\nobreak\ \max_{1\leq k\leq L}I(D;r_{k}|L=l),\end{split} (39)

where the mutual information conditioned on LL is defined as

I(D;rk|L=l)=h(D|L=l)h(D|rk,L=l),I\left(D;r_{k}|L=l\right)=h\left(D|L=l\right)-h\left(D|r_{k},L=l\right), (40)

and the differential entropies are given by

h(D|L=l)=dDfD(d|l)log2fD(d|l),h(D|rk,L=l)=rkRk,dDfD;rk(d|r,l)log2fD(d|r,l),\begin{split}h(D|L=l)&=-\sum\limits_{d\in\rm{D}}f_{D}(d|\mathit{l})\log_{2}{f_{D}(d|\mathit{l})},\\ h(D|r_{k},L=l)&=-\sum\limits_{\begin{subarray}{c}r_{k}\in R_{k},\\ d\in\rm{D}\end{subarray}}f_{D;r_{k}}(d|r,l)\log_{2}{f_{D}(d|r,l)},\end{split} (41)

where RkR_{k} and D\rm{D} are the supports of rkr_{k} and dd, respectively[32]. This approach, which was motivated by [33], can search for the rlr_{l} that contains the most information of DD. Through an extensive simulation across a range of LL, we observed that the L/4\lceil L/4\rceil-th distance maximizes the mutual information as illustrated in Fig. 3, which justifies Assumption 1, and thus we can use the L/4\lceil L/4\rceil-th distance to approximate DD.

Refer to caption

Fig. 3: Impact of distance selection on mutual information
Refer to caption
Fig. 4: Probability of KσKKK+σKK^{\prime}-\sigma_{K}\leq K\leq K^{\prime}+\sigma_{K}
Refer to caption
Fig. 5: Original CRLB compared with approximate CRLB

Based on (36) and (37), we can approximate SS by

S2σAOAL1rL/42,S\approx\frac{2\sigma_{\rm{AOA}}}{\sqrt{L-1}}\leavevmode\nobreak\ r_{\lceil L/4\rceil}^{2}, (42)

where SS is a function of rL/4r_{\lceil L/4\rceil}. In the following proposition, we derived the distribution of SS using order statistic.

Proposition 2.

Assume that the number of participating BSs LL, the variance of the range error σAOA\sigma_{\rm{AOA}}, and the link distance to the closest node r1r_{1} and furthest node rLr_{L} are known. Then, the CDF of PEB SS is given by

FS(s|L,σAOA)=FrL/4[s2L1σAOA|L,σAOA],\begin{split}F_{S}\left(s|L,\sigma_{\rm{AOA}}\right)=F_{r_{\lceil L/4\rceil}}\left[\sqrt{\frac{s}{2}\cdot\frac{\sqrt{L-1}}{\sigma_{\rm{AOA}}}}\leavevmode\nobreak\ \bigg{|}L,\sigma_{\rm{AOA}}\right],\end{split} (43)

where Frn(r)F_{r_{n}}\left(r\right) is the CDF of the nn-th order statistic.

Proof.

First, the PDF of the nn-th order statistic frn(r)f_{r_{n}}(r) is [34]

frn(r)=Lfrl(r)(L1n1)Frl(r)n1(1Frl(r))Ln,\begin{split}f_{r_{n}}(r)=Lf_{r_{l}}(r)\binom{L-1}{n-1}F_{r_{l}}(r)^{n-1}\left(1-F_{r_{l}}(r)\right)^{L-n},\end{split} (44)

where frl(r)f_{r_{l}}(r) and Frl(r)F_{r_{l}}(r) are given in (2). The CDF Frn(r)F_{r_{n}}\left(r\right) can be derived by integrating (44) as follows

Frn(r)=0rLfrn(r)𝑑r=j=nL(Lj)Frl(r)j(1Frl(r))Lj=j=nL(Lj)(r2rL2r12)j(1r2rL2r12)Lj.\begin{split}F_{r_{n}}(r)&=\int_{0}^{r_{L}}f_{r_{n}}(r)dr\\ &=\sum_{j=n}^{L}\binom{L}{j}F_{r_{l}}(r)^{j}\left(1-F_{r_{l}}(r)\right)^{L-j}\\ &=\sum_{j=n}^{L}\binom{L}{j}\left(\frac{r^{2}}{r_{L}^{2}-r_{1}^{2}}\right)^{j}\left(1-\frac{r^{2}}{r_{L}^{2}-r_{1}^{2}}\right)^{L-j}.\end{split} (45)

Hence, the CDF of SS, denoted by FS(s|L,σaoa)=P[Ss|L,σaoa]F_{S}(s|L,\sigma_{aoa})=P[S\leq s|L,\sigma_{aoa}] is readily computed as

FS(s|L,σAOA)=P[rns2L1σAOA|L,σAOA],\begin{split}F_{S}\left(s|L,\sigma_{\rm{AOA}}\right)&=P\left[r_{n}\leq\sqrt{\frac{s}{2}\frac{\sqrt{L-1}}{\sigma_{\rm{AOA}}}}\bigg{|}L,\sigma_{\rm{AOA}}\right],\end{split} (46)

where the PDF of SS can be computed by differentiating (46). This completes the proof. ∎

Remark 2.

We evaluated the approximation accuracy of (36) and (42) through Monte Carlo simulation. Let us denote

K=i=1Lsin2θiri2j=1Lcos2θjrj2,K=14(i=1L1ri2)2,\begin{split}K=&\sum_{i=1}^{L}\frac{\sin^{2}\theta_{i}}{r_{i}^{2}}\sum_{j=1}^{L}\frac{\cos^{2}\theta_{j}}{r_{j}^{2}},\quad K^{\prime}=\frac{1}{4}\left(\sum_{i=1}^{L}\frac{1}{r_{i}^{2}}\right)^{2},\end{split} (47)

where KK is equal to Q1Q_{1} in proposition 1 and KK^{\prime} represents the upper bound of Q1Q_{1} in (35). We utilized Monte Carlo simulation of 1010 million realizations to compute the empirical distribution of KK and determine the value of P[KσKKK+σK]P\left[K^{\prime}-\sigma_{K}\leq K\leq K^{\prime}+\sigma_{K}\right], where the σK\sigma_{K} is the standard deviation of KK. Fig. 5 shows the probability P[KσKKK+σK]P\left[K^{\prime}-\sigma_{K}\leq K\leq K^{\prime}+\sigma_{K}\right] versus a range of LL. It is observed that KK^{\prime} can approximate QQ with high accuracy. For L10L\geq 10, the approximation accuracy is above 96%\%.

Furthermore, we compared the CRLB computed by using (27), (36), (42), the 1-st and the L-th ordered distance in Fig. 5. It is observed that the approximations of CRLB using the LL-th and 11-st distances cannot approach the original CRLB. However, the asymptotic bound using (36) and the approximation based on (42) closely match the original CRLB curve, which justifies Proposition 1 and Assumption 1.

V Simulation Results

Refer to caption
Fig. 6: Impact of the network load on LL-localizability when α=4\alpha=4, Nt=64N_{t}=64 and M=5M=5
Refer to caption
Fig. 7: Impact of path-loss on LL-localizability when α=4\alpha=4, Nt=64N_{t}=64 and q=0.75q=0.75
Refer to caption
Fig. 8: Impact of Nakagami fading parameter on LL-localizability when α=2.1\alpha=2.1, Nt=64N_{t}=64 and q=0.75q=0.75
Refer to caption
Fig. 9: Impact of number of BSs on the distribution of SS when α=2\alpha=2, Nt=64N_{t}=64, M=5M=5 and q=0.75q=0.75
Refer to caption
Fig. 10: Impact of MM (M=3,5,7M=3,5,7) on the distribution of SS when α=2\alpha=2, Nt=64N_{t}=64, L=5L=5, q=0.75q=0.75 and the impact of NtN_{t} (Nt=32,64,128N_{t}=32,64,128) when α=2\alpha=2, M=1M=1, L=5L=5 and q=0.75q=0.75
Refer to caption
Fig. 11: Impact of path-loss on the distribution of SS when L=5L=5, Nt=64N_{t}=64, M=5M=5 and q=0.75q=0.75

In this section, we evaluate the LL-localizability and random AOA-based CRLB for mmWave networks, compare the simulation results to numerical results, and investigate the effect of network parameters on the localization performance. We used MATLAB to randomly simulate a realization of the node deployment 1×1061\times 10^{6} times. It is assumed that the BSs are randomly distributed by a homogeneous PPP with node density λ=2/3×5002m2\lambda=2/\sqrt{3}\times 500^{2}m^{2}, bandwidth WTOT=1W_{\rm{TOT}}=1 GHz, transmit power PT=1P_{T}=1 Watt, antenna spacing d=λw/4d=\lambda_{w}/4, path-loss intercept β=(λw/4π)2\beta=\left(\lambda_{w}/4\pi\right)^{2}, and main-lobe gain G1=1G_{1}=1 and side-lobe gain G2=0.2G_{2}=0.2 with its associate probability pa=0.4p_{a}=0.4 and pb=0.6p_{b}=0.6, respectively. Since the NLOS interference is ignored in our model, we choose a σAOA\sigma_{\rm{AOA}} that accounts for an angular spread under NLOS conditions during simulation.

V-A LL-localizability Analysis

In Figs. 11-11, we investigate how the network parameters, including network loads, path-loss exponent and Nakagami fading parameter, affect the performance of LL-localizability. Fig. 11 compares the LL-localizability PLP_{L} versus the SINR threshold for different network loads qq. The simulation results are plotted in dotted curves, where as the analytical results are represented by solid curves with a marker. All of the numerical results indicate that the analytical results accurately match the simulation results, justifying the analytical derivation. We observed that increasing the network load leads to a decrease in PLP_{L}. It means that network design should be optimized so that there is a sufficient number of BSs to meet the localization requirement. Fig. 11 demonstrates the impact of path-loss on the LL-localizability. As the path-loss exponent increases, the transmitted power across the mmWave link will significantly decline, causing a significant drop in PLP_{L}. In Fig. 11, we observe the impact of Nakagami fading parameter MM on PLP_{L}. Since the Nakagami channel becomes deterministic as the MM parameter increases, the LL-localizability escalates with higher MM values.

V-B Random AOA-based CRLB Analysis

In Figs. 11-11, we evaluate the distribution of SS for various network parameter configurations. Since the approximation of CRLB using rL/4r_{\lceil L/4\rceil} provides an accurate approximation to the original CRLB, we used the approximation based on the L/4\lceil L/4\rceil-th distance across Figs. 11-11. In Fig. 11, we examine the impact of the number of participating BSs LL on the distribution of SS. This is accomplished by varying the number of activated BSs transmitting during a localization procedure. It is observed that the value of P[Sabscissa]P[S\leq abscissa] increases for a larger LL. Since the localization error reduces as the number of BSs increases, a network designer looking to improve the localization accuracy may aim to optimize the network environment to ensure a sufficient number of BSs participate in the localization procedure.

Fig. 11 compares the localization performance for various Nakagami fading parameter MM and the number of antenna elements NtN_{t}. It is observed that increasing MM parameter escalates P[Sabscissa]P[S\leq abscissa], which improves the localization performance. Furthermore, we demonstrate how the number of antenna elements NtN_{t} affects the localization performance. As the number of antenna elements increases, the normalized noise power σn2=σT2+σout2βPtNt\sigma_{n}^{2}=\frac{\sigma_{T}^{2}+\sigma_{{\rm{out}}}^{2}}{\beta P_{t}N_{t}} will be reduced, which leads to an increase of P[Sabscissa]P[S\leq abscissa]. This indicates that the localization performance can be enhanced by adding more antenna elements in the BSs, which raises the implementation cost for each BS. Hence, the network designer should find an optimum trade-off between choosing a suitable number of antennas in the BS and enhancing the localization performance. Fig. 11 shows the impact of path-loss on the performance of the mmWave-based localization systems. As the path-loss exponent increases, the value of P[Sabscissa]P[S\leq abscissa] decline, which is a similar pattern to Fig. 11.

VI Conclusion

This paper presents LL-localizability and random AOA-based CRLB for mmWave wireless network, where we used stochastic geometry to account for all possible positioning scenarios. We derived the LL-localizability and random CRLB for AOA localization while considering the flat-top antenna radiation pattern and Nakagami fading. We provided numerical results to validate the analytical derivation and investigated the impact of various network parameters, e.g., network load, path-loss, fading parameters, number of BSs, number of antenna elements, on the localization performance. The analytical framework developed in this paper offers an accurate tool to evaluate the localization performance of mmWave wireless networks, without relying on numerical simulation. The network operators can use the asymptotic bounds to optimize the network parameters and find the best deployment of the BSs to ensure the localization performance. In our future work, we will apply the approximation method to evaluate the performances of TOA, TDOA and RSS based localization and investigate the impact of various channel models.

References

  • [1] F. Khelifi, A. Bradai, A. Benslimane, P. Rawat, M. Atri, "A Survey of Localization Systems in Internet of Things", Mobile Network and Application, pp761–785, 2019.
  • [2] W. Roh, J. Seol, J. Park, B. Lee, J. Lee, Y. Kim, J. Cho, K. Cheun, F. Aryanfar, "Millimeter-wave beamforming as an enabling technology for 5G cellular communications: Theoretical feasibility and prototype results," IEEE Communications Magazine, vol. 52, no. 2, pp. 106-113, Feb. 2014.
  • [3] A. Alkhateeb, S. Alex, P. Varkey, Y. Li, Q. Qu and D. Tujkovic, "Deep Learning Coordinated Beamforming for Highly-Mobile Millimeter Wave Systems," IEEE Access, vol. 6, pp. 37328-37348, 2018.
  • [4] H. C. So, "Source localization: algorithms and analysis", Handbook of Position Location: Theory, Practice and Advances, Chapter 3, S.A.Zekavat and M.Buehrer, Eds., Wiley-IEEE Press, 2019.
  • [5] M. Haenggi, "Stochastic Geometry for Wireless Networks," Cambridge, U.K.: Cambridge Univ. Press, 2013.
  • [6] Y. J. Chun, S. L. Cotton, H. S. Dhillon, F. J. Lopez-Martinez, J. F. Paris and S. K. Yoo, "A Comprehensive Analysis of 5G Heterogeneous Cellular Systems Operating Over κ\kappaμ\mu Shadowed Fading Channels," in IEEE Transactions on Wireless Communications, vol. 16, no. 11, pp. 6995-7010, Nov. 2017.
  • [7] J. Schloemann, H. S. Dhillon and R. M. Buehrer, "Toward a Tractable Analysis of Localization Fundamentals in Cellular Networks," IEEE Transactions on Wireless Communications, vol. 15, no. 3, pp. 1768-1782, March. 2016.
  • [8] C. E. O’Lone, H. S. Dhillon and R. M. Buehrer, "A Statistical Characterization of Localization Performance in Wireless Networks," IEEE Transactions on Wireless Communications, vol. 17, no. 9, pp. 5841-5856, Sept. 2018.
  • [9] J. Khalife, C. Sevinç and Z. M. Kassas, "Performance Evaluation of TOA Positioning in Asynchronous Cellular Networks Using Stochastic Geometry Models," IEEE Wireless Communications Letters, May. 2020.
  • [10] H. Elsawy, W. Dai, M. Alouini and M. Z. Win, "Base Station Ordering for Emergency Call Localization in Ultra-Dense Cellular Networks," IEEE Access, vol. 6, pp. 301-315, 2018.
  • [11] K. Radnosrati, G. Hendeby, C. Fritsche, F. Gunnarsson and F. Gustafsson, "Performance of OTDOA positioning in narrowband IoT systems," in 2017 IEEE 28th Annual International Symposium on Personal, Indoor, and Mobile Radio Communications (PIMRC), Montreal, Canada, pp. 1-7, 2017.
  • [12] J. He and H. C. So, "A Hybrid TDOA-Fingerprinting-Based Localization System for LTE Network," in IEEE Sensors Journal, vol. 20, no. 22, pp. 13653-13665, Nov. 2020.
  • [13] A. Pin, R. Rinaldo, A. Tonello, C. Marshall, M. Driusso, A. Biason, "LTE ranging measurement using uplink opportunistic signals and the SAGE algorithm," in 2019 27th European Signal Processing Conference (EUSIPCO), A Coruna, Spain, pp. 1-5, 2019.
  • [14] L. Ma, N. Jin, Y. Cui and Y. Xu, "LTE user equipment RSRP difference elimination method using multidimensional scaling for LTE fingerprint-based positioning system," in 2017 IEEE International Conference on Communications (ICC), Paris, France, pp. 1-6, 2017.
  • [15] G. Çelik, H. Çelebi and G. Tuna, "A novel RSRP-based E-CID positioning for LTE networks," in 2017 13th International Wireless Communications and Mobile Computing Conference (IWCMC), Valencia, Spain pp. 1689-1692, 2017.
  • [16] F. Lemic, J. Martin, C. Yarp, D. Chan, V. Handziski, R. Brodersen, G. Fettweis, A. Wolisz, J. Wawrzynek, "Localization as a feature of mmWave communication," 2016 International Wireless Communications and Mobile Computing Conference (IWCMC), Paphos, 2016, pp. 1033-1038.
  • [17] K. Pahlavan, "Indoor geolocation science and technology," Communications Magazine, IEEE, vol. 40, no. 2, pp. 112–118, 2002.
  • [18] F. Wen, H. Wymeersch, B. Peng, W. P. Tay, H. C. So, and D. Yang, "A survey on 5G massive MIMO localization," Digit. Signal Process, 2019.
  • [19] H. Wang, C. Wang, T. Zheng and T. Q. S. Quek, "Impact of Artificial Noise on Cellular Networks: A Stochastic Geometry Approach," in IEEE Transactions on Wireless Communications, vol. 15, no. 11, pp. 7390-7404, Nov. 2016.
  • [20] B. Huang, T. Li, B. D. O. Anderson and C. Yu, "On the performance limit of sensor localization," 2011 50th IEEE Conference on Decision and Control and European Control Conference, Orlando, FL, 2011, pp. 7870-7875.
  • [21] D. Moltchanov, "Distance distributions in random networks," Ad Hoc Networks, vol. 10, no. 6, pp. 1146-1166, Aug. 2012.
  • [22] S. Srinivasa and M. Haenggi, “Distance distributions in finite uniformly random networks: Theory and applications,” IEEE Trans. on Vehicular Technology, vol. 59, no. 2, pp. 940–949, 201
  • [23] M. R. Akdeniz, Y. Liu, M. K. Samimi, S. Sun, S. Rangan, T. S. Rappaport, E. Erkip, "Millimeter Wave Channel Modeling and Cellular Capacity Evaluation," IEEE Journal on Selected Areas in Communications, vol. 32, no. 6, pp. 1164-1179, June. 2014.
  • [24] G. Lee, Y. Sung and J. Seo, "Randomly-Directional Beamforming in Millimeter-Wave Multiuser MISO Downlink," IEEE Transactions on Wireless Communications, vol. 15, no. 2, pp. 1086-1100, Feb. 2016.
  • [25] G. Lee, Y. Sung and M. Kountouris, "On the Performance of Random Beamforming in Sparse Millimeter Wave Channels," IEEE Journal of Selected Topics in Signal Processing, vol. 10, no. 3, pp. 560-575, April. 2016.
  • [26] Y. Wu and C. Han, "Interference and Coverage Analysis for Indoor Terahertz Wireless Local Area Networks," 2019 IEEE Globecom Workshops (GC Wkshps), Waikoloa, HI, USA, 2019, pp. 1-6.
  • [27] J. G. Andrews, F. Baccelli, and R. K. Ganti, "A tractable approach to coverage and rate in cellular networks," IEEE Transactions on Wireless Communications, vol. 59, no. 11, pp. 3122–3134, Nov. 2011.
  • [28] D. Zwillinger, Table of Integrals, Series, and Products. Amsterdam, The Netherlands: Elsevier, 2014.
  • [29] M. Giordani, M. Mezzavilla, A. Dhananjay, S. Rangan and M. Zorzi, "Channel Dynamics and SNR Tracking in Millimeter Wave Cellular Systems," 22th European Wireless Conference, Oulu, Finland, 2016, pp. 1-8.
  • [30] R. Koirala, B. Denis, D. Dardari and B. Uguen, "Localization bound based beamforming optimization for multicarrier mmWave MIMO," 2017 14th Workshop on Positioning, Navigation and Communications (WPNC), Bremen, 2017, pp. 1-6.
  • [31] D. B. Jourdan, D. Dardari, and M. Z. Win, "Position error bound for UWB localization in dense cluttered environments," in Proc. IEEE Int. Conf. Commun., Istanbul, Turkey, Jun. 2006, pp. 3705–3710.
  • [32] T. M. Cover and J. A. Thomas, Elements of Information Theory. New York, NY, USA: Wiley, 1991, chapter. 2–9.
  • [33] J. Schloemann, H. S. Dhillon and R. M. Buehrer, "A Tractable Metric for Evaluating Base Station Geometries in Cellular Network Localization," in IEEE Wireless Communications Letters, vol. 5, no. 2, pp. 140-143, April 2016.
  • [34] H. A. David and H. N. Nagaraja, Order Statistics. Hoboken, NJ: John Wiley and Sons, Inc., 3rd ed. 2003.
  • [35] H. Elshaer, M. N. Kulkarni, F. Boccardi, J. G. Andrews and M. Dohler, "Downlink and Uplink Cell Association With Traditional Macrocells and Millimeter Wave Small Cells," in IEEE Transactions on Wireless Communications, vol. 15, no. 9, pp. 6244-6258, Sept. 2016.
  • [36] D. B. Jourdan and N. Roy, "Optimal sensor placement for agent localization," in Proc. IEEE/ION Position, Location, Navigat. Symp., Coronado, CA, USA, Apr. 2006, pp. 128–139.
  • [37] C. Chang and A. Sahai, "Estimation bounds for localization," in Proc. 1st Annu. IEEE Commun. Soc. Conf. Sensor Ad Hoc Commun. Netw., Santa Clara, CA, USA, Oct. 2004, pp. 415–424.