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

Analysis of Vehicular Safety Messaging in Cellular Networks

Chang-Sik Choi and François Baccelli Chang-sik Choi is with Qualcomm Inc., Bridgewater, NJ 08807. Francois Baccelli is with Wireless Networking Communication Group, Department of Electrical and Computer Engineering and Department of Mathematics, The University of Texas at Austin, Austin, TX 78712 (email: chang-sik.choi@utexas.edu, baccelli@math.utexas.edu)
Abstract

This paper concerns the performance of vehicle-to-everything (V2X) communications. More precisely, we analyze the broadcast of safety-related V2X communications in cellular networks where base stations and vehicles are assumed to share the same spectrum and vehicles broadcast their safety messages to neighboring users. We model the locations of vehicles as a Poisson line Cox point process and the locations of users as a planar Poisson point process. We assume that users are associated with their closest base stations when there is no vehicle within a certain distance ρ\rho. On the other hand, users located within a distance ρ\rho from vehicles are associated with the vehicles to receive their safety messages. We quantify the properties of this vehicle-prioritized association using the stochastic geometry framework. We derive the fractions of users that receive safety messages from vehicles. Then, we obtain the expression for the signal-to-interference ratio of the typical user evaluated on each association type. To address the impact of vehicular broadcast on the cellular network, the paper also derives the effective rate offered to the typical user in this setting.

Index Terms:
Vehicle-to-Everything (V2X), Vehicular broadcast, Vehicular safety messaging, Network modeling, Poisson line process, Cox point process, Boolean model, Signal-to-interference ratio, effective data rate, Volume fraction

I Introduction

I-A Motivation and Related Work

Device-to-device (D2D) technology has been used in various applications including file transfer [1], emergency service [2], and intelligent transportation systems (ITS)[3]. In the context of cellular 5G NR vehicle-to-all (V2X) applications [4], vehicle or pedestrian user equipment (UE) is enabled to transmit and receive data to/from nearby vehicular or roadside unit (RSU) UE using direct sidelink communications in the presence of existing cellular uplink or downlink [5, 6]. The messages transmitted through sidelink communications include basic safety information as well as traffic information [7]. In safety applications, it is essential for other vehicular or pedestrians UEs within a certain distance to be able to decode the data transmitted through sidelink even when this type of communications coexist with the existing cellular infrastructure [3, 5, 6, 8, 4]. This paper analyzes the performance of sidelinks and cellular communications when sidelinks are prioritized over cellular for users close to vehicles.

The representation of the locations of D2D transceivers based on planar Poisson point processes has been widely used in the literature (See [9, 10, 11, 12, 13] and references therein). The typical user performance was analytically derived in [14]. Moreover, various network protocols and techniques such as power control [15, 16], multi-input-multi-output [17, 18], and access control [19] were investigated in this context. The planar Poisson point process is tractable because its points are spatially independent [20, 21]. In networks with vehicles, on the other hand, vehicles exhibit a linear co-location and their motions are constrained by road layouts. The Poisson point process, however, is unable to capture such spatial constraints [21]. As an alternative, Poisson-line Cox point processes were used to model vehicles on roads [22, 23, 24, 25, 26, 27]. In Cox-based vehicle models, road networks are first modeled by a stationary Poisson line process and, conditionally on lines, vehicles are modeled by Poisson point processes on the lines. These models inherently capture the relationship between vehicles and their corresponding road structure.

In particular, the Cox-based model is useful to the analysis of V2X networks when vehicular networks coexist with cellular networks [8, 4]. In [23, 24, 28, 27], the V2X network was represented by two distinct spatial architectures; the cellular network is modeled by a planar Poisson point process and the vehicle network is modeled by an independent Poisson-line Cox point process . The distributions of signal-to-interference-plus-noise ratio (SINR) of typical links were analyzed in these papers. Particularly, [24] derived the SINR distributions of all existing typical pairs in such networks: links from vehicle base stations to vehicle users, from vehicle base stations to planar users, from planar base stations to planar users, and from planar base stations to vehicle users. In [24], users are assumed to be associated with their nearest transmitters to increase the data rate or coverage area [29, 11].

In safety applications, each vehicle broadcasts its basic safety information such as its location, speed, and acceleration to nearby pedestrians or vehicles. Specifically, if pedestrians or cellular user are within a certain distance from a vehicular UE, they are required to decode the messages from vehicles [3, 8, 4, 5, 6, 7, 30]. For instance, when ITS with vehicular safety messaging is deployed with a cellular architecture, the users are prioritized to be associated with vehicles over cellular base stations as long as they are close to vehicles. The aim of this paper is to evaluate the reliability of the communications from vehicles to users as well as the effective rate of downlink from cellular base stations to users. To the best of our knowledge, the interplay between sidelink broadcast and downlink unicast has not been investigated within the stochastic geometry framework.

I-B Contributions

Modeling of vehicular broadcast in cellular networks: We model the locations of base stations as a planar Poisson point process of intensity λb\lambda_{b}, and the location of cellular downlink users as an independent planar Poisson point process of intensity λu\lambda_{u}. To represent the linear patterns of vehicles on roads, we use an isotropic Poisson line process to model the road layout and then use Poisson point processes conditionally on the line process to model the locations of vehicles. We assume that control messages from vehicles have users decode vehicular safety messages when the users are within a distance ρ\rho from vehicles. Fig. 1 illustrates such vehicle-prioritized association region.

Derivation of network performance from a typical user perspective: The stationary framework of the proposed model allows us to derive the network performance of a typical user, which corresponds to the network performance spatially averaged over all users in the network. Specifically, we consider a V2X system where the typical user association is determined by the locations of vehicles and base stations with respect to the typical user. Using the mean area fraction of the Boolean model—which quantifies the relative size of the vehicular broadcast region in the Euclidean plane—we derive the probability that a typical user at the origin is prioritized to receive the vehicular broadcast message or is associated with a cellular base station for downlink communications, respectively. Conditional on the association of the typical user, we derive its signal-to-interference (SIR) distribution in terms of an integral formula. The impact of vehicular broadcasts on cellular unicasts is characterized as the effective data rate of cellular links, which accounts for the long-term average rate that the cellular users are offered through downlink unicast, assuming that each downlink base station is equally shared by all of its associated users. For this, we derive a formula for the mean number of users associated with each base station, by quantifying the area of the vehicle association region inside a Voronoi cell of the base station point process.

II System Model

This section discusses the spatial model, the vehicle-prioritized association principle, the propagation model, and the network performance metrics.

II-A Spatial Model

We model the random locations of cellular users, namely UEs in cellular networks, as a planar Poisson point process Φu\Phi_{u} with intensity λu\lambda_{u}. The base stations of the cellular networks are modeled by an independent planar Poisson point process Φb\Phi_{b} with intensity λb.\lambda_{b}. The locations of users and base stations are fixed (do not change overtime). In addition, we assume the density of users is high, i.e., λu>λb,\lambda_{u}>\lambda_{b}, and also assume that there is at least one active downlink user in each base station cell.

We model the locations of vehicles as a Cox point process Φv\Phi_{v} [25] based on a Poisson line process. Roads are modeled by a stationary and isotropic Poisson line process Φl\Phi_{l}. This line process is given by a Poisson point process on the cylinder 𝐂:=×(0,π)\mathbf{C}:=\operatorname{\mathbb{R}}\times(0,\pi) with intensity λl/π\lambda_{l}/\pi [21]. Specifically, a point of the cylinder Poisson point process, say (r,θ)𝐂,(r,\theta)\in\mathbf{C}, produces an undirected line on the Euclidean plane 2\operatorname{\mathbb{R}}^{2}. Here, rr corresponds to the algebraic displacement from the origin to the line and θ\theta corresponds to the angle between the line and the positive xx-axis in the counterclockwise direction. Conditionally on the line point process, vehicles are modeled by an independent one-dimensional Poisson point process, say ϕ(r,θ),\phi(r,\theta), with intensity μ\mu on each line. Consequently, the proposed vehicle point process is stationary and the spatial density of vehicles per unit area is λlμ/π{\lambda_{l}\mu}/{\pi}[25]. As shown in the literature including [25], the Cox-based vehicle point process captures the relationship between vehicles and corresponding road layouts.

This paper assumes that vehicles move at a constant speed vv along the lines on which they are located. For simplicity, we assume that the vehicles’ moving directions are independently chosen with probability half. Once vehicles’ moving directions are chosen at time t=0t=0, they are maintained forever. In the remainder of this paper, the vehicle point process at time tt is denoted by Φv;t.\Phi_{v;t}.

II-B Channel Model

Let dd denote the distance between a transmitter and its designated receiver, or receivers (for broadcast). In this paper, we assume a rich scattering around cellular users such that the received signal power is characterized by the product of a distance-based path loss and a small-scale Rayleigh fading [31, 32].

Time is assumed to be slotted. For each time slot, the received signal power is given by pHdαpHd^{-\alpha} where pp is the transmit power of the transmitter, HH is an exponential random variable with mean one, and α\alpha is the path loss exponent assumed to be greater than two. The transmit powers of base stations and vehicles are denoted by pbp_{b} and pv,p_{v}, respectively.

Refer to caption
Figure 1: The vehicle association region is given by Boolean model in blue and the rest of the plane is subdivided in base station cells. Users in the vehicle association region are configured to decode safety messages from vehicles. We consider λl=5/km,\lambda_{l}=5/\text{km}, μ=1/km\mu=1/\text{km}, λb=1/km2,\lambda_{b}=1/\text{km}^{2}, and ρ=50\rho=50 meters.
Refer to caption
Figure 2: Illustration of vehicle association region and base station cells. We consider λl=4/km,\lambda_{l}=4/\text{km}, μ=0.5/km\mu=0.5/\text{km}, λb=1/km2,\lambda_{b}=1/\text{km}^{2}, and ρ=150\rho=150 meters. Solid black lines indicate the boundary of vehicular association region.

II-C Vehicle Priotizied Association Principle

Note that in ITS, it is essential for cellular users to be able to decode sidelink messages if there is a vehicle within some distance [7]. Thus, in this paper, we define the user association as follows: each user is associated with its nearest base station. However, if a cellular user is within some distance ρ\rho from a vehicle, that user is associated with the corresponding vehicle. If there are two such vehicles, the user is associated with the closest one.

Remark 1.

In practice, vehicle-prioritized association can be implemented using sidelink control messages. For instance, vehicles broadcast messages are preceded by vehicle control messages. Any user who receives a sidelink control message from a vehicle is required to try to decode the safety messages from the corresponding vehicle. In this context, the radius of the disk ρ\rho specifies the maximum distance to the users who try to decode the safety message.

Figs. 1 and 2 represent the association regions in the Euclidean plane. The vehicle association region is illustrated as the union of disks centered at vehicles. Users within this region are associated with their corresponding vehicles. The vehicle association region is given by

𝒟(t)=XiΦv;tBXi(ρ),\operatorname{\mathcal{D}}(t)=\bigcup_{X_{i}\in\Phi_{v;t}}B_{X_{i}}(\rho), (1)

where Bx(r)B_{x}(r) denotes the disk of radius rr centered at x2x\in\operatorname{\mathbb{R}}^{2}. On the other hand, the cellular association region is given by

2𝒟(t).\operatorname{\mathbb{R}}^{2}\setminus\operatorname{\mathcal{D}}(t). (2)
Remark 2.

In this paper, downlink and sidelink transmissions are assumed to differ in the way they deliver their messages. Specifically, downlink transmissions from base stations to cellular users are assumed to be unicasts; each base station selects one of its associated users at each time slot and serves it. On the other hand, sidelink transmissions from vehicles to users are assumed to be broadcasts; in other words, each vehicle broadcasts its message to nearby users and all of its users attempt to decode the message.

TABLE I: Spatial Model and Description
Notation and distribution Description
Ψ\Psi\sim Poisson(λu)(\lambda_{u}) User point process
Φb\Phi_{b}\sim Poisson(λb)(\lambda_{b}) Cellular base stations
Φv;tPoisson line Cox\Phi_{v;t}\sim\text{Poisson line Cox} Vehicles
𝒟(t)\operatorname{\mathcal{D}}(t)\sim Boolean on Φv;t\Phi_{v;t} Area assoc. w/ vehicles
2𝒟(t)\operatorname{\mathbb{R}}^{2}\setminus\operatorname{\mathcal{D}}(t) Area assoc. w/ base stations
Ψ𝒟(t)\Psi\cap\operatorname{\mathcal{D}}(t) Users assoc. w/ vehicles
Ψ(2𝒟(t))\Psi\cap(\operatorname{\mathbb{R}}^{2}\setminus\operatorname{\mathcal{D}}(t)) Users assoc. w/ base station
Ψv;tUnif. on disks of ρ at Φv;t\Psi_{v;t}\sim\text{Unif. on disks of }\rho\text{ at }\Phi_{v;t} Users served by vehicles at time t
Ψb;t\Psi_{b;t}\sim Unif. on 𝒱𝒟(t)\operatorname{\mathcal{V}}\setminus\operatorname{\mathcal{D}}(t) at Φb\Phi_{b} Users served by base stations at time t

II-D Preliminary: Typical Cell and Zero Cell

The Voronoi tessellation 𝒱\operatorname{\mathcal{V}} w.r.t. Φ\Phi is the sequence of random sets as follows:

𝒱={𝒱i}i={x2s.t.xXi<xXj,XjΦXi}i\displaystyle\operatorname{\mathcal{V}}=\{\operatorname{\mathcal{V}}_{i}\}_{i\in\operatorname{\mathbb{Z}}}=\{x\in\operatorname{\mathbb{R}}^{2}s.t.\|x-X_{i}\|<\|x-X_{j}\|,\forall X_{j}\in\Phi\setminus X_{i}\}_{i\in\operatorname{\mathbb{Z}}} (3)

The points {Xi}i\{X_{i}\}_{i\in\operatorname{\mathbb{Z}}} are the nuclei of the Voronoi cells. Based on the association principle in Section II-C, the cellular association region is the Voronoi tessellation w.r.t. the base station point process minus vehicle association region. This is described as non-shared areas in figs. 1 and 2.

Let us consider the Palm distribution of the base station point process Φ\Phi [33], which has a typical point at the origin. Under this Palm distribution, the cell containing the typical point at the origin is referred to as a typical cell [34].

Refer to caption
Refer to caption
Figure 3: Illustration of the typical cell (upper) and the zero cell (lower). The typical cell center is the origin; the zero cell center is not the origin. The intensity of the Poisson point process is given as 5050, for illustration.

One may similarly consider the Voronoi tessellation of the base station point process Φ\Phi under the stationary distribution of the user Poisson point process. Note that the origin is not an element of the base station point process. Instead, there exists a cell 𝒱j\operatorname{\mathcal{V}}_{j} that contains the origin (i.e., the typical user) and this cell is referred to as the zero cell. Fig. 3 illustrates the typical cell (upper figure) and the zero cell (lower figure) w.r.t. the base station Poisson point processes of intensity 50/km250/\text{km}^{2}, respectively. The zero cell will be used to derive the effective rate and then characterize the interplay between the cellular downlink unicast and vehicular sidelink broadcast.

II-E Network Performance Metrics

We first focus on the reliability of sidelink and downlink cellular communications, respectively. For each, reliability is captured by the coverage probability of the typical user. Then, we derive the effective data rate of the typical user, offered by downlink communications.

II-E1 Coverage Probability

We first use the Palm distribution of the user point process to feature a typical user at the origin. Note that the network performance seen by the typical user coincides with the network performance averaged over all users in the network [33].

The coverage probability of the typical cellular downlink user 𝐏Ψ0(SIR>τ,DL)\operatorname{\mathbf{P}}_{\Psi}^{0}(\operatorname{\textrm{SIR}}>\tau,\text{DL}) is defined by

𝐏Ψ0(pbHX0αXiΦv;tpvHXiα+YiΦbX0pbHYiα>τ,0𝒟(t)),\displaystyle\operatorname{\mathbf{P}}_{\Psi}^{0}\left(\left.\frac{p_{b}H\|X_{0}\|^{-\alpha}}{\sum_{X_{i}\in\Phi_{v;t}}p_{v}H{\|X_{i}\|}^{-\alpha}+\sum_{Y_{i}\in\Phi_{b}\setminus X_{0}}p_{b}H{\|Y_{i}\|}^{-\alpha}}>\tau\right.,0\notin\operatorname{\mathcal{D}}(t)\right), (4)

where τ\tau is the decoding threshold, XX_{\star} is the location of the base station that is closest to the origin, and 𝐏Ψ0\operatorname{\mathbf{P}}_{\Psi}^{0} indicates that the metric is derived under the Palm distribution of Ψ\Psi, namely for the typical user at the origin. In the proposed network, we assume that interference dominates thermal noise. Thus, we investigate the SIR coverage probability.

Similarly, the coverage probability of the typical sidelink user 𝐏Ψ0(SIR>τ,SL)\operatorname{\mathbf{P}}_{\Psi}^{0}(\operatorname{\textrm{SIR}}>\tau,\text{SL}) is defined by

𝐏Ψ0(pvHXαXiΦv;tXpvHXiα+YiΦbpbHYiα>τ,0𝒟(t)),\displaystyle\operatorname{\mathbf{P}}_{\Psi}^{0}\left(\left.\frac{p_{v}H\|X_{\star}\|^{-\alpha}}{\sum_{X_{i}\in\Phi_{v;t}\setminus X_{\star}}p_{v}H{\|X_{i}\|}^{-\alpha}+\sum_{Y_{i}\in\Phi_{b}}p_{b}H{\|Y_{i}\|}^{-\alpha}}>\tau\right.,0\in\operatorname{\mathcal{D}}(t)\right), (5)

where XX_{\star} is the location of the nearest vehicle.

By combining (4) and (5), the coverage probability of the typical user is

𝐏Ψ0(SIR>τ)=𝐏Ψ0(SIR>τ,DL)+𝐏Ψ0(SIR>τ,SL).\operatorname{\mathbf{P}}_{\Psi}^{0}(\operatorname{\textrm{SIR}}>\tau)=\operatorname{\mathbf{P}}_{\Psi}^{0}(\operatorname{\textrm{SIR}}>\tau,\text{DL})+\operatorname{\mathbf{P}}_{\Psi}^{0}(\operatorname{\textrm{SIR}}>\tau,\text{SL}). (6)

II-E2 Effective Data Rate

The (load-balanced) effective downlink data rate is defined as the spatial average of the long-term achievable rate (bits/sec/Hz) of each cellular user, provided that the time resource of each base station is equally shared by all of its associated downlink users111A simple example: at each time slot, each base station chooses and serves one user out of its associated users..

Conditionally on the downlink association, the mean achievable rate of the typical user is denoted by 𝐄Ψ0[log2(1+SIR)|DL]\operatorname{\mathbf{E}}_{\Psi}^{0}[\log_{2}(1+\operatorname{\textrm{SIR}})|\text{DL}]. Here, we shall use the effective rate per user, which is defined as the mean achievable rate of the typical user, divided by the mean number of users that share the same base station. In addition, from the typical user’s perspective, this effective rate is multiplied by the probability that that the typical user has a downlink association. Therefore, the effective data rate is defined as follows:

𝒯\displaystyle{\operatorname{\mathcal{T}}} =𝐏(DL)𝐄Ψ0[log2(1+SIR)|DL]𝐄Ψ0[Ψ(𝒱Z𝒟(t))]=𝐄Ψ0[log2(1+SIR),DL]𝐄Ψ0[Ψ(𝒱Z𝒟(t))],\displaystyle=\operatorname{\mathbf{P}}(\text{DL})\cdot\frac{\operatorname{\mathbf{E}}_{\Psi}^{0}[\log_{2}(1+\operatorname{\textrm{SIR}})|\text{DL}]}{\operatorname{\mathbf{E}}_{\Psi}^{0}[\|\Psi(\operatorname{\mathcal{V}}_{Z}\setminus\operatorname{\mathcal{D}}(t))\|]}=\frac{\operatorname{\mathbf{E}}_{\Psi}^{0}[\log_{2}(1+\operatorname{\textrm{SIR}}),\text{DL}]}{\operatorname{\mathbf{E}}_{\Psi}^{0}[\|\Psi(\operatorname{\mathcal{V}}_{Z}\setminus\operatorname{\mathcal{D}}(t))\|]}, (7)

where 𝐄Ψ0[Ψ(𝒱Z𝒟(t))]\operatorname{\mathbf{E}}_{\Psi}^{0}[\|\Psi(\operatorname{\mathcal{V}}_{Z}\setminus\operatorname{\mathcal{D}}(t))\|] denotes the expected number of users that share the base station Z{Z} and 𝒱Z𝒟(t)\operatorname{\mathcal{V}}_{Z}\setminus\operatorname{\mathcal{D}}(t) denotes the Voronoi cell of base station Z{Z} minus the vehicle associaiton region 𝒟(t)\operatorname{\mathcal{D}}(t).

TABLE II: Performance metrics
Notation Description
𝐏Ψ0(SIR>τ,SL)\operatorname{\mathbf{P}}_{\Psi}^{0}(\operatorname{\textrm{SIR}}>\tau,\text{SL}) Sidelink coverage probability
𝐏Ψ0(SIR>τ,DL)\operatorname{\mathbf{P}}_{\Psi}^{0}(\operatorname{\textrm{SIR}}>\tau,\text{DL}) Downlink coverage probability
𝐏Ψ0(0𝒟(t))\operatorname{\mathbf{P}}_{\Psi}^{0}(0\in\operatorname{\mathcal{D}}(t)) Sidelink association probability
𝐏Ψ0(0𝒟(t))\operatorname{\mathbf{P}}_{\Psi}^{0}(0\notin\operatorname{\mathcal{D}}(t)) Downlink association probability
𝒯\operatorname{\mathcal{T}} Downlink effective rate per user

III Result: Coverage Probability

This section analyzes the reliability of the sidelink and downlink communications. We derive the coverage probabilities of the typical user. Since the typical user at the origin is associated with either a vehicle or with a base station, the interference and SIR seen by the typical user varies w.r.t. the association type. For instance, when the typical user is associated with a vehicle, the origin is contained in a disk (sidelink association). In other words, there exists a vehicle within a distance ρ\rho that covers the origin. On the other hand, when the typical user is associated with a base station, the origin is not contained in any disk.

III-A User Association

Here, we focus on the derivation of the probability that the typical user is associated with a vehicle or with a base station. The vehicle association region depends on time as shown in Eq. (1). However, we will show below that the association probability is not a function of time.

Theorem 1.

The probability that the typical user is associated with a vehicle is

𝐏Ψ0(SL):=𝐏Ψ0(0𝒟)=1exp(2λl0ρ1exp(2μρ2u2)du).\operatorname{\mathbf{P}}_{\Psi}^{0}(\text{SL}):=\operatorname{\mathbf{P}}_{\Psi}^{0}(0\in\operatorname{\mathcal{D}})=1-\exp\left(-2\lambda_{l}\int_{0}^{\rho}1-\exp(-2\mu\sqrt{\rho^{2}-u^{2}})\mathop{}\!\mathrm{d}u\right). (8)

The probability that the typical user is associated with a base station is

𝐏Ψ0(DL):=𝐏Ψ0(0𝒟)=exp(2λl0ρ1exp(2μρ2u2)du).\operatorname{\mathbf{P}}_{\Psi}^{0}(\text{DL}):=\operatorname{\mathbf{P}}_{\Psi}^{0}(0\notin\operatorname{\mathcal{D}})=\exp\left(-2\lambda_{l}\int_{0}^{\rho}1-\exp(-2\mu\sqrt{\rho^{2}-u^{2}})\mathop{}\!\mathrm{d}u\right). (9)

Note that both Eqs are not functions of time.

Proof:

The probability that the typical user is associated with a vehicle is the same as the probability that there is at least one vehicle at a distance less than ρ\rho from the origin. Hence,

𝐏Ψ0(0𝒟(t))\displaystyle\operatorname{\mathbf{P}}_{\Psi}^{0}(0\in\operatorname{\mathcal{D}}(t)) =1𝐏Ψ0(Xi>ρ,XiΦv;t)\displaystyle=1-\operatorname{\mathbf{P}}_{\Psi}^{0}(\|X_{i}\|>\rho,\forall X_{i}\in\Phi_{v;t})
=1𝐏(Xi>ρ,XiΦv;t)\displaystyle=1-\operatorname{\mathbf{P}}(\|X_{i}\|>\rho,\forall X_{i}\in\Phi_{v;t})
=1𝐄[XiΦv;t𝟙Xi>ρ],\displaystyle=1-\operatorname{\mathbf{E}}\left[\prod_{X_{i}\in\Phi_{v;t}}\operatorname{\mathbbm{1}}_{\|X_{i}\|>\rho}\right], (10)

where we used the fact that Ψ\Psi and Φv;t\Phi_{v;t} are independent. Φv;t\Phi_{v;t} is the collection of point processes conditionally on Φl.\Phi_{l}. Thus, the vehicle point process can be written as follows:

Φv;t=(ri,θi)Φlϕ(ri,θi;t)=riΦlϕ(ri;t),\displaystyle\Phi_{v;t}=\sum_{(r_{i},\theta_{i})\in\Phi_{l}}\phi(r_{i},\theta_{i};t)=\sum_{r_{i}\in\Phi_{l}}\phi(r_{i};t), (11)

where ϕ(ri,θ;t)\phi({r_{i},\theta;t}) denotes the Poisson point process on the line parameterized by (ri,θi)(r_{i},\theta_{i}) at time t.t. For simplicity, we also denote the Poisson point process by ϕ(ri;t)\phi(r_{i};t). At time zero, ϕ(ri;0)\phi({r_{i};0}) is given by a one-dimensional Poisson point process with intensity μ\mu. Based on the considered mobility model, every vehicle randomly chooses its moving direction on its line (ri,θi)(r_{i},\theta_{i}) at time 0. At time t,t, the Poisson point process with intensity μ/2\mu/2 is translated by vtvt in one direction; similarly, the Poisson point process with intensity μ/2\mu/2 is translated by vtvt in the other direction. Based on the displacement theorem [9], the point process ϕ(ri;t)\phi({r_{i};t}) at any time t>0t>0 is a Poisson point process with intensity μ\mu. Finally, the underlying line process Φl\Phi_{l} is time-invariant and we have that the vehicle point process at time tt and the vehicle point process at time 0 are equal in distribution; Φv;t=dΦv;0.\Phi_{v;t}\stackrel{{\scriptstyle d}}{{=}}\Phi_{v;0}. As a result, we write the vehicle point process as

Φv=riΦlϕ(ri).\Phi_{v}=\sum_{r_{i}\in\Phi_{l}}\phi(r_{i}). (12)

Due to the stationary and time-invariant properties of Φv;t,\Phi_{v;t}, the expectation in Eq. (10) is

𝐄Φv;t[XiΦv;t𝟙Xi>ρ]\displaystyle\operatorname{\mathbf{E}}_{\Phi_{v;t}}\left[\prod_{X_{i}\in\Phi_{v;t}}\operatorname{\mathbbm{1}}_{\|X_{i}\|>\rho}\right] =𝐄Φv[XiΦv𝟙Xi>ρ]\displaystyle=\operatorname{\mathbf{E}}_{\Phi_{v}}\left[\prod_{X_{i}\in\Phi_{v}}\operatorname{\mathbbm{1}}_{\|X_{i}\|>\rho}\right]
=𝐄Φl[𝐄ϕ(ri)[Xjϕ(ri)𝟙Xj>ρ|Φl]]\displaystyle=\operatorname{\mathbf{E}}_{\Phi_{l}}\left[\operatorname{\mathbf{E}}_{\phi(r_{i})}\left[\left.\prod_{X_{j}\in\phi{(r_{i})}}\operatorname{\mathbbm{1}}_{\|X_{j}\|>\rho}\right|\Phi_{l}\right]\right]
=𝐄Φl[riΦl𝐄ϕ(ri)[Xjϕ(ri)𝟙Xj>ρ|Φl]]\displaystyle=\operatorname{\mathbf{E}}_{\Phi_{l}}\left[\prod_{r_{i}\in\Phi_{l}}\operatorname{\mathbf{E}}_{\phi(r_{i})}\left[\left.\prod_{X_{j}\in\phi(r_{i})}\operatorname{\mathbbm{1}}_{\|X_{j}\|>\rho}\right|\Phi_{l}\right]\right]
=𝐄Φl[riΦl𝐄ϕ(0)[Zjϕ(0)𝟙ra+Zja>ρ|Φl]]\displaystyle=\operatorname{\mathbf{E}}_{\Phi_{l}}\left[\prod_{r_{i}\in\Phi_{l}}\operatorname{\mathbf{E}}_{\phi(0)}\left[\left.\prod_{Z_{j}\in\phi(0)}\operatorname{\mathbbm{1}}_{\|r\vec{a}+Z_{j}\vec{a}^{\perp}\|>\rho}\right|\Phi_{l}\right]\right]
=𝐄Φl[riΦl𝐄ϕ(0)[Zϕ(0)𝟙Z>ρ2r2|Φl]],\displaystyle=\operatorname{\mathbf{E}}_{\Phi_{l}}\left[\prod_{r_{i}\in\Phi_{l}}\operatorname{\mathbf{E}}_{\phi(0)}\left[\left.\prod_{Z\in\phi(0)}\operatorname{\mathbbm{1}}_{\|Z\|>\sqrt{\rho^{2}-r^{2}}}\right|\Phi_{l}\right]\right], (13)

where we replace the Poisson point process ϕ(ri)\phi({r_{i}}) with the Poisson point process ϕ(0,θi)\phi(0,\theta_{i}) using its displacement ri.r_{i}. In the above, a\vec{a} is the vector from the origin to the line with index ii. Then, we have

𝐄ϕ(0)[Zjϕ(0)𝟙Zj>ρ2r2]=exp(2μρ2r2).\operatorname{\mathbf{E}}_{\phi(0)}\left[\prod_{Z_{j}\in\phi(0)}\operatorname{\mathbbm{1}}_{\|Z_{j}\|>\sqrt{\rho^{2}-r^{2}}}\right]=\exp(-2\mu\sqrt{\rho^{2}-r^{2}}). (14)

As a result, we have

𝐏Ψ0(0𝒟(t))\displaystyle\operatorname{\mathbf{P}}_{\Psi}^{0}(0\in\operatorname{\mathcal{D}}(t)) =1𝐄Φl[XiΦv𝟙{Xi>ρ}]\displaystyle=1-\operatorname{\mathbf{E}}_{\Phi_{l}}\left[\prod_{X_{i}\in\Phi_{v}}\operatorname{\mathbbm{1}}_{\{\|X_{i}\|>\rho\}}\right]
=1𝐄Φl[riΦl|ri|<ρexp(2μρ2r2)]\displaystyle=1-\operatorname{\mathbf{E}}_{\Phi_{l}}\left[\prod_{r_{i}\in\Phi_{l}}^{|r_{i}|<\rho}\exp(-2\mu\sqrt{\rho^{2}-r^{2}})\right]
=1exp(2λl0ρ1exp(2μρ2r2)dr),\displaystyle=1-\exp\left(-2\lambda_{l}\int_{0}^{\rho}1-\exp(-2\mu\sqrt{\rho^{2}-r^{2}})\mathop{}\!\mathrm{d}r\right), (15)

where we use the probability generating functional of the cylinder Poisson point process with intensity λl/π\lambda_{l}/\pi[20]. We use 𝐏(0𝒟(t))=1𝐏(0𝒟)\operatorname{\mathbf{P}}(0\notin\operatorname{\mathcal{D}}(t))=1-\operatorname{\mathbf{P}}(0\in\operatorname{\mathcal{D}}) to complete the proof. ∎

Fig. 4 plots the probability that the typical user at the origin is associated with a vehicle. The figure shows the way that the probability of vehicle association increases as the density μ\mu increases. It also shows that the linear density μ\mu yields a diminishing return of the association probability. In the asymptotic regime where the linear density μ\mu is very high, we have Eq. (8) as 𝐏Ψ0(SL)=1e2λlρ\operatorname{\mathbf{P}}_{\Psi}^{0}(\text{SL})=1-e^{-2\lambda_{l}\rho}. This formula corresponds to the probability that the disk of radius ρ\rho centered at the origin intersects with the Poisson line process of intensity λl.\lambda_{l}.

Refer to caption
Figure 4: This illustrates the probability that the typical user is associated with sidelink broadcasts.
Remark 3.

We can interpret Theorem 1 in an ergodic sense [33]. For a given geometry of roads, base stations, and sidelink broadcast distance ρ,\rho, Eq. (8) gives the probability that the typical user is covered by the vehicle broadcast. In other words, it gives the instantaneous fraction of users that are receiving the sidelink broadcast. In addition, in an ergodic sense, the sidelink association probability Eq. (8) also corresponds to the fraction of the time that a typical user is associated with a sidelink vehicle. Similarly, the downlink association probability corresponds to the fraction of time that the user is associated with a downlink base station.

III-B SIR Coverage of the Typical Cellular Downlink

This section derives the SIR coverage probability of downlink.

Theorem 2.

The downlink coverage probability of the typical user 𝐏(SIR>τ,0𝒟)\operatorname{\mathbf{P}}(\operatorname{\textrm{SIR}}>\tau,0\notin\operatorname{\mathcal{D}}) is

0K0(x)exp(πλbK1(x)2λlK2(x)2λlK3(x))dx,\int_{0}^{\infty}K_{0}(x)\exp(-\pi\lambda_{b}K_{1}(x)-2\lambda_{l}K_{2}(x)-2\lambda_{l}K_{3}(x))\mathop{}\!\mathrm{d}x, (16)

where

K0(x)=2πλbx,\displaystyle K_{0}(x)=2\pi\lambda_{b}x,
K1(x)=x2+2xτxαr1α1+τxαrαdr,\displaystyle K_{1}(x)=x^{2}+2\int_{x}^{\infty}\frac{\tau x^{\alpha}r^{1-\alpha}}{1+\tau x^{\alpha}r^{-\alpha}}\mathop{}\!\mathrm{d}r,
K2(x)=0ρ1exp(2μρ2r22μρ2r2τxαη(r2+t2)α21+τxαη(r2+u2)α2du)dr,\displaystyle K_{2}(x)=\int_{0}^{\rho}1-\exp\left(-2\mu\sqrt{\rho^{2}-r^{2}}-2\mu\int_{\sqrt{\rho^{2}-r^{2}}}^{\infty}\frac{\tau x^{\alpha}\eta{(r^{2}+t^{2})}^{-\frac{\alpha}{2}}}{1+\tau x^{\alpha}\eta{(r^{2}+u^{2})}^{-\frac{\alpha}{2}}}\mathop{}\!\mathrm{d}u\right)\mathop{}\!\mathrm{d}r,
K3(x)=ρ1exp(2μ0τxαη(r2+u2)α21+τxαη(r2+u2)α2du)dr.\displaystyle K_{3}(x)=\int_{\rho}^{\infty}1-\exp\left(-2\mu\int_{0}^{\infty}\frac{\tau x^{\alpha}\eta{(r^{2}+u^{2})}^{-\frac{\alpha}{2}}}{1+\tau x^{\alpha}\eta{(r^{2}+u^{2})}^{-\frac{\alpha}{2}}}\mathop{}\!\mathrm{d}u\right)\mathop{}\!\mathrm{d}r.

We define the transmit power ratio η=dpv/pb\eta\stackrel{{\scriptstyle d}}{{=}}p_{v}/p_{b}

Proof:

The probability that the typical user is not in 𝒟\operatorname{\mathcal{D}} and its SIR is greater than τ\tau is

𝐏Ψ0(SIR>τ,0𝒟)\displaystyle\operatorname{\mathbf{P}}_{\Psi}^{0}(\operatorname{\textrm{SIR}}>\tau,0\notin\operatorname{\mathcal{D}})
=𝐄Φl[𝐏(H>τX0αpv1I,0𝒟|Φl)]\displaystyle=\operatorname{\mathbf{E}}_{\Phi_{l}}\left[\operatorname{\mathbf{P}}\left(\left.H>\tau{\|X_{0}\|}^{\alpha}p_{v}^{-1}I,0\notin\operatorname{\mathcal{D}}\right|\Phi_{l}\right)\right]
=𝐄Φl0𝐏(H>τxαpb1I,|X0=x,0𝒟,Φl)f(x)dx\displaystyle=\operatorname{\mathbf{E}}_{\Phi_{l}}\int_{0}^{\infty}\operatorname{\mathbf{P}}\left(\left.H>\tau x^{\alpha}p_{b}^{-1}I,\right|\|X_{0}\|=x,0\notin\operatorname{\mathcal{D}},\Phi_{l}\right)f(x)\mathop{}\!\mathrm{d}x
=𝐄Φl0𝐄[exp(τxαpb1I)X0=x,0𝒟,Φl]f(x)dx,\displaystyle=\operatorname{\mathbf{E}}_{\Phi_{l}}\int_{0}^{\infty}\operatorname{\mathbf{E}}\left[\exp(-\tau x^{\alpha}p_{b}^{-1}I)|\|X_{0}\|=x,0\notin\operatorname{\mathcal{D}},\Phi_{l}\right]f(x)\mathop{}\!\mathrm{d}x, (17)

where I=XiΦbB0(x)+ΦvB0(ρ)piHiXiαI=\sum_{X_{i}\in\Phi_{b}\setminus B_{0}(x)+\Phi_{v}\setminus B_{0}(\rho)}p_{i}H_{i}\|X_{i}\|^{-\alpha} is the shot-noise process seen by the typical user and X0\|X_{0}\| is the distance from the typical user to its nearest base station. In Eq. (17), f(x)f(x) is the density function of X0\|X_{0}\| on the event 0𝒟,0\notin\operatorname{\mathcal{D}}, conditional on Φl\Phi_{l}, namely,

f(x)dx\displaystyle f(x)\mathop{}\!\mathrm{d}x =𝐏(xX0x+dx,0𝒟|Φl)\displaystyle=\operatorname{\mathbf{P}}(x\leq\|X_{0}\|\leq x+\mathop{}\!\mathrm{d}x,0\notin\operatorname{\mathcal{D}}|\Phi_{l})
=𝐄[XiΦb𝟙xXix+dx𝟙Φb(B0(Xi))=0𝟙Φv(B0(ρ))=0|Φl]\displaystyle=\operatorname{\mathbf{E}}\left[\left.\sum_{X_{i}\in\Phi_{b}}\operatorname{\mathbbm{1}}_{x\leq\|X_{i}\|\leq x+\mathop{}\!\mathrm{d}x}\operatorname{\mathbbm{1}}_{\Phi_{b}(B_{0}(\|X_{i}\|))=0}\operatorname{\mathbbm{1}}_{\Phi_{v}(B_{0}(\rho))=0}\right|\Phi_{l}\right]
=02π𝟙xzx+dx𝐏z0(Φb(B0(z))=0)𝐏z0(Φv(B0(ρ))=0|Φl)λbxdxdθ\displaystyle=\int_{0}^{2\pi}\operatorname{\mathbbm{1}}_{x\leq z\leq x+\mathop{}\!\mathrm{d}x}\operatorname{\mathbf{P}}_{z}^{0}(\Phi_{b}(B_{0}(z))=0)\operatorname{\mathbf{P}}_{z}^{0}(\Phi_{v}(B_{0}(\rho))=0|\Phi_{l})\lambda_{b}x\mathop{}\!\mathrm{d}x\mathop{}\!\mathrm{d}\theta
=2πλbxdxeπλbx2riΦl|ri|<ρ𝐄ϕ(ri)[Xjϕ(ri)𝟙Xj>ρ]\displaystyle=2\pi\lambda_{b}x\mathop{}\!\mathrm{d}xe^{-\pi\lambda_{b}x^{2}}\prod_{r_{i}\in\Phi_{l}}^{|r_{i}|<\rho}\operatorname{\mathbf{E}}_{\phi(r_{i})}\left[\prod_{X_{j}\in\phi(r_{i})}\operatorname{\mathbbm{1}}_{\|X_{j}\|>\rho}\right]
=2πλbxdxeπλbx2riΦl|ri|<ρ𝐄ϕ(ri)[Yjϕ(0)𝟙Yj>ρ2ri2]\displaystyle=2\pi\lambda_{b}x\mathop{}\!\mathrm{d}xe^{-\pi\lambda_{b}x^{2}}\prod_{r_{i}\in\Phi_{l}}^{|r_{i}|<\rho}\operatorname{\mathbf{E}}_{\phi(r_{i})}\left[\prod_{Y_{j}\in\phi(0)}\operatorname{\mathbbm{1}}_{\|Y_{j}\|>\sqrt{\rho^{2}-r_{i}^{2}}}\right]
=2πλbxdxeπλbx2riΦl|ri|<ρe2μρ2ri2.\displaystyle=2\pi\lambda_{b}x\mathop{}\!\mathrm{d}xe^{-\pi\lambda_{b}x^{2}}\prod_{r_{i}\in\Phi_{l}}^{|r_{i}|<\rho}e^{-2\mu\sqrt{\rho^{2}-r_{i}^{2}}}. (18)

The integrand of Eq. (17) is the Laplace transform of the interference from vehicles outside of the disk B0(ρ)B_{0}(\rho) and from base station outside of the disk B0(x)B_{0}(x) conditional on X0=x\|X_{0}\|=x and Φl\Phi_{l}. Specifically, the integrand is

𝐄[exp(τxαpb1XkΦbB0(x)pbHkXkατxαpb1XlΦvB0(ρ)pvHlXlα)X0=x,0𝒟,Φl].\displaystyle\operatorname{\mathbf{E}}\left[\left.\exp\left(-\tau x^{\alpha}p_{b}^{-1}\sum_{X_{k}\in\Phi_{b}\setminus B_{0}(x)}p_{b}H_{k}\|X_{k}\|^{-\alpha}-\tau x^{\alpha}p_{b}^{-1}\sum_{X_{l}\in\Phi_{v}\setminus B_{0}(\rho)}p_{v}H_{l}\|X_{l}\|^{-\alpha}\right)\right|\|X_{0}\|=x,0\notin\operatorname{\mathcal{D}},\Phi_{l}\right].

By using the independence of Φl\Phi_{l} and Φb\Phi_{b} and by applying the Laplace transform of the interference from cellular base stations outside of the disk of radius xx [9], we obtain

𝐄[exp(τxαXkΦbB0(x)HkXkα)X0=x,0𝒟,Φl]=e2πλbxτxαr1α1+τxαrαdr.\displaystyle\operatorname{\mathbf{E}}\left[\left.\exp\left(-\tau x^{\alpha}\sum_{X_{k}\in\Phi_{b}\setminus B_{0}(x)}H_{k}\|X_{k}\|^{-\alpha}\right)\right|\|X_{0}\|=x,0\notin\operatorname{\mathcal{D}},\Phi_{l}\right]=e^{-2\pi\lambda_{b}\int_{x}^{\infty}\frac{\tau x^{\alpha}r^{1-\alpha}}{1+\tau x^{\alpha}r^{-\alpha}}\mathop{}\!\mathrm{d}r}. (19)

Using the independence and the power ratio η=pv/pb\eta\stackrel{{\scriptstyle\triangle}}{{=}}p_{v}/p_{b}, we have

𝐄[exp(τxαηXlΦvB0(ρ)HlXlα)|0𝒟,Φl]=\displaystyle\operatorname{\mathbf{E}}\left[\left.\exp\left(-\tau x^{\alpha}\eta\sum_{X_{l}\in\Phi_{v}\setminus B_{0}(\rho)}H_{l}\|X_{l}\|^{-\alpha}\right)\right|0\notin\operatorname{\mathcal{D}},\Phi_{l}\right]= riΦl|ri|<ρ𝐄ϕ(ri)[Ymϕ(ri)Ym>ρeτxαηYmα]\displaystyle\prod_{r_{i}\in\Phi_{l}}^{|r_{i}|<\rho}\operatorname{\mathbf{E}}_{\phi(r_{i})}\left[\prod_{Y_{m}\in\phi(r_{i})}^{\|Y_{m}\|>\rho}e^{-\tau x^{\alpha}\eta\|Y_{m}\|^{-\alpha}}\right]
×riΦl|ri|>ρ𝐄ϕ(ri)[Ynϕ(ri)eτxαηYnα].\displaystyle\times\prod_{r_{i}\in\Phi_{l}}^{|r_{i}|>\rho}\operatorname{\mathbf{E}}_{\phi(r_{i})}\left[\prod_{Y_{n}\in\phi(r_{i})}e^{-\tau x^{\alpha}\eta\|Y_{n}\|^{-\alpha}}\right]. (20)

In distribution, the points {Ym}m\{Y_{m}\}_{m} of the Poisson point process ϕ(ri)\phi(r_{i}) can be represented in terms of the points {Zm}m\{Z_{m}\}_{m} of the Poisson point process ϕ(0)\phi(0) through {Ym=(Zm2+ri2)12}m.\{\|Y_{m}\|=(Z_{m}^{2}+r_{i}^{2})^{\frac{1}{2}}\}_{m}. Hence, we have

riΦl|ri|<ρ𝐄ϕ(ri)[Ymϕ(ri)Ym>ρeτxαηYmα|Φl]\displaystyle\prod_{r_{i}\in\Phi_{l}}^{|r_{i}|<\rho}\operatorname{\mathbf{E}}_{\phi(r_{i})}\left[\left.\prod_{Y_{m}\in\phi(r_{i})}^{\|Y_{m}\|>\rho}e^{-\tau x^{\alpha}\eta\|Y_{m}\|^{-\alpha}}\right|\Phi_{l}\right] =riΦl|ri|<ρ|𝐄ϕ(0)[Zmϕ(0)|Zm|>ρ2ri211+τxαη(ri2+Zm2)α2]\displaystyle=\prod_{r_{i}\in\Phi_{l}}^{|r_{i}|<\rho|}\operatorname{\mathbf{E}}_{\phi(0)}\left[\prod_{Z_{m}\in\phi(0)}^{|Z_{m}|>\sqrt{\rho^{2}-r_{i}^{2}}}\frac{1}{1+\tau x^{\alpha}\eta{(r_{i}^{2}+Z_{m}^{2})}^{-\frac{\alpha}{2}}}\right]
=riΦl|ri|<ρ|exp(2μρ2ri2τxαη(ri2+u2)α21+τxαη(ri2+u2)α2du).\displaystyle=\prod_{r_{i}\in\Phi_{l}}^{|r_{i}|<\rho|}\exp\left(-2\mu\int_{\sqrt{\rho^{2}-r_{i}^{2}}}^{\infty}\frac{\tau x^{\alpha}\eta{(r_{i}^{2}+u^{2})}^{-\frac{\alpha}{2}}}{1+\tau x^{\alpha}\eta{(r_{i}^{2}+u^{2})}^{-\frac{\alpha}{2}}}\mathop{}\!\mathrm{d}u\right). (21)

Similarly, we have

riΦl|ri|>ρ𝐄ϕ(ri)[Ynϕ(ri)Yn>ρeτxαηYnα|Φl]\displaystyle\prod_{r_{i}\in\Phi_{l}}^{|r_{i}|>\rho}\operatorname{\mathbf{E}}_{\phi(r_{i})}\left[\left.\prod_{Y_{n}\in\phi(r_{i})}^{\|Y_{n}\|>\rho}e^{-\tau x^{\alpha}\eta\|Y_{n}\|^{-\alpha}}\right|\Phi_{l}\right] =riΦl|ri|>ρexp(2μ0τxαη(ri2+u2)α21+τxαη(ri2+u2)α2du).\displaystyle=\prod_{r_{i}\in\Phi_{l}}^{|r_{i}|>\rho}\exp\left(-2\mu\int_{0}^{\infty}\frac{\tau x^{\alpha}\eta{(r_{i}^{2}+u^{2})}^{-\frac{\alpha}{2}}}{1+\tau x^{\alpha}\eta{(r_{i}^{2}+u^{2})}^{-\frac{\alpha}{2}}}\mathop{}\!\mathrm{d}u\right). (22)

Then, from Eqs. (18)–(22), the coverage probability is given by

2πλb0xeπλbx22πλbxτxαu1α1+τxαuαdux2𝐄[riΦl|ri|<ρf(ri,x)riΦl|ri|>ρg(ri,x)]dx,\displaystyle 2\pi\lambda_{b}\int_{0}^{\infty}xe^{-\pi\lambda_{b}x^{2}-2\pi\lambda_{b}\int_{x}^{\infty}\frac{\tau x^{\alpha}u^{1-\alpha}}{1+\tau x^{\alpha}u^{-\alpha}\mathop{}\!\mathrm{d}u}x^{2}}\operatorname{\mathbf{E}}\left[\prod_{r_{i}\in\Phi_{l}}^{|r_{i}|<\rho}f(r_{i},x)\prod_{r_{i}\in\Phi_{l}}^{|r_{i}|>\rho}g(r_{i},x)\right]\mathop{}\!\mathrm{d}x,

where the functions f(ri,x)f(r_{i},x) and g(ri,x)g(r_{i},x) are given in Eq. (21) and (22), respectively. Finally, we obtain the final result by using the Laplace transform of the Poisson line process. ∎

Fig. 5 illustrates the coverage probability of the typical user, obtained by Monte Carlo simulations and by Theorem 2. Fig. 6 illustrates the coverage probability of the typical user w.r.t. the safety message range ρ\rho and SIR coverage threshold τ\tau. It shows how the SIR coverage decreases when τ\tau or ρ\rho increase.

Refer to caption
Figure 5: Comparison of the simulated joint downlink coverage probability and the analytic formula derived in Theorem 2. This figure confirms that the analytic formula matches the simulation results. We take λb=5/km2\lambda_{b}=5/\text{km}^{2}. The densities λl,μ\lambda_{l},\mu are per kilometer and ρ\rho is in kilometer.
Refer to caption
Figure 6: We consider λb=5/km2,λl=5/km,μ=5/km\lambda_{b}=5/\text{km}^{2},\lambda_{l}=5/\text{km},\mu=5/\text{km}.

III-C SIR Coverage of the Typical Sidelink

This section derives the SIR coverage probability of sidelink.

Theorem 3.

The sidelink coverage probability of the typical user 𝐏Ψ0(SIR>τ,0𝒟)\operatorname{\mathbf{P}}_{\Psi}^{0}(\operatorname{\textrm{SIR}}>\tau,0\in\operatorname{\mathcal{D}}) is

0ρL0(x)exp(L1(x)L2(x)L3(x))dx,\displaystyle\int_{0}^{\rho}L_{0}(x)\exp(-L_{1}(x)-L_{2}(x)-L_{3}(x))\mathop{}\!\mathrm{d}x, (23)

where

L0(x)\displaystyle L_{0}(x) =0x4λlμxexp(2μx2r22μx2r2τxα(u2+r2)α21+τxα(u2+r2)α2du)x2r2dr\displaystyle=\int_{0}^{x}\frac{4\lambda_{l}\mu x\exp\left({-2\mu\sqrt{x^{2}-r^{2}}-2\mu\int_{\sqrt{x^{2}-r^{2}}}^{\infty}\frac{\tau x^{\alpha}(u^{2}+r^{2})^{-\frac{\alpha}{2}}}{1+\tau x^{\alpha}(u^{2}+r^{2})^{-\frac{\alpha}{2}}}}\mathop{}\!\mathrm{d}u\right)}{\sqrt{x^{2}-r^{2}}}\mathop{}\!\mathrm{d}r
L1(x)\displaystyle L_{1}(x) =2πλb0τη1xαu1α1+τ1ηxαuαdu\displaystyle=2\pi\lambda_{b}\int_{0}^{\infty}\frac{\tau\eta^{-1}x^{\alpha}u^{1-\alpha}}{1+\tau^{-1}\eta x^{\alpha}u^{-\alpha}}\mathop{}\!\mathrm{d}u
L2(x)\displaystyle L_{2}(x) =2λl0x1exp(2μx2u22μx2u2τxα(u2+v2)α21+τxα(u2+v2)α2dv)du\displaystyle=2\lambda_{l}\int_{0}^{x}1-\exp\left(-2\mu\sqrt{x^{2}-u^{2}}-2\mu\int_{\sqrt{x^{2}-u^{2}}}^{\infty}\frac{\tau x^{\alpha}(u^{2}+v^{2})^{-\frac{\alpha}{2}}}{1+\tau x^{\alpha}(u^{2}+v^{2})^{-\frac{\alpha}{2}}}\mathop{}\!\mathrm{d}v\right)\mathop{}\!\mathrm{d}u
L3(x)\displaystyle L_{3}(x) =2λlx1exp(2μ0τxα(u2+v2)α21+τxα(u2+v2)α2dv)du.\displaystyle=2\lambda_{l}\int_{x}^{\infty}1-\exp\left(-2\mu\int_{0}^{\infty}\frac{\tau x^{\alpha}(u^{2}+v^{2})^{-\frac{\alpha}{2}}}{1+\tau x^{\alpha}(u^{2}+v^{2})^{-\frac{\alpha}{2}}}\mathop{}\!\mathrm{d}v\right)\mathop{}\!\mathrm{d}u.
Proof:

The coverage probability is given by

𝐏(SIR>τ,SL)\displaystyle\operatorname{\mathbf{P}}(\operatorname{\textrm{SIR}}>\tau,\text{SL}) =𝐏(SIR>τ,0𝒟)\displaystyle=\operatorname{\mathbf{P}}(\operatorname{\textrm{SIR}}>\tau,0\in\operatorname{\mathcal{D}})
=𝐄[𝐄[𝟙SIR>τ,0𝒟|Φl]]\displaystyle=\operatorname{\mathbf{E}}\left[\operatorname{\mathbf{E}}\left[\operatorname{\mathbbm{1}}_{\operatorname{\textrm{SIR}}>\tau,0\in\operatorname{\mathcal{D}}}|\Phi_{l}\right]\right]
=𝐄[𝐄[riΦl𝟙Xri𝟙X=x𝟙H>pv1τIxα|Φl]]\displaystyle=\operatorname{\mathbf{E}}\left[\left.\operatorname{\mathbf{E}}\left[\sum_{r_{i}\in\Phi_{l}}\operatorname{\mathbbm{1}}_{X_{\star}\in r_{i}}\operatorname{\mathbbm{1}}_{\|X_{\star}\|=x}\operatorname{\mathbbm{1}}_{H>p_{v}^{-1}\tau Ix^{\alpha}}\right|\Phi_{l}\right]\right]
=𝐄[0ρriΦlri<xf(ri,x)𝐄[epv1τIxα|Xiri,X=x,Φl]dx],\displaystyle=\operatorname{\mathbf{E}}\left[\int_{0}^{\rho}\sum_{r_{i}\in\Phi_{l}}^{r_{i}<x}f(r_{i},x)\operatorname{\mathbf{E}}\left[\left.e^{-p_{v}^{-1}\tau Ix^{\alpha}}\right|X_{i}\in r_{i},\|X_{\star}\|=x,\Phi_{l}\right]\mathop{}\!\mathrm{d}x\right], (24)

where the conditional density function f(ri,x)f(r_{i},x) is given by

f(ri,x)\displaystyle f(r_{i},x) =x𝐏(xX,Xri|Φl)\displaystyle=\partial_{x}\operatorname{\mathbf{P}}(x\leq\|X_{\star}\|,X_{\star}\in r_{i}|\Phi_{l})
=x(1𝐏(ϕ(ri)(B0(x))=0|Φl))rjΦl,rjri|rj|<x𝐏(ϕ(rj)B0(x)=0|Φl)\displaystyle=\partial_{x}(1-\operatorname{\mathbf{P}}(\phi(r_{i})(B_{0}(x))=0|\Phi_{l}))\prod_{r_{j}\in\Phi_{l},r_{j}\neq r_{i}}^{|r_{j}|<x}\operatorname{\mathbf{P}}(\phi(r_{j})B_{0}(x)=0|\Phi_{l})
=x(1e2μx2ri2)rjΦl,rjri|rj|<xe2μx2rj2\displaystyle=\partial_{x}(1-e^{-2\mu\sqrt{x^{2}-r_{i}^{2}}})\prod_{r_{j}\in\Phi_{l},r_{j}\neq r_{i}}^{|r_{j}|<x}e^{-2\mu\sqrt{x^{2}-r_{j}^{2}}}
=2μxe2μx2ri2x2ri2rjΦl,rjri|rj|xe2μx2rj2.\displaystyle=\frac{2\mu xe^{-2\mu\sqrt{x^{2}-r_{i}^{2}}}}{\sqrt{x^{2}-r_{i}^{2}}}\prod_{r_{j}\in\Phi_{l},r_{j}\neq r_{i}}^{|r_{j}|\leq x}e^{-2\mu\sqrt{x^{2}-r_{j}^{2}}}. (25)

The first term is the probability that there is a point of ϕ(ri)\phi(r_{i}) at distance xx from the origin. The second term is the probability that there exists no point of ϕ(rj)\phi(r_{j}), for any rjΦlr_{j}\in\Phi_{l} such that |rj|<x|r_{j}|<x.

Conditional on X=x,Xri,X_{\star}=x,X_{\star}\in r_{i}, and Φl,\Phi_{l}, the Laplace transform of the interference is

𝐄[epv1τIxαX=x,Xri,Φl]=\displaystyle\operatorname{\mathbf{E}}[e^{-p_{v}^{-1}\tau Ix^{\alpha}}|\|X_{\star}\|=x,X_{\star}\in r_{i},\Phi_{l}]= 𝐄[YiΦbeτη1xαHYiα]\displaystyle\operatorname{\mathbf{E}}\left[\prod_{Y_{i}\in\Phi_{b}}e^{-\tau\eta^{-1}x^{\alpha}H\|Y_{i}\|^{-\alpha}}\right]
×𝐄ϕ(ri)[Xjϕ(ri)Xj>x𝐄H[eτxαHXjα]]\displaystyle\times\operatorname{\mathbf{E}}_{\phi(r_{i})}\left[\prod_{X_{j}\in\phi(r_{i})}^{\|X_{j}\|>x}\operatorname{\mathbf{E}}_{H}\left[e^{-\tau x^{\alpha}H\|X_{j}\|^{-\alpha}}\right]\right]
×rjΦl,rjri𝐄ϕ(rj)[Xjϕ(rj)Xj>x𝐄H[eτxαHXjα]]\displaystyle\times\prod_{r_{j}\in\Phi_{l},r_{j}\neq r_{i}}\operatorname{\mathbf{E}}_{\phi(r_{j})}\left[\prod_{X_{j}\in\phi(r_{j})}^{\|X_{j}\|>x}\operatorname{\mathbf{E}}_{H}\left[e^{-\tau x^{\alpha}H\|X_{j}\|^{-\alpha}}\right]\right]
=\displaystyle= exp(2λbπ0τη1xαu1α1+τη1xαuαdu)\displaystyle\exp\left(-2\lambda_{b}\pi\int_{0}^{\infty}\frac{\tau\eta^{-1}x^{\alpha}u^{1-\alpha}}{1+\tau\eta^{-1}x^{\alpha}u^{-\alpha}}\mathop{}\!\mathrm{d}u\right)
×exp(2μx2ri2τxα(ri2+u2)α21+τxα(ri2+u2)α2du)\displaystyle\times\exp\left(-2\mu\int_{\sqrt{x^{2}-r_{i}^{2}}}^{\infty}\frac{\tau x^{\alpha}\left(r_{i}^{2}+u^{2}\right)^{-\frac{\alpha}{2}}}{1+\tau x^{\alpha}(r_{i}^{2}+u^{2})^{-\frac{\alpha}{2}}}\mathop{}\!\mathrm{d}u\right)
×rjΦl,rjri|rj|<xexp(2μx2rj2τxα(rj2+u2)α21+τxα(rj2+u2)α2du)\displaystyle\times\prod_{r_{j}\in\Phi_{l},r_{j}\neq r_{i}}^{|r_{j}|<x}\exp\left(-2\mu\int_{\sqrt{x^{2}-r_{j}^{2}}}^{\infty}\frac{\tau x^{\alpha}\left(r_{j}^{2}+u^{2}\right)^{-\frac{\alpha}{2}}}{1+\tau x^{\alpha}(r_{j}^{2}+u^{2})^{-\frac{\alpha}{2}}}\mathop{}\!\mathrm{d}u\right)
×rjΦl,rjri|rj|>xexp(2μ0τxα(rj2+u2)α21+τxα(rj2+u2)α2du).\displaystyle\times\prod_{r_{j}\in\Phi_{l},r_{j}\neq r_{i}}^{|r_{j}|>x}\exp\left(-2\mu\int_{0}^{\infty}\frac{\tau x^{\alpha}\left(r_{j}^{2}+u^{2}\right)^{-\frac{\alpha}{2}}}{1+\tau x^{\alpha}(r_{j}^{2}+u^{2})^{-\frac{\alpha}{2}}}\mathop{}\!\mathrm{d}u\right). (26)

On the right hand side of Eq. (26), the conditional expectation w.r.t. Φl\Phi_{l} are ommitted.

By incorporating Eqs. (25) and (26) to Eq. (24), we can write the coverage probability as

0ρ𝐄Φl[riΦl|ri|<xg1(ri,x)rjΦl,rjri|rj|<xg2(rj,x)rjΦl,rjri|rj|>xg3(rj,x)]ξ(x)dx,\displaystyle\int_{0}^{\rho}\operatorname{\mathbf{E}}_{\Phi_{l}}\left[\sum_{r_{i}\in\Phi_{l}}^{|r_{i}|<x}g_{1}(r_{i},x)\prod_{r_{j}\in\Phi_{l},r_{j}\neq r_{i}}^{|r_{j}|<x}g_{2}(r_{j},x)\prod_{r_{j}\in\Phi_{l},r_{j}\neq r_{i}}^{|r_{j}|>x}g_{3}(r_{j},x)\right]\xi(x)\mathop{}\!\mathrm{d}x, (27)

where the integrand functions are given by

g1(ri,x)\displaystyle g_{1}(r_{i},x) =2μxe2μx2ri2x2ri2exp(2μx2ri2τxα(ri2+v2)α21+τxα(ri2+v2)α2dv),\displaystyle=\frac{2\mu xe^{-2\mu\sqrt{x^{2}-r_{i}^{2}}}}{\sqrt{x^{2}-r_{i}^{2}}}\exp\left(-2\mu\int_{\sqrt{x^{2}-r_{i}^{2}}}^{\infty}\frac{\tau x^{\alpha}\left(r_{i}^{2}+v^{2}\right)^{-\frac{\alpha}{2}}}{1+\tau x^{\alpha}(r_{i}^{2}+v^{2})^{-\frac{\alpha}{2}}}\mathop{}\!\mathrm{d}v\right),
g2(rj,x)\displaystyle g_{2}(r_{j},x) =e2μx2rj2exp(2μx2rj2τxα(rj2+v2)α21+τxα(rj2+v2)α2dv),\displaystyle=e^{-2\mu\sqrt{x^{2}-r_{j}^{2}}}\exp\left(-2\mu\int_{\sqrt{x^{2}-r_{j}^{2}}}^{\infty}\frac{\tau x^{\alpha}\left(r_{j}^{2}+v^{2}\right)^{-\frac{\alpha}{2}}}{1+\tau x^{\alpha}(r_{j}^{2}+v^{2})^{-\frac{\alpha}{2}}}\mathop{}\!\mathrm{d}v\right),
g3(rj,x)\displaystyle g_{3}(r_{j},x) =exp(2μ0τxα(rj2+v2)α21+τxα(rj2+v2)α2dv),\displaystyle=\exp\left(-2\mu\int_{0}^{\infty}\frac{\tau x^{\alpha}\left(r_{j}^{2}+v^{2}\right)^{-\frac{\alpha}{2}}}{1+\tau x^{\alpha}(r_{j}^{2}+v^{2})^{-\frac{\alpha}{2}}}\mathop{}\!\mathrm{d}v\right),
ξ(x)\displaystyle\xi(x) =exp(2πλb0τη1xαu1α1+τη1xαuαdu).\displaystyle=\exp\left(-2\pi\lambda_{b}\int_{0}^{\infty}\frac{\tau\eta^{-1}x^{\alpha}u^{1-\alpha}}{1+\tau\eta^{-1}x^{\alpha}u^{-\alpha}}\mathop{}\!\mathrm{d}u\right).

Applying Campbell’s formula in [9] on Eq. (27) w.r.t. the cylinder Poisson point process gives

0ρ(0x2πλlg1(r,x)drdθ)𝐄Φlr[rjΦl,rjr|rj|<xg2(rj,x)rjΦl,rjr|rj|>xg3(rj,x)]ξ(x)dx,\displaystyle\int_{0}^{\rho}\left(\int_{0}^{x}2\pi\lambda_{l}g_{1}(r,x)\mathop{}\!\mathrm{d}r\mathop{}\!\mathrm{d}\theta\right)\operatorname{\mathbf{E}}_{\Phi_{l}}^{r}\left[\prod_{r_{j}\in\Phi_{l},r_{j}\neq r}^{|r_{j}|<x}g_{2}(r_{j},x)\prod_{r_{j}\in\Phi_{l},r_{j}\neq r}^{|r_{j}|>x}g_{3}(r_{j},x)\right]\xi(x)\mathop{}\!\mathrm{d}x, (28)

where 𝐄Φlr\operatorname{\mathbf{E}}_{\Phi_{l}}^{r} is the Palm expectation of the cylinder Poisson line process. We have

𝐄Φlr[rjΦl,rjr|rj|<xg2(rj,x)rjΦl,rjr|rj|>xg3(rj,x)]\displaystyle\operatorname{\mathbf{E}}_{\Phi_{l}}^{r}\left[\prod_{r_{j}\in\Phi_{l},r_{j}\neq r}^{|r_{j}|<x}g_{2}(r_{j},x)\prod_{r_{j}\in\Phi_{l},r_{j}\neq r}^{|r_{j}|>x}g_{3}(r_{j},x)\right]
=𝐄Φl!r[rjΦl|rj|<xg2(rj,x)rjΦl|rj|>xg3(rj,x)]\displaystyle=\operatorname{\mathbf{E}}_{\Phi_{l}}^{!r}\left[\prod_{r_{j}\in\Phi_{l}}^{|r_{j}|<x}g_{2}(r_{j},x)\prod_{r_{j}\in\Phi_{l}}^{|r_{j}|>x}g_{3}(r_{j},x)\right]
=exp(2λl0x1exp(2μx2u22μx2u2τxα(u2+v2)α21+τxα(u2+v2)α2dv)du)\displaystyle=\exp\left(-2\lambda_{l}\int_{0}^{x}1-\exp\left(-2\mu\sqrt{x^{2}-u^{2}}-2\mu\int_{\sqrt{x^{2}-u^{2}}}^{\infty}\frac{\tau x^{\alpha}(u^{2}+v^{2})^{-\frac{\alpha}{2}}}{1+\tau x^{\alpha}(u^{2}+v^{2})^{-\frac{\alpha}{2}}}\mathop{}\!\mathrm{d}v\right)\mathop{}\!\mathrm{d}u\right)
×exp(2λlx1exp(2μ0τxα(u2+v2)α21+τxα(u2+v2)α2dv)du),\displaystyle\hskip 14.22636pt\times\exp\left(-2\lambda_{l}\int_{x}^{\infty}1-\exp\left(-2\mu\int_{0}^{\infty}\frac{\tau x^{\alpha}(u^{2}+v^{2})^{-\frac{\alpha}{2}}}{1+\tau x^{\alpha}(u^{2}+v^{2})^{-\frac{\alpha}{2}}}\mathop{}\!\mathrm{d}v\right)\mathop{}\!\mathrm{d}u\right), (29)

We obtain the first equation by using Slivnyak’s theorem and the second equation by using the probability generating functional of the cylinder Poisson point process. ∎

Refer to caption
Figure 7: Comparison between the simulated sidelink coverage probability and the analytic one presented by Theorem 3. We consider λb=5/km2\lambda_{b}=5/\text{km}^{2} α=3,\alpha=3, and η=1\eta=1. The densities λl,μ\lambda_{l},\mu are per kilometer and ρ\rho is in kilometer.
Refer to caption
Figure 8: Sidelink coverage probability for ρ\rho and ϵ\epsilon. We consider λb=5/km2,λl=5/km,μ=5/km\lambda_{b}=5/\text{km}^{2},\lambda_{l}=5/\text{km},\mu=5/\text{km}, η=1\eta=1, and α=3\alpha=3.

Fig. 7 illustrates the derived probability of the typical sidelink user, obtained by Monte Carlo simulations and by Theorem 3, respectively. In the proposed network model, vehicles broadcast their safety messages at a fixed encoding rate such as ϵ\epsilon bps/Hz. The value of ϵ\epsilon determines the corresponding SIR threshold τ\tau at which safety messages are successfully decoded. In Fig. 8, we illustrate the sidelink coverage probability as a function of the encoding threshold ϵ\epsilon (bps/Hz) and the broadcast distance ρ\rho (km). The zz-value is the probability that the message with the corresponding encoding rate is successfully decoded by the typical user: 𝐏Ψ0(SIR>2ϵ1,SL)\operatorname{\mathbf{P}}_{\Psi}^{0}(\operatorname{\textrm{SIR}}>2^{\epsilon}-1,\text{SL}).

Remark 4.

The sidelink coverage probability conditional on the sidelink association is the ratio of the number of vehicle-associated users whose SIRs are greater than ϵ\epsilon to the number vehicle-associated users, in a very large ball centered at the origin:

𝐏Ψ0(SIR>2ϵ1|SL)\displaystyle\operatorname{\mathbf{P}}_{\Psi}^{0}(\operatorname{\textrm{SIR}}>2^{\epsilon}-1|\text{SL}) =𝐏Ψ0(SIR>2ϵ1,SL)𝐏Ψ0(SL)\displaystyle=\frac{\operatorname{\mathbf{P}}_{\Psi}^{0}(\operatorname{\textrm{SIR}}>2^{\epsilon}-1,\text{SL})}{\operatorname{\mathbf{P}}_{\Psi}^{0}(\text{SL})}
=limrXiΨB0(r)𝟙Xi𝒟SIRXi>2ϵ1XiΨB0(r)𝟙Xi𝒟,\displaystyle=\lim_{r\to\infty}\frac{\sum_{X_{i}\in\Psi\cap B_{0}(r)}\operatorname{\mathbbm{1}}_{X_{i}\in\operatorname{\mathcal{D}}\operatorname{\textrm{SIR}}_{X_{i}}>2^{\epsilon}-1}}{\sum_{X_{i}\in\Psi\cap B_{0}(r)}\operatorname{\mathbbm{1}}_{X_{i}\in\operatorname{\mathcal{D}}}},

where SIRX\operatorname{\textrm{SIR}}_{X} denotes the SIR of user XX and 𝒟\operatorname{\mathcal{D}} denotes the vehicle association region. The sidelink coverage probability characterizes the reliability of the vehicular broadcast safety messaging.

IV Effective Data Rate

This section studies the effective data rate of the typical user through downlink communications. It captures the average amount of data that users will effectively receive through messages from base stations in the presense of sidelink interruptions.

Recall that the zero cell, denoted by 𝒱z,\operatorname{\mathcal{V}}_{z}, is the Voronoi cell that contains the origin (or equivalently the typical user) under the Palm distribution of the user point process Ψ\Psi. The nucleus of the zero cell corresponds to the base station that serves the typical user.

IV-A Fraction of Vehicle Association Region in the Zero Cell

To derive the effective data rate, we first evaluate the expected number of downlink association users of the serving base station of the typical user: 𝐄Ψ0[Ψ(𝒱Z𝒟(t))]\operatorname{\mathbf{E}}_{\Psi}^{0}[\|\Psi(\operatorname{\mathcal{V}}_{Z}\setminus\operatorname{\mathcal{D}}(t))\|]. We first derive the mean area of the set 𝒱Z𝒟(t)\operatorname{\mathcal{V}}_{Z}\setminus\operatorname{\mathcal{D}}(t) under the Palm distribution of Ψ.\Psi. Then, the mean number of downlink users is simply given by the product of the user density λu\lambda_{u} and the mean area of the zero cell, 𝐄[𝒱Z𝒟(t)]\operatorname{\mathbf{E}}[\|\operatorname{\mathcal{V}}_{Z}\setminus\operatorname{\mathcal{D}}(t)\|].

Lemma 1 (Inversion lemma).

Suppose Υ\Upsilon a stationary point process of intensity λ.\lambda. For all non-negative functions f,f, the Palm inversion formula [9] is

𝐄[f(Υ)]=λ𝐄Υ0[df(Υx)𝟙x𝒱0dx].\operatorname{\mathbf{E}}[f(\Upsilon)]=\lambda\operatorname{\mathbf{E}}_{\Upsilon}^{0}\left[\int_{\operatorname{\mathbb{R}}^{d}}f(\Upsilon-x)\operatorname{\mathbbm{1}}_{x\in\operatorname{\mathcal{V}}_{0}}\mathop{}\!\mathrm{d}x\right]. (30)

In addition, for any non-negative function g()g(\cdot) of the zero cell, we have

𝐄[g(𝒱Z)]=λ𝐄Υ0[g(𝒱0)2(𝒱0)],\operatorname{\mathbf{E}}[g(\operatorname{\mathcal{V}}_{Z})]=\lambda\operatorname{\mathbf{E}}_{\Upsilon}^{0}[g(\operatorname{\mathcal{V}}_{0})\ell_{2}(\operatorname{\mathcal{V}}_{0})], (31)

where 2(A)\ell_{2}(A) is the area of the set AA and 𝒱0\operatorname{\mathcal{V}}_{0} is the typical Voronoi cell (the typical cell under the Palm distribution 𝐏Υ\operatorname{\mathbf{P}}_{\Upsilon}).

Proposition 1.

The mean areas of the sets 𝒱Z𝒟(t)\operatorname{\mathcal{V}}_{Z}\cap\operatorname{\mathcal{D}}(t) and 𝒱Z𝒟(t)\operatorname{\mathcal{V}}_{Z}\setminus\operatorname{\mathcal{D}}(t) are given by

𝐄[2(𝒱Z𝒟(t))]\displaystyle\operatorname{\mathbf{E}}[\ell_{2}(\operatorname{\mathcal{V}}_{Z}\cap\operatorname{\mathcal{D}}(t))] =λb𝐄Φb0[(2(𝒱0))2]𝐏(0𝒟)νλb𝐏(0𝒟),\displaystyle=\lambda_{b}\operatorname{\mathbf{E}}_{\Phi_{b}}^{0}\left[(\ell_{2}(\operatorname{\mathcal{V}}_{0}))^{2}\right]\operatorname{\mathbf{P}}(0\in\operatorname{\mathcal{D}})\approxeq\frac{\nu}{\lambda_{b}}\operatorname{\mathbf{P}}(0\in\operatorname{\mathcal{D}}),
𝐄[2(𝒱Z𝒟(t))]\displaystyle\operatorname{\mathbf{E}}[\ell_{2}(\operatorname{\mathcal{V}}_{Z}\setminus\operatorname{\mathcal{D}}(t))] =λb𝐄Φb0[(2(𝒱0))2]𝐏(0𝒟)νλb𝐏(0𝒟),\displaystyle=\lambda_{b}\operatorname{\mathbf{E}}_{\Phi_{b}}^{0}\left[(\ell_{2}(\operatorname{\mathcal{V}}_{0}))^{2}\right]\operatorname{\mathbf{P}}(0\notin\operatorname{\mathcal{D}})\approxeq\frac{\nu}{\lambda_{b}}\operatorname{\mathbf{P}}(0\notin\operatorname{\mathcal{D}}),

respectively. We use ν1.28.\nu\approxeq 1.28.

Proof:

Let g(𝒱Z)g(\operatorname{\mathcal{V}}_{Z}) denote the area of the set 𝒟(t)\operatorname{\mathcal{D}}(t) in the zero cell 𝒱Z.\operatorname{\mathcal{V}}_{Z}. Then, we have

g(𝒱Z)=𝒱Z𝒟(t)=2𝟙x𝒱Z𝒟(t)dx.g(\operatorname{\mathcal{V}}_{Z})=\|\operatorname{\mathcal{V}}_{Z}\cap\operatorname{\mathcal{D}}(t)\|=\int_{\operatorname{\mathbb{R}}^{2}}\operatorname{\mathbbm{1}}_{x\in\operatorname{\mathcal{V}}_{Z}\cap\operatorname{\mathcal{D}}(t)}\mathop{}\!\mathrm{d}x.

Using the inversion lemma, the expected value 𝐄[2(𝒱Z𝒟)]\operatorname{\mathbf{E}}[\ell_{2}(\operatorname{\mathcal{V}}_{Z}\cap\operatorname{\mathcal{D}})] is given by

𝐄[𝟙x𝒱ZD(t)dx]\displaystyle\operatorname{\mathbf{E}}\left[\int\operatorname{\mathbbm{1}}_{x\in\operatorname{\mathcal{V}}_{Z}\cap D(t)}\mathop{}\!\mathrm{d}x\right] =λb𝐄Φb0[2(𝒱0)𝟙x𝒱0D(t)dx]\displaystyle=\lambda_{b}\operatorname{\mathbf{E}}_{\Phi_{b}}^{0}\left[\ell_{2}(\operatorname{\mathcal{V}}_{0})\int\operatorname{\mathbbm{1}}_{x\in\operatorname{\mathcal{V}}_{0}\cap D(t)}\mathop{}\!\mathrm{d}x\right]
=λb𝐄Φb0[𝟙x𝒱0dx𝟙x𝒱0𝒟(t)dx]\displaystyle=\lambda_{b}\operatorname{\mathbf{E}}_{\Phi_{b}}^{0}\left[\int\operatorname{\mathbbm{1}}_{x\in\operatorname{\mathcal{V}}_{0}}\mathop{}\!\mathrm{d}x\int\operatorname{\mathbbm{1}}_{x\in\operatorname{\mathcal{V}}_{0}\cap\operatorname{\mathcal{D}}(t)}\mathop{}\!\mathrm{d}x\right]
=(a)λb𝐄Φb0[𝐄Φv;t[𝟙x𝒱0dx𝟙x𝒱0𝒟(t)dx|Φb]]\displaystyle\stackrel{{\scriptstyle(\text{a})}}{{=}}\lambda_{b}\operatorname{\mathbf{E}}_{\Phi_{b}}^{0}\left[\operatorname{\mathbf{E}}_{\Phi_{v;t}}\left[\left.\int\operatorname{\mathbbm{1}}_{x\in\operatorname{\mathcal{V}}_{0}}\mathop{}\!\mathrm{d}x\int\operatorname{\mathbbm{1}}_{x\in\operatorname{\mathcal{V}}_{0}\cap\operatorname{\mathcal{D}}(t)}\mathop{}\!\mathrm{d}x\right|\Phi_{b}\right]\right]
=λb𝐄Φb0[𝐄Φv;t[𝟙x𝒱0dx𝟙x𝒱0𝟙x𝒟(t)dx|Φb]]\displaystyle=\lambda_{b}\operatorname{\mathbf{E}}_{\Phi_{b}}^{0}\left[\operatorname{\mathbf{E}}_{\Phi_{v;t}}\left[\left.\int\operatorname{\mathbbm{1}}_{x\in\operatorname{\mathcal{V}}_{0}}\mathop{}\!\mathrm{d}x\int\operatorname{\mathbbm{1}}_{x\in\operatorname{\mathcal{V}}_{0}}\operatorname{\mathbbm{1}}_{x\in\operatorname{\mathcal{D}}(t)}\mathop{}\!\mathrm{d}x\right|\Phi_{b}\right]\right]
=(b)λb𝐄Φb0[𝟙x𝒱0dx𝟙x𝒱0𝐄Φv;t[𝟙x𝒟(t)]dx]\displaystyle\stackrel{{\scriptstyle(\text{b})}}{{=}}\lambda_{b}\operatorname{\mathbf{E}}_{\Phi_{b}}^{0}\left[\int\operatorname{\mathbbm{1}}_{x\in\operatorname{\mathcal{V}}_{0}}\mathop{}\!\mathrm{d}x\int\operatorname{\mathbbm{1}}_{x\in\operatorname{\mathcal{V}}_{0}}\operatorname{\mathbf{E}}_{\Phi_{v;t}}\left[\operatorname{\mathbbm{1}}_{x\in\operatorname{\mathcal{D}}(t)}\right]\mathop{}\!\mathrm{d}x\right]
=(c)λb𝐄Φb0[(𝟙x𝒱0dx)2𝐏(0𝒟)dx]\displaystyle\stackrel{{\scriptstyle(\text{c})}}{{=}}\lambda_{b}\operatorname{\mathbf{E}}_{\Phi_{b}}^{0}\left[\left(\int\operatorname{\mathbbm{1}}_{x\in\operatorname{\mathcal{V}}_{0}}\mathop{}\!\mathrm{d}x\right)^{2}\operatorname{\mathbf{P}}(0\in\operatorname{\mathcal{D}})\mathop{}\!\mathrm{d}x\right]
=λb𝐏0(0𝒟)𝐄Φb0[(𝟙x𝒱0dx)2]\displaystyle=\lambda_{b}\operatorname{\mathbf{P}}^{0}(0\in\operatorname{\mathcal{D}})\operatorname{\mathbf{E}}_{\Phi_{b}}^{0}\left[\left(\int\operatorname{\mathbbm{1}}_{x\in\operatorname{\mathcal{V}}_{0}}\mathop{}\!\mathrm{d}x\right)^{2}\right]
=λb𝐏0(0𝒟)𝐄Φb0[(2(𝒱0))2],\displaystyle=\lambda_{b}\operatorname{\mathbf{P}}^{0}(0\in\operatorname{\mathcal{D}})\operatorname{\mathbf{E}}_{\Phi_{b}}^{0}[(\ell_{2}(\operatorname{\mathcal{V}}_{0}))^{2}], (32)

where (a) is obtained by conditioning on the Cox point process Φv\Phi_{v}. We have (b) from the fact that ΦvΦb.\Phi_{v}\mathchoice{\mathrel{\hbox to0.0pt{$\displaystyle\perp$\hss}\mkern 2.0mu{\displaystyle\perp}}}{\mathrel{\hbox to0.0pt{$\textstyle\perp$\hss}\mkern 2.0mu{\textstyle\perp}}}{\mathrel{\hbox to0.0pt{$\scriptstyle\perp$\hss}\mkern 2.0mu{\scriptstyle\perp}}}{\mathrel{\hbox to0.0pt{$\scriptscriptstyle\perp$\hss}\mkern 2.0mu{\scriptscriptstyle\perp}}}\Phi_{b}. Then, we derive (c) by using the fact that the probability of the typical point is in 𝒟(t)\operatorname{\mathcal{D}}(t) is given by 𝐏Ψ0(0𝒟).\operatorname{\mathbf{P}}_{\Psi}^{0}(0\in\operatorname{\mathcal{D}}). In Eq. (32), we denote by 𝒱0\operatorname{\mathcal{V}}_{0} the typical Voronoi cell under the Palm distribution of the base station point process. Therefore we have

𝐄[2(𝒱Z𝒟)]\displaystyle\operatorname{\mathbf{E}}[\ell_{2}(\operatorname{\mathcal{V}}_{Z}\cap\operatorname{\mathcal{D}})] =λb𝐄Φb0[(2(𝒱0))2]𝐏(0𝒟),\displaystyle=\lambda_{b}\operatorname{\mathbf{E}}_{\Phi_{b}}^{0}\left[(\ell_{2}(\operatorname{\mathcal{V}}_{0}))^{2}\right]\operatorname{\mathbf{P}}(0\in\operatorname{\mathcal{D}}),
𝐄[2(𝒱Z𝒟)]\displaystyle\operatorname{\mathbf{E}}[\ell_{2}(\operatorname{\mathcal{V}}_{Z}\setminus\vspace{3mm}\operatorname{\mathcal{D}})] =λb𝐄Φb0[(2(𝒱0))2]𝐏(0𝒟),\displaystyle=\lambda_{b}\operatorname{\mathbf{E}}_{\Phi_{b}}^{0}\left[(\ell_{2}(\operatorname{\mathcal{V}}_{0}))^{2}\right]\operatorname{\mathbf{P}}(0\notin\operatorname{\mathcal{D}}),

respectively. Then, in [35], the second moment is given by

𝐄[(2(𝒱0))2]=νλb2\operatorname{\mathbf{E}}[(\ell_{2}(\operatorname{\mathcal{V}}_{0}))^{2}]=\frac{\nu}{\lambda_{b}^{2}}

where J(u,v)=(12π+vu)cos(u)2+(12π+u)cos(vu)2+cos(u)cos(vu)sin(v)J(u,v)=(\frac{1}{2}\pi+v-u)\cos(u)^{2}+(\frac{1}{2}\pi+u)\cos(v-u)^{2}+\cos(u)\cos(v-u)\sin(v) and

ν=2π0ππ/2vπ/2cos(uv)sin(v)cos(u)J(u,v)2dudv1.28.\nu=2\pi\int_{0}^{\pi}\int_{\pi/2}^{v-\pi/2}\frac{\cos(u-v)\sin(v)\cos(u)}{J(u,v)^{2}}\mathop{}\!\mathrm{d}u\mathop{}\!\mathrm{d}v\approxeq{1.28}.

IV-B Effective Data Rate of Typical User

Theorem 4.

The effective data rate is given by

𝒯=λb0𝐏Ψ0(SIR>2x1,0𝒟)dxνλu𝐏Ψ0(0𝒟),\displaystyle{\operatorname{\mathcal{T}}}=\dfrac{\lambda_{b}\int_{0}^{\infty}\operatorname{\mathbf{P}}_{\Psi}^{0}(\operatorname{\textrm{SIR}}>2^{x}-1,0\notin\operatorname{\mathcal{D}})\mathop{}\!\mathrm{d}x}{\nu\lambda_{u}\operatorname{\mathbf{P}}_{\Psi}^{0}(0\notin\operatorname{\mathcal{D}})}, (33)

where the denominator is given in Theorem 1 and the numerator is given in Theorem 2.

Proof:

The effective data rate is

𝒯\displaystyle{\operatorname{\mathcal{T}}} =𝐄Ψ0[log2(1+SIR),0𝒟]𝐄Ψ0[Ψ(𝒱Y𝒟(t))],\displaystyle=\frac{\operatorname{\mathbf{E}}_{\Psi}^{0}[\log_{2}(1+\operatorname{\textrm{SIR}}),0\notin\operatorname{\mathcal{D}}]}{\operatorname{\mathbf{E}}_{\Psi}^{0}[\|\Psi(\operatorname{\mathcal{V}}_{Y}\setminus\operatorname{\mathcal{D}}(t))\|]},

where the denominator is given by

𝐄[Ψ(𝒱Y𝒟(t))]\displaystyle\operatorname{\mathbf{E}}[\|\Psi(\operatorname{\mathcal{V}}_{Y}\setminus\operatorname{\mathcal{D}}(t))\|] =λu𝐄[2(𝒱Y𝒟)]=λu(νλb)𝐏Ψ0(0𝒟).\displaystyle={\lambda_{u}}\operatorname{\mathbf{E}}[\ell_{2}(\operatorname{\mathcal{V}}_{Y}\setminus\operatorname{\mathcal{D}})]=\lambda_{u}\left(\frac{\nu}{\lambda_{b}}\right)\operatorname{\mathbf{P}}_{\Psi}^{0}(0\notin\operatorname{\mathcal{D}}). (34)

On the other hand, the numerator is

𝐄Ψ0[log2(1+SIR),DL]\displaystyle\operatorname{\mathbf{E}}_{\Psi}^{0}[\log_{2}(1+\operatorname{\textrm{SIR}}),\text{DL}] =0𝐏Ψ0(SIR>2x1,0𝒟)dx.\displaystyle=\int_{0}^{\infty}\operatorname{\mathbf{P}}_{\Psi}^{0}(\operatorname{\textrm{SIR}}>2^{x}-1,0\notin\operatorname{\mathcal{D}})\mathop{}\!\mathrm{d}x. (35)

We obtain the result by combining Eq. (34) and (35). ∎

Note that the effective data rate can be interpreted as the long-term achievable rate on downlink.

IV-C Reliability of Sidelink in Cellular Networks

To improve the reliability of the vehicular safety messages, one should

  1. 1.

    decrease the encoding rate of the vehicular safety messages,

  2. 2.

    decrease the size of the vehicle association region,

  3. 3.

    increase the transmit power of vehicular broadcast,

In practice, the encoding rate ϵ\epsilon and the size of the vehicle association region ρ\rho might be given as the requirements for a V2X safety system. For instance, the encoding rate is determined by the size of safety messages that the ITS will adopt. Further, users are required to successfully decode such safety messages from vehicles especially from those within 300300 meters. In other words, the values of ϵ\epsilon or ρ\rho might be given as system requirements. To improve the reliability of sidelink broadcasts, one could focus on the transmit power of the vehicular safety message pv.p_{v}.

Increasing the transmit power of the vehicular broadcast will improve the reliability of safety messages. Nevertheless, it is important to note that the interference generated by other vehicles will also increase. In addition, varying the transmit power of vehicles affects other network performance metrics such as the downlink coverage probability or the effective rate of the typical user. As pvp_{v} increases, the effective data rate of the typical downlink user 𝒯\operatorname{\mathcal{T}} decreases due to the increased sidelink interference from vehicles. Similarly, as pvp_{v} decreases, the effective data rate will increase due to the decreased sidelink interference from vehicles. Table III summarizes the tradeoff relations between the coverage probability of the sidelink and the effective rate of the downlink w.r.t. the vehicular transmit power pvp_{v}. We consider η[0.1,1]\eta\in[0.1,1].

TABLE III: Tradeoffs in Network Performance
Network parameter Sidelink reliability Effective rate 𝒯\operatorname{\mathcal{T}}
pvp_{v} increase increase (diminishing return) decrease
pvp_{v} decrease decrease increase
λu\lambda_{u} increase unchanged decrease
λu\lambda_{u} decrease unchanged increase

One way of analyzing such a tradeoff is to formulate an objective function incorporating the tradeoff. Below, we introduce the overall network utility given by the sum of benefits that the typical user would be offered via sidelink and downlink. For weights ws,wd>0,w_{s},w_{d}>0, the network utility is the following function of pvp_{v}:

𝒰(pv)=ws𝐏(SIR>2ϵ1,SL)SL reliability+wd𝒯DL rate,\displaystyle\mathcal{U}(p_{v})=w_{s}\underbrace{\operatorname{\mathbf{P}}(\operatorname{\textrm{SIR}}>2^{\epsilon}-1,\text{SL})}_{\text{SL reliability}}+w_{d}\underbrace{\mathcal{T}}_{\text{DL rate}}, (36)

where the first term is the probability that the typical user successfully decodes the safety messages and the second term is the amount of effective data that it receives on the downlink channel. The interplay of network performances is captured by the weights, wsw_{s} and wd.w_{d}. Fig. 9 illustrates the proposed network utility function when λu=200/km2.\lambda_{u}=200/\text{km}^{2}. To show the impact of power control in safety messaing, we consider η{0.1,0.2,,1}\eta\in\{0.1,0.2,\ldots,1\} where η=1\eta=1 indicates that pv=pbp_{v}=p_{b}. For each power ratio, different sidelink weights are analyzed: ws{0.1,0.2,,0.9}w_{s}\in\{0.1,0.2,\ldots,0.9\}. In the figure, as the transmit power ratio increases, the network utility increases. The increment of network utility w.r.t. pvp_{v} is greater for a greater wsw_{s}.

Refer to caption
Figure 9: Network utility of Eq. (36) when λb=5/km2,λl=5/km,μ=5/km,\lambda_{b}=5/\text{km}^{2},\lambda_{l}=5/\text{km},\mu=5/\text{km}, ϵ=1,\epsilon=1, λu=200/km2,\lambda_{u}=200/\text{km}^{2}, and α=3\alpha=3.
Example 1.

By leveraging the network utility expression, we can derive the total ergodic rate that the typical user obtains from both sidelink and downlink. For the downlink rate, the effective rate of Eq. (33) can be used. For the sidelink rate, we use transmission capacity given in [36]. To be specific, when the safety message is encoded with ϵ\epsilon (bps/Hz), the probability of success is given by 𝐏(SIR>2ϵ1).\operatorname{\mathbf{P}}(\operatorname{\textrm{SIR}}>2^{\epsilon}-1). Therefore, we write the sidelink rate as ϵ𝐏(SIR>2ϵ1|SL)\epsilon\operatorname{\mathbf{P}}(\operatorname{\textrm{SIR}}>2^{\epsilon}-1|\text{SL}). Using the law of total probability, the total rate from downlink and sidelink is

𝒯^\displaystyle\hat{\operatorname{\mathcal{T}}} =𝐏Ψ0(SL)ϵ𝐏Ψ0(SIR>2ϵ1|SL)+𝐏Ψ0(DL)0𝐏Ψ0(SIR>2x1|DL)effective number of user per BS\displaystyle=\operatorname{\mathbf{P}}_{\Psi}^{0}(\text{SL}){\epsilon\operatorname{\mathbf{P}}_{\Psi}^{0}(\operatorname{\textrm{SIR}}>2^{\epsilon}-1|\text{SL})}+\operatorname{\mathbf{P}}_{\Psi}^{0}(\text{DL})\frac{\int_{0}^{\infty}\operatorname{\mathbf{P}}_{\Psi}^{0}(\operatorname{\textrm{SIR}}>2^{x}-1|\text{DL})}{\text{effective number of user per BS }}
=ϵ𝐏Ψ0(SIR>2ϵ1,0𝒟)+λb0𝐏Ψ0(SIR>2x1,0𝒟)dxνλu𝐏Ψ0(0𝒟),\displaystyle=\epsilon\operatorname{\mathbf{P}}_{\Psi}^{0}(\operatorname{\textrm{SIR}}>2^{\epsilon}-1,0\in\operatorname{\mathcal{D}})+\dfrac{\lambda_{b}\int_{0}^{\infty}\operatorname{\mathbf{P}}_{\Psi}^{0}(\operatorname{\textrm{SIR}}>2^{x}-1,0\notin\operatorname{\mathcal{D}})\mathop{}\!\mathrm{d}x}{\nu\lambda_{u}\operatorname{\mathbf{P}}_{\Psi}^{0}(0\notin\operatorname{\mathcal{D}})}, (37)

where 𝐏Ψ0(SIR>2x1,0𝒟)\operatorname{\mathbf{P}}_{\Psi}^{0}(\operatorname{\textrm{SIR}}>2^{x}-1,0\notin\operatorname{\mathcal{D}}) is in Eq. (16) and 𝐏(SIR>2ϵ1,0𝒟)\operatorname{\mathbf{P}}(\operatorname{\textrm{SIR}}>2^{\epsilon}-1,0\in\operatorname{\mathcal{D}}) is in Eq. (23).

Refer to caption
Figure 10: Total effective data rate of the typical user provided in Example 1. We consider λb=5/km2,λl=5/km,μ=5\lambda_{b}=5/\text{km}^{2},\lambda_{l}=5/\text{km},\mu=5/km, ϵ=1\epsilon=1, and α=3\alpha=3. The mean numbers of users per base station, namely λu/λb\lambda_{u}/\lambda_{b}, are 2020, 100100, and 200200, respectively.

Fig. 10 illustrates the total data rate of the typical user. The figure considers different numbers of users to analyze the impact of network congestion where the density of users is high. In the simulation setup, the effective rate increases as the power ratio increases. Furthermore, a lightly loaded network (a smaller number of users) has a better total data rate because each base station is shared by fewer users.

V Conclusion

In this paper, we analyze the broadcast of safety messages from vehicles to users. These messages contain safety-critical information and they are assumed to be transmitted in the same spectrum as downlink communications. To capture the ‘compulsory’ reception of vehicular safety messages from vehicles to users, we assume that users within a distance ρ\rho are forced to decode the safety messages. To analyze the network performance, we use a Poisson line Cox point process to model vehicles and then a Boolean model on the vehicle process to represent the safety message prioritized regions. Under the proposed stationary framework, we quantify the association of users as the association probability of the typical user. We then derive the distribution of the SIR of the typical user to quantify the reliability of the vehicular safety messages and downlink messages, respectively. Finally, we derive the downlink effective rate of the typical user to quantify the impact of mandatory sidelink reception for users. To capture the tradeoff of network performances w.r.t. the transmit power of safety messages, we also analyze the network utility and the total data rate of the typical user.

Acknowledgement

This work is supported in part by the National Science Foundation under Grant No. NSF-CCF-1514275 and an award from the Simons Foundation (#197982), both to the University of Texas at Austin.

References

  • [1] F. Rebecchi, M. Dias de Amorim, V. Conan, A. Passarella, R. Bruno, and M. Conti, “Data offloading techniques in cellular networks: A survey,” IEEE Commun. Surv&Tuts, vol. 17, no. 2, pp. 580–603, Secondquarter 2015.
  • [2] L. Goratti, G. Steri, K. M. Gomez, and G. Baldini, “Connectivity and security in a D2D communication protocol for public safety applications,” in Proc. IEEE ISWCS, Aug 2014, pp. 548–552.
  • [3] X. Cheng, L. Yang, and X. Shen, “D2D for intelligent transportation systems: A feasibility study,” IEEE Trans. Intell. Transp. Syst., vol. 16, no. 4, pp. 1784–1793, Aug 2015.
  • [4] 3GPP TR 38.885, “Study on NR vehicle-to-all (V2X) services,” 3GPP TR 38885, July 2018.
  • [5] G. Araniti, C. Campolo, M. Condoluci, A. Iera, and A. Molinaro, “LTE for vehicular networking: a survey,” IEEE Commun. Mag., vol. 51, no. 5, pp. 148–157, May 2013.
  • [6] S. Chen, J. Hu, Y. Shi, Y. Peng, J. Fang, R. Zhao, and L. Zhao, “Vehicle-to-everything (V2X) services supported by LTE-based systems and 5G,” IEEE Commun. Standards Mag., vol. 1, no. 2, pp. 70–76, 2017.
  • [7] J. B. Kenney, “Dedicated short-range communications (DSRC) standards in the united states,” Proceedings of the IEEE, vol. 99, no. 7, pp. 1162–1182, 2011.
  • [8] 3GPP TR 36.885, “Study on LTE vehicle-to-all (v2x) services,” 3GPP TR 36885, July 2016.
  • [9] F. Baccelli, B. Błaszczyszyn et al., “Stochastic geometry and wireless networks: Volume I theory,” Foundations and Trends® in Networking, vol. 3, no. 3–4, pp. 249–449, 2010.
  • [10] J. G. Andrews, F. Baccelli, and R. K. Ganti, “A tractable approach to coverage and rate in cellular networks,” IEEE Trans. Commun., vol. 59, no. 11, pp. 3122–3134, Nov. 2011.
  • [11] H. ElSawy, E. Hossain, and M. Haenggi, “Stochastic geometry for modeling, analysis, and design of multi-tier and cognitive cellular wireless networks: A survey,” IEEE Commun Surv&Tuts, vol. 15, no. 3, pp. 996–1019, Third 2013.
  • [12] B. Błaszczyszyn, M. K. Karray, and H. P. Keeler, “Using Poisson processes to model lattice cellular networks,” in Proc. IEEE INFOCOM, Apr. 2013, pp. 773–781.
  • [13] R. W. Heath, M. Kountouris, and T. Bai, “Modeling heterogeneous network interference using Poisson point processes,” IEEE Trans. Signal Process., vol. 61, no. 16, pp. 4114–4126, Aug 2013.
  • [14] F. Baccelli, B. Błaszczyszyn et al., “Stochastic geometry and wireless networks: Volume II applications,” Foundations and Trends® in Networking, vol. 4, no. 1–2, pp. 1–312, 2010.
  • [15] G. Fodor and N. Reider, “A distributed power control scheme for cellular network assisted D2D communications,” in Proc. IEEE GLOBECOM, Dec 2011, pp. 1–6.
  • [16] H. ElSawy, E. Hossain, and M. Alouini, “Analytical modeling of mode selection and power control for underlay D2D communication in cellular networks,” IEEE Trans. Commun., vol. 62, no. 11, pp. 4147–4161, Nov 2014.
  • [17] H. Min, J. Lee, S. Park, and D. Hong, “Capacity enhancement using an interference limited area for device-to-device uplink underlaying cellular networks,” IEEE Trans. Wireless Commun., vol. 10, no. 12, pp. 3995–4000, Dec 2011.
  • [18] X. Lin, R. W. Heath, and J. G. Andrews, “The interplay between massive MIMO and underlaid D2D networking,” IEEE Trans. Wireless Commun., vol. 14, no. 6, pp. 3337–3351, June 2015.
  • [19] A. H. Sakr and E. Hossain, “Cognitive and energy harvesting-based D2D communication in cellular networks: Stochastic geometry modeling and analysis,” IEEE Trans. Commun., vol. 63, no. 5, pp. 1867–1880, May 2015.
  • [20] D. J. Daley and D. Vere-Jones, An introduction to the theory of point processes: volume II: general theory and structure.   Springer Science & Business Media, New York, 2007.
  • [21] S. N. Chiu, D. Stoyan, W. S. Kendall, and J. Mecke, Stochastic geometry and its applications.   John Wiley & Sons, 2013.
  • [22] F. Baccelli, M. Klein, M. Lebourges, and S. Zuyev, “Stochastic geometry and architecture of communication networks,” Telecommunication Systems, vol. 7, no. 1, pp. 209–227, Jun 1997.
  • [23] F. Morlot, “A population model based on a Poisson line tessellation,” in Proc. IEEE WiOpt.   IEEE, 2012, pp. 337–342.
  • [24] C. Choi and F. Baccelli, “An analytical framework for coverage in cellular networks leveraging vehicles,” IEEE Trans. Commun., vol. 66, no. 10, pp. 4950–4964, Oct 2018.
  • [25] ——, “Poisson Cox point processes for vehicular networks,” IEEE Trans. Veh. Technol., vol. 67, no. 10, pp. 10 160–10 165, Oct 2018.
  • [26] V. V. Chetlur and H. S. Dhillon, “Coverage analysis of a vehicular network modeled as Cox process driven by Poisson line process,” IEEE Trans. Wireless Commun., vol. 17, no. 7, pp. 4401–4416, July 2018.
  • [27] C. Choi and F. Baccelli, “Spatial and temporal analysis of direct communications from static devices to mobile vehicles,” IEEE Trans. Wireless Commun., vol. 18, no. 11, pp. 5128–5140, 2019.
  • [28] V. V. Chetlur and H. S. Dhillon, “Coverage and rate analysis of downlink cellular vehicle-to-everything (C-V2X) communication,” arXiv preprint arXiv:1901.09236, 2019.
  • [29] H. S. Dhillon, R. K. Ganti, F. Baccelli, and J. G. Andrews, “Modeling and analysis of K-tier downlink heterogeneous cellular networks,” IEEE J. Sel. Areas Commun., vol. 30, no. 3, pp. 550–560, April 2012.
  • [30] B. Błaszczyszyn, P. Mühlethaler, and A. Nadjib, “Vehicular ad-hoc networks: Point-to-point, emergency and broadcast communications,” in Proc. of IFIP Wireless Days, Dublin, Ireland, 2012.
  • [31] A. Goldsmith, Wireless communications.   Cambridge university press, 2005.
  • [32] D. Tse and P. Viswanath, Fundamentals of wireless communication.   Cambridge university press, 2005.
  • [33] F. Baccelli and P. Brémaud, Elements of queueing theory: Palm Martingale calculus and stochastic recurrences.   Springer Science & Business Media, 2013, vol. 26.
  • [34] J. Moller, Lectures on random Voronoi tessellations.   Springer Science & Business Media, 2012, vol. 87.
  • [35] A. Hayen and M. P. Quine, “Areas of components of a Voronoi polygon in a homogeneous Poisson process in the plane,” Advances in Applied Probability, vol. 34, no. 2, pp. 281–291, 2002.
  • [36] S. P. Weber, X. Yang, J. G. Andrews, and G. de Veciana, “Transmission capacity of wireless ad hoc networks with outage constraints,” IEEE Trans. Inf. Theory, vol. 51, no. 12, pp. 4091–4102, Dec 2005.