An Analytical Framework for Coverage in Cellular Networks Leveraging Vehicles
|
|
- Karen Hill
- 5 years ago
- Views:
Transcription
1 1 An Analytical Framework for Coverage in Cellular Networks Leveraging Vehicles Chang-Sik Choi and François Baccelli arxiv: v2 [cs.it 3 Nov 217 Astract This paper analyzes an emerging architecture of cellular network utilizing oth planar ase stations uniformly distriuted in Euclidean plane and ase stations located on roads. An example of this architecture is that where, in addition to conventional planar cellular ase stations and users, vehicles also play the role of oth ase stations and users. A Poisson line process is used to model the road network and, conditionally on the lines, linear Poisson point processes are used to model the vehicles on the roads. The conventional planar ase stations and users are modeled y independent planar Poisson point processes. The joint stationarity of the elements in this model allows one to use Palm calculus to investigate statistical properties of such a network. Specifically, this paper discusses two different Palm distriutions, with respect to the user point processes depending on its type: planar or vehicular. We derive the distance to the nearest ase station, the association of the typical users, and the coverage proaility of the typical user in terms of integral formulas. Furthermore, this paper provides a comprehensive characterization of the performance of all possile cellular transmissions in this setting, namely vehicle-to-vehicle (V2V, vehicle-to-infrastructure (V2I, infrastructure-to-vehicle (I2V, and infrastructure-to-infrastructure (I2I communications. I. INTRODUCTION The ongoing changes in the automotive industry are expected to e disruptive in several ways. Today s vehicles have evolved from mere means of transportation to platforms that provide multiple services, including ride sharing, autonomous driving, data storage/processing, and Internet access. When the next generation vehicle technology will ecome commercially availale, roads will e flooded with new vehicles equipped with aanced sensors, GPS with Chang-sik Choi is with Department of ECE, The University of Texas at Austin, TX, USA ( chang-sik.choi@utexas.edu. François accelli is with the Department of Mathematics and the Department of ECE, The University of Texas at Austin, TX, USA ( accelli@math.utexas.edu
2 2 great accuracy, high-definition cameras, as well as long and and short-range communication devices with multiple radios. Undoutedly, a major transformation of the communication industry and its ecosystem will follow. For instance, the IEEE WAVE standard was estalished to enale vehicle-to-vehicle or vehicle-to-infrastructure communications with a low rate [1. The 3GPP has investigated vehicle to everything communications in the context of side link communications [2. New vehicular applications will require ultra fast and ultra reliale communications for vehicles to everything networking. The existing network architecture will e fundamentally altered, prompting the idea of cellular networks incorporating vehicles on roads serving as relays and/or ase stations [3 [6. To understand the role of vehicles in the context of future cellular architectures, we propose a framework allowing one to analyze the performance of a cellular network featuring vehicular network elements in addition to the classical planar elements (users and ase stations. The framework consists of a novel network model comprised of roads, vehicular ase stations and macro ase stations. It allows for the mathematical analysis of the performance experienced y users in this context. A. Related Work Studies of vehicular communications were mainly centered on ad hoc networking. A vehicle on a road was primarily identified as an apparatus to expand the performance of ad hoc networks. The existing literature thoroughly analyzed capacity and throughput [7 [9, delay [1, and routing protocols [11, [12 in this context. Stochastic geometry [13 provides a systematic approach to the performance analysis of large scale wireless networks [14 [18. The stationary framework of stochastic geometry allows one to investigate the performance of the typical user. It was used to derive the performance of cellular networks [19 [21. The Poisson network models were expanded to study multi-antenna techniques [22, [23 and new radio technologies [24, [25. More recently, this tool ecame essential to analyze heterogeneous cellular networks that are comprised of multiple layers of ase stations distinct in their transmit powers, locations, and ackhaul capailities. The literature on heterogeneous cellular networks first used Poisson models to study user association, coverage, and throughput [26 [3. Some more recent work, including [31 [34, proposed new spatial models for ase stations and users. As discussed in [35, some wireless network systems require non-poisson spatial models particularly for vehicular networks
3 3 since vehicles are typically on roads. The present paper can e seen as an extension of the classical Poisson cellular model to the scenario where ase stations are either Poisson or Cox on Poisson lines. [36 [39 investigated the performance of wireless networks with vehicular transmitters using stochastic geometry, y focusing on the spatial distriution of the vehicles. In [36, [37, one dimensional spatial network models were used to analyze the scheduling policy and reliaility of communication links on roads. Two-dimensional spatial models ased on Cox point process on lines were proposed in the past in [35 and recently as well to analyze the coverage proaility [38, [39. As in these two studies, the aim of the present paper is to analyze the coverage proaility perceived y typical users on roads. The main novelty of the present paper is the comprehensive architecture incorporating with vehicular ase stations, vehicular users, planar ase stations, and planar users. To the est of our knowledge, this framework is new and the systematic analysis of the proaility of coverage of typical users of oth categories which is proposed here has not een discussed so far. B. Technical Contriutions A systematic approach to characterize a heterogeneous cellular network with vehicular ase stations on roads. We adopt a model where the locations of vehicles are restricted to roads. To produce a tractale model for heterogeneous cellular network with vehicles, we propose the superposition of a stationary Cox point process on lines and a homogeneous planar Poisson point process to model two different layers of ase stations, namely vehicular ase stations and planar ase stations. In a similar way, a stationary planar Poisson point process and a stationary Cox point process on lines are used to model planar users and vehicular users, respectively. As it will ecome clear, the analysis will e ased on a snapshot of the network and the dynamics of vehicles is hence not taken into account. Therefore, the Cox model proposed in this paper also captures the situation with static ase stations (users deployed along the roads ecause they are topologically equivalent to vehicular ase stations (users of our model. These two Cox point processes are uilt on the same stationary Poisson line process. The proposed joint stationary framework enales a systematic approach to analyze the network performance seen y oth vehicular users and planar users. It will e evident from this paper that the type of a user (i.e., vehicular or planar fundamentally alters the statistical properties of its link, including the distance to the nearest ase station, the interference, and the coverage proaility.
4 4 Derivation of association, interference and coverage proaility using Palm calculus. To derive the performance of the proposed model, this paper considers the classical assumptions that users are associated with their nearest ase station, independently of their type, and that the received signal power attenuates according to a path loss model with Rayleigh fading. Statistical properties and fundamental metrics are otained using the joint stationarity framework and Palm calculus. In particular, we derive exact integral expressions for the association proaility and coverage proaility under the Palm proaility of each user point process. The integral expressions can e extended to interesting scenarios such as non-exponential fading or multiinput multi-output transceiver. Comprehensive characterization heterogeneous wireless transmissions in cellular networks with vehicles: We use the coverage and association expressions to inspect the performance of all wireless links in a network with oth planar and vehicular transmissions. For instance, the performance of vehicle-to-vehicle (V2V communications is captured through the coverage proaility of the typical vehicular user y vehicular ase stations, which involves the Palm distriution of the vehicular user point process. In the same vein, the performance of infrastructure-to-infrastructure (I2I communications is characterized y the coverage proaility of the typical planar user y planar ase stations. Using the Palm proaility, the paper gives a comprehensive analysis of all wireless links occurring in cellular networks with vehicles, namely V2V, V2I, I2V, and I2I communications. II. SYSTEM MODEL A. Spatial Modeling This paper proposes a novel heterogeneous cellular network with oth planar and vehicular ase stations. Homogeneous planar Poisson point processes Φ, Φ u, with intensities λ, λ u are used to model macro ase stations and users, respectively. This paper calls them planar ase stations and planar users respectively, to distinguish them from their vehicular counterparts. Both Φ and Φ u are assumed stationary, homogeneous, and independent. The vehicular ase stations and users are modeled y specific Cox point processes. To egin with, a road system is defined y an independent Poisson line process Φ l R 2 produced y a homogeneous Poisson point process Ξ on the cylinder C := R [, π. More precisely, a point of Ξ, denoted y (r i, θ i, descries the line l i R 2 of equation l(r i, θ i = {(x, y R 2 x cos(θ i + y sin(θ i = r i }, (1
5 5 Fig. 1. (dashed. An illustration of roads (line, planar ase stations (diamonds, and vehicular ase stations (circles with oundaries where the parameters r and θ correspond to the shortest distance from the origin to the line and the angle etween the positive X axis and line l, respectively. For the isotropic and stationary Poisson line process, the intensity measure of Ξ C is given y [4 Λ Ξ (dr dθ = λ l π dr dθ. Then, conditionally on the lines, vehicular ase stations and users are modeled y independent 1-D homogeneous Poisson point processes with intensity µ and µ u on each line, respectively. In other words, for each undirected line produced y a point of Ξ, conditionally independent copies of Poisson processes on R with parameters µ and µ u are used to descrie vehicular ase stations and vehicular users, respectively. Fig. 1 illustrates the planar ase stations Φ and the vehicular ase stations Ψ in a simulation all of radius 1km with λ l = 1/km and µ = 1/km. Notice that the proposed network model is flexile in creating road systems with different topologies. Fig. 2 illustrates the deployment of planar and vehicular ase stations when the angular component intensity measure of Ξ is limited to two simple values: {, π/2}, which admits only horizontal and vertical roads. It has a special name: a Poisson Manhattan Co x point process. The isotropic case, where angles are uniformly distriuted, is depicted in Fig. 1. Remind that this paper does not study the motion of vehicles. Therefore, the vehicular ase stations are
6 6 Fig. 2. An illustration of roads (line, planar ase stations (diamonds, and vehicular ase stations (circles with oundaries (dashed. Here the intensity over angular axis is concentrated over {, π/2} TABLE I NOTATION TABLE Symols Description Φ and Φ u Planar ase stations (spatial intensity and planar users (spatial intensity Ξ(Φ l Poisson point process on cylinder set C (Poisson line process on R 2 l(r, θ A line in Euclidean plane produced y a point (r, θ C l(r, θ A line that contains the origin φ l Ψ and Ψ u Poisson process on line l Vehicular ase stations and vehicular users P Φ u and P Ψ u Palm proailities with respect to Φ u and Ψ u, respectively X The ase station closest to the user at the origin topologically equivalent to static ase stations deployed along the roads. We will still call them vehicular ase stations in order to distinguish them from planar ase stations. B. Transmission Model and Performance Metrics This paper analyzes downlink cellular communications, namely links from ase stations to users, under the assumption of a distance-ased path loss and Rayleigh fading. The received
7 7 signal power P r at a distance R is given y P r = phr α, where α > 2, p is the transmit power, and H is an exponential random variale with mean one representing the Rayleigh fading. Since oth receive signal power and interference fluctuate etween users, spatially averaged performance metrics should e considered. In fact, all ase stations and users are jointly stationary, i.e., Φ, Ψ, Φ u, Ψ u are {θ t }-compatile on a stationary framework, and therefore, we can use the Palm proaility to study the network performance seen y a typical user. For instance, for a given constant T >, the coverage proaility of the typical user is defined y under the Palm proaility of Φ u + Ψ u y p c = P Φ u+ψ u (SINR > T, where the signal to interference-plus-noise ratio (SINR is given y the receive signal power divided y the interference-plus-noise power and where P Φ is the Palm proaility of the point process Φ. Similarly, the coverage proaility of the typical planar (resp. vehicular user is simply P Φ u (SINR > T (resp. P Ψ u (SINR > T. Assuming that noise power is negligile compared to the signal and interference powers, the SINR is equal to the signal to interference ratio and the coverage proaility of the typical user is given y p c = P Φ u+ψ u where X denotes the nearest ase station given y [ X := arg max X i Φ +Ψ E Φ u+ψ u ph X α X i Φ +Ψ \X ph X i α > T ph Xi X i α, = arg min X i Φ +Ψ X i. (2 The expression is similar for the typical planar (resp. vehicular user. There are simple connections etween these quantities which are discussed elow. C. Preliminaries: Properties of the Proposed Cox and its Joint Typicality In the following, the spatial intensity of the Cox point process is evaluated. It is classical. Yet we give its proof to etter explain the proofs of later results. Fact 1. Stationarity and spatial intensity of Cox point processes The vehicular ase stations and vehicular users have spatial intensities λ l µ and λ l µ u, respectively [38.
8 8 Fact 2. Consider two jointly stationary and independent point processes Φ 1 and Φ 2. Then, the Palm proaility of Φ 1 + Φ 2, is given y P Φ = λ 1 λ 1 + λ 2 P Φ 1 + λ 2 λ 1 + λ 2 P Φ 2, (3 where λ 1 and λ 2 are the intensity parameters of Φ 1 and Φ 2, respectively. Proof: Given in [16. We will apply the aove lemma to derive the coverage proaility of the typical user P Φ u+ψ u (SINR > T = λ u P Φ λ u + λ l µ u (SINR > T + λ lµ u P Ψ u }{{} λ u + λ l µ u (SINR > T, (4 u }{{} where (a is under the Palm proaility of Φ u and ( is under the Palm proaility of Ψ u. Therefore, in order to compute the coverage proaility of the typical user, (a and ( need to e derived separately. In particular, Section III considers the Palm proaility with respect to Φ u and Section IV considers it with respect to Ψ u. (a ( III. COVERAGE: PALM PROBABILITY OF Φ u In this section, we work under the Palm distriution P Φ u. Under the latter, there exists a typical planar user at the origin. The suscript of the Palm P Φ u is often omitted in the derivation. Remark 1. Numering of the proposed Cox points We assign two indexes (i, j to each point; the lines are numered y indexes {i} Z according to their distances from the origin; the points of line i are numered y indexes {j} Z according to their distances from {} i which is the point of line i closest to the origin. We utilize the classical numering in [41, Fig Fig. 3 illustrates the proposed counting of this paper. This numering allows one to descrie any Cox points as X i,j = (t j(i cos(θ i r i sin(θ i sgn(θ π/2, t j(i sin(θ i + r i cos(θ i, for all i, j Z 2. To visualize the points on line i, consider a Poisson point process {t j(i } on the X axis. These points are rotated y θ i and and translated y v = (r i sin(θsgn(θ π/2, r i cos(θ, respectively. Since an independent copy of the Poisson process is considered on each line, we simply write t j(i y t j. X i,j = t 2 j + r2 i. A. Association of the Typical Planar User Under the Palm distriution P Φ u, the typical user is associated with its closest ase station: either a planar ase station or a vehicular ase station. We denote these events y X Φ and
9 9 l 2 X2, 1 2 l 1 l 1 X,1 l X2,1 X 1, X, 1 X 1,1 X 2, 2 X 2,1 l 2 Fig. 3. Illustration of the proposed numering for the Cox point process. Notice that k are points on the lines that are closest to the origin. X Ψ, respectively. The user association is an important metric ecause it plays a key role to derive the coverage proaility. Proposition 1. The proailities that the typical planar user is associated with a planar ase station and a vehicular ase station are given y P Φ u (X Φ = 2πλ re πλ r 2 2λ r l 1 e 2µ r 2 t 2 dt dr, (5 respectively. P Φ u (X Ψ = 1 2πλ re πλ r 2 2λ r l 1 e 2µ r 2 t 2 dt dr, (6 Proof: Recalling the user at the origin is a planar user, let us define two random variales R p = inf X i and R v = inf X i. X i Φ X i Ψ They capture the distances from the origin to the nearest planar ase station and to the nearest vehicular ase station, respectively. By recalling the association principle in Eq. (2, the association proaility is given y P Φ u (X Φ = E Φ u [ 1Rp<R v = E [ E [ 1rp<R v R p = r p, where we used the independence assumption. The integrand of the aove conditional expectation is given y 1 Rv>r p X i,j Ψ 1 Xi,j >r p.
10 1 Therefore, the association proaility of the typical planar user is given y E [ E [ 1 Rv>rp R p = E E = E E (a = E E ( = E E X i,j Ψ 1 Xi,j >r p i,j Z 2 1 r 2 i +t 2 j >r2 p r i r p (r i,θ i Ξ r i r p (r i,θ i Ξ E [ (c = E e 2λ rp l 1 e 2µ t j φ l(ri exp ( µ r 2 p t2 dt 1 t 2 j >r Φ p 2 r2 l i 1 1 t 2 >r dt p 2 r2 i, (7 where (a follows from the fact that, conditionally on Φ l, the Poisson point processes on lines are independent. We get ( y using the PGFL formula on the Poisson point process φ l(ri,θ i, and (c y utilizing the PGFL formula of the Poisson point process Ξ on the cylinder. The formula (7 is integrated with the density function of R p, given y f Rp (w = w (1 e πλ w 2 = 2πλ we πλ w 2, where f X (x denotes the proaility distriution function of random variale X. As a result, the association proaility is given y P (X Φ = 2πλ we πλ w 2 2λ l w 1 e 2µ w 2 t 2 dt dw. Notice that P (X Ψ = 1 P (X Φ since (X Ψ = (X Φ c. Eq. (5 or (6 give the spatial average of the associations for Poisson distriuted users. Fig. 4 illustrates the proaility of the typical planar user eing associated with a vehicular ase station. All three curves monotonically increase as µ grows. Notice the horizontal axis is log-scaled. The spatial intensity, λ l µ, varies from 1/km 2 to 1/km 2. Interestingly, when the spatial intensities of the planar and vehicular ase stations are exactly the same, i.e., in the middle curve, where λ = λ l µ = 1/km 2, the typical planar user is slightly more likely to e associated with a planar ase station.
11 λ l =2/km,λ =1/km 2 λ l =1/km,λ p =1/km 2 λ l =1/km,λ p =2/km 2.7 Pr (X* Φu Ψ µ (unit: x/km Fig. 4. The proaility that the typical planar user is associated with a vehicular ase station on road. The horizontal axis is log-scaled. Corollary 1. Under the Palm distriution of Φ u, the distriution of the distance from the origin to the nearest ase station is given y f R (r =2πλ re πλ r (1 2 e 2λ r l 1 e 2µ r 2 t 2 dt + e πλ r 2 r 2λ r l 1 e 2µ r 2 u 2 du 4λ l µ re 2µ r 2 u 2 du. (8 r2 u 2 Proof: The proof immediately follows from the fact that the distance from the origin to the nearest ase station is given y the minimum of independent random variales R p and R v. B. Coverage Proaility of the Typical Planar User The coverage proaility under the Palm proaility of Φ u is given y P Φ u (SINR > T = P Φ u (SINR > T, X Φ + P Φ u (SINR > T, X Ψ. In the following, each term of the aove expression is otained in the form of an integral.
12 12 Lemma 1. The coverage proaility y a planar ase station is given y P Φ u (SINR > T, X Φ = 2πλ re πλ r 2 e 2πλ r exp ( 2λ l r T r α u 1 α 2µ T r α (v 2 +u 2 α 2 1+T r α u α du e 2λ l r 1 e 1+T r α (v 2 +u 2 α 2 1 e 2µ r 2 v 2 2µ T r r α (v 2 +u 2 α 2 2 v 2 1+T r α (v 2 +u 2 α 2 Proof: The coverage proaility y a planar ase station is given y P Φ u (SINR > T, X Φ ( = P ph X α Φ u X k Φ +Ψ \{X ph X } k > T, X α Φ du du dr. (9 [ ( = E Ξ P Φ u H > T X α H X k α, X Φ Ξ X k Φ +Ψ [ ( = E Ξ P Φ u H > T r α H X k α, X Φ X = r, Ξ f X,X Φ Ξ(r dr, X k Φ +Ψ where the integrand of Eq. (1 is ( P Φ u H > T r α H X k α, X Φ X = r, Ξ X k Φ +Ψ ( ( = P H > T r α H X k α 1 Xk >r + H X k α 1 Xk >r X, Ξ. X k Φ X k Ψ Therefore, we have P Φ u (SINR > T, X Φ T rα H X k X = E Ξ E [e 1 Xk >r k Φ } {{ } (a T rα E [e X k Ψ H X k α 1 Xk >r } {{ } ( (1 Ξ f X,X Φ Ξ(r dr. For expression (a, the Laplace transform of the Poisson point process Φ gives E [e T rα H X k α 1 Xk >r X k Φ = e 2πλ T r α u 1 α r 1+T r α u α du. (11
13 13 For expression (, y using the explicit expressions for locations of the Cox points, X i,j = (t j cos(θ i r i sin(θ i, t j sin(θ i + r i cos(θ i, we have [ T r α H X k α 1 Xk >r X E e k Ψ \B(r Ξ X i,j >r = E T rαhi,j Xi,j α e X i,j Ψ Ξ r i r t 2 j >r2 ri 2 r = E e T rα H i,j (ri 2 α i >r +t2 j 2 Ξ E = r i r r i >r exp t j φ l(ri,θ i ( 2µ r 2 r 2 i exp ( 2µ T r α (r 2 i + v 2 α T r α (r 2 i + v2 α 2 T r α (r 2 i + v 2 α T r α (r 2 i + v2 α 2 t j φ l(ri,θ i e T rα H j (r 2 i +t2 j α 2 Ξ, (12 where we used the PGFL formula of the Poisson point processes on lines; lines meeting the all B(r and lines avoiding this all produce different expressions. Finally, the distriution function of the distance from the origin to the nearest ase station with no other ase stations exist inside B(r is given y f X (r, X Φ Ξ = P( X = r, Φ + Ψ (B(r = Ξ ( = r (1 P P(Ψ (B(r = Ξ r i <r = 2πλ re πλ r 2 X i Φ 1 X r r i <r = 2πλ re πλ r 2 E t j φ l(ri,θ i 1 r 2 i +t 2 j >r2 e 2µ r 2 r 2 i, (13 y independence of Φ and Ψ. Comining Eqs. (11, (12, and (13, we get P Φ u (SINR > T, X Φ = E Ξ e 2πλ r T r α u 1 α r i r 1+T r α u α du r i <r 2πλ re πλ r 2 e 2µ r 2 r i 2 T r α (r 2 i +t2 α 2 1+T r α (r 2 i +t2 α 2 dt r i >r e 2µ T r α (r 2 i +t2 α 2 1+T r α (r 2 i +t2 α 2 e 2µ r 2 r 2 i dr. (14 dt
14 14 Using Fuini s theorem, we have r i r r 2 ri 2 2µ r 2 r i 2 E Ξ e 2µ T r α (r 2 i +t2 α 2 1+T r α (r 2 i +t2 α 2 2µ = e 2λ r 2 v 2 2µ T r α (v 2 +u 2 α 2 r l 1 e r 2 v 2 1+T r α (v 2 +u 2 α 2 Incorporating it to Eq. (14 completes the proof. dt r i >r e 2µ T r α (r 2 i +t2 α 2 1+T r α (r 2 i +t2 α 2 du 2µ T r α (v 2 +u 2 α 2 e 2λ l r 1 e 1+T r α (v 2 +u 2 α 2 Lemma 2. The coverage proaility y a vehicular ase station is given y P Φ u (SINR > T, X Ψ = 4λ l µ re πλ r 2 e 2πλ r π/2 exp exp ( ( e 2µ r sin(θ 2µ r sin(θ r 2λ l 1 e 2µ 2λ l r 1 e 2µ T r α u 1 α 1+T r α u α du T r α (r 2 cos 2 (θ+v 2 α 2 1+T r α (r 2 cos 2 (θ+v 2 α 2 dθ r 2 u 2 e 2µ T r r α (u 2 +v 2 α 2 2 u 2 T r α (u 2 +v 2 α 2 1+T r α (u 2 +v 2 α 2 1+T r α (u 2 +v 2 α 2 du dt du du. dr. (15 Proof: Notice that under the event X Ψ, the nearest ase station is on a line. Throughout the paper, we will denote this line and the point of Ξ giving this line y l and (r, θ, respectively. To derive the coverage formula, let us first condition the coverage proaility with respect to the Poisson line process Ξ, then to the line l, and then to the distance to the nearest ase station X, sequentially. Then, we have P Φ u (SINR > T, X Ψ = E Ξ E l P Φ u H > T r α X k Φ +Ψ +φ l (z H X k α, X Ψ X = r, l, Ξ F (r dr, where F (r = f X,X Ψ l,ξ(r, the distriution of the distance from the origin to the nearest vehicular ase station on l given l and Ξ. In a similar way to the proof of Lemma 1, the (16
15 15 proaility inside the triple integrals of (16 is given y P Φ u H > T r α H X k α, X Ψ X k Φ +Ψ +φ l X = r, l, Ξ = P H > T r α H X k α 1 Xk >r X = r, l, Ξ. X k Φ +Ψ +φ l Therefore, it is descried y the product of the following expressions T rα H k X k X E [e α 1 Xk >r k Φ =e 2πλ T r α u 1 α r 1+T r α u α du. (17 T rα E [e X k Ψ H k X k α 1 Xk >r Ξ = r i r e 2µ r 2 r i 2 T r α (r 2 i +v2 α 2 1+T r α (r 2 i +v2 α 2 E z 2 +t 2 j >r2 e t j φ l (z T rα(z2+t2 j α 2 r i >r (r, θ = (z, θ = e 2µ e 2µ T r α (r 2 i +v2 α 2 1+T r α (r 2 i +v2 α 2 r 2 z 2 T r α (z 2 +v 2 α 2 1+T r α (z 2 +v 2 α 2. (18, (19 where Eq. (19 is otained y the Laplace transform of the Poisson point process on the line of parameter (z, θ with z < r. The distriution function F (r of Eq. (16 is the proaility that line l has a point at a distance r and the point process Ψ + Φ + φ l (z is empty of points inside B(r. In other words, f X,X Ψ l,ξ(r = P( X = r, Φ + Ψ (B(r = l, Ξ = P ( X = r, Φ (B(r =, Ψ!l (B(r = = r (1 P(φ l (z(b(r = l P(Φ (B(r = P(Ψ (B(r = Ξ r = r (1 e 2µ i <r r 2 z 2 e πλ r 2 e 2µ r 2 ri 2 = 2µ re 2µ r 2 z 2 r2 z 2 r i <r e πλ r 2 where we used independence and Slivnyak s theorem. e 2µ r 2 r 2 i, (2
16 16 Finally, we apply Fuini s theorem to evaluate the triple integral in (16. By changing the order of integrals, the expectation with respect to l is evaluated first. By Campell s averaging formula, we have [ 2µ re 2µ r 2 z 2 E l (z exp ( 2µ r2 z 2 r 2 z 2 = = r π/2 4λ l µ re 2µ r 2 z 2 exp ( 2µ r2 z 2 r 2 z 2 4λ l µ e 2µ r sin(θ 2µ r sin(θ T r α (r 2 cos 2 (θ+v 2 α 2 1+T r α (r 2 cos 2 (θ+v 2 α 2 T r α (z 2 + v 2 α T r α (z 2 + v 2 α 2 T r α (z 2 + v 2 α T r α (z 2 + v 2 α 2 Then, the integral with respect to the Poisson point process Ξ gives r i r e 2µ r 2 ri 2 2µ T r α (r i 2 +v2 α 2 e r 2 r i 2 1+T r α (r i 2+v2 α r i >r 2 E Ξ = exp exp ( ( r 2λ l 1 e 2µ 2λ l r 1 e 2µ r 2 u 2 e 2µ T r r α (u 2 +v 2 α 2 2 u 2 T r α (u 2 +v 2 α 2 1+T r α (u 2 +v 2 α 2 1+T r α (u 2 +v 2 α 2 du dz dθ. (21 e 2µ du T r α (r 2 i +v2 α 2 1+T r α (r 2 i +v2 α 2, (22 where we use Slivnyak s theorem and the PGFL formula. Comining Eqs. (17, (21 and (22 completes the proof. Another version of proof is provided in Appendix A Fig. 5 illustrates the coverage proaility of the typical planar user. We first consider parameters λ l = 5.34/km, λ = 6.15/km 2, and µ = 5/km. They are proposed to illustrate the 3GPP LTE uran V2X scenario where inter site distance of hexagonal ase station is 5 meters and road lock of Manhattan grid is 25 meters y 433 meters 1 [42. In this setting, the coverage proaility y vehicular ase stations significantly higher than the one provided y planar ase stations. It elaorates the use of vehicle-to-planar user (i.e., planar pedestrians communications since those users have higher coverage y vehicular ase stations than y planar ase stations. We also evaluate the coverage proaility when the densities of vehicular ase stations and planar ase stations are the same: λ l = 5/km, µ = 5/km, and λ = 25/km 2. In this case, the impact of topological differences on the coverage proaility is emphasized. Unexpectedly, planar users still have a slightly higher coverage proaility y vehicular ase stations. In the 1 In the proposed model, the mean area of surface surrounded y Poisson lines is π/λ 2 l. On the other hand, assuming no vehicular ase stations, the mean area of Poisson-Voronoi cell of macro ase station is 1/λ [13. Therefore, inter site distance of 5 meters is translated into λ = 6.15 while the road lock of size 25 meters y 433 meters is translated into λ l = 5.3.
17 coverage y planar λ l =5.34,µ =5, λ =6.15 coverage y vehicular λ l =5.34,µ =5, λ =6.15 coverage λ l =5.34µ =5λ =6.15 coverage y planar λ l =5, µ =5, λ =25 coverage y vehicular λ l =5, µ =5, λ =25 coverage λ l =5, µ =5, λ =25 Coverage proaility SINR threshold (db Fig. 5. The coverage proaility of the typical planar user under the Palm distriution of Φ u. specific scenario, the average distance from the typical planar user to its nearest vehicular ase station is 85 meters while it increases up to 125 meters with its nearest planar ase station. IV. COVERAGE: PALM PROBABILITY OF Ψ u In this section, we derive the user association and coverage proailities under the Palm distriution P Ψ u. Note that under this proaility, the typical vehicular user is located at the origin and there is a road passing through the origin and containing the typical user. As in Section III, Slivnyak s theorem is very useful to produce integral formulas. A. Association of the Typical Vehicular User The typical user is associated with either a planar ase station of Φ or a vehicular ase station of Ψ. These events are denoted y X Φ and X Ψ, respectively. Proposition 2. Under the Palm distriution P Ψ u, the proailities of the typical vehicular user to e associated with a planar ase station and a vehicular ase station are given y respectively. P Ψ u (X Φ = P Ψ u (X Ψ = 1 2πλ we πλ w 2 2µ w 2λ l w 2πλ we πλ w 2 2µ w 2λ l w 1 e 2µ w 2 t 2 dt dw, (23 1 e 2µ w 2 t 2 dt dw, (24
18 18 Proof: Let us denote the line containing the origin and the Poisson process on the line y l and φ l, respectively. Under the Palm distriution of Ψ u, let us define ˆR p = inf X k and ˆRv = inf X k X k Φ X k Ψ +φ l in order to descrie the distances to the nearest points of Φ Proposition 1, the association proaility is given y P Ψ u (X Φ = E Ψ u [1 ˆ Rp< ˆ R v = where the integrand is given as follows: P Ψ u ( ˆR v > r p = E = E X k Ψ +φ l 1 Xk >r t j φ l 1 tj >r p r i <r E E and Ψ, respectively. As in P Ψ u ( ˆR v > rf ˆ Rp (r dr, (25 t j φ l(ri,θ i 1 t 2 j >rp r 2 i 2 Ξ = e 2µ r p e 2λ rp l 1 e 2µ rp 2 t2 dt. (26 Due to the independence property of Poisson point processes, the distriution function of ˆR p is equal to f ˆ Rp (w = 2πλ we πλ w 2. (27 Comining Eqs. (25, (26 and (27 gives the result. The proof is concluded y oserving that P Ψ u (X Ψ = 1 P Ψ u (X Φ. Corollary 2. Under the Palm distriution P Ψ u, the distriution of the distance from the origin to the nearest ase station is given y ( f R (r =2πλ re πλ r 2 e 2µ r 1 e 2λ r l 1 e 2µ r 2 u 2 du ( + e πλ r 2 2µ e 2µ r 1 e 2λ r l 1 e 2µ r 2 u 2 du + e πλ r 2 e 2µ r e 2λ r r l 1 e 2µ r 2 u 2 du 4λ l µ re 2µ r 2 u 2 du. (28 r2 u 2 Proof: The proof immediately follows from the fact that, under the Palm distriution of Ψ u, the distance from the origin to the nearest point of Φ + Ψ is the minimum of the two independent random variales ˆR p and ˆR v. Note that the distriution functions of the nearest distance are different under P Φ u and P Ψ u.
19 19 B. Coverage Proaility of the Typical Vehicular User Since (X Ψ = (X Φ c, the coverage proaility is descried as follows. P Ψ u (SINR > T = P Ψ u (SINR > T, X Φ + P Ψ u (SINR > T, X Ψ. In the following, each term is derived as an integral formula. Lemma 3. Under the Palm distriution of Ψ u, the coverage proaility y a planar ase station is given y P Ψ u (SINR > T, X Φ = e 2µ r T r α u α 1+T r α u α du e 2πλ r 2πλ re πλ r 2 2µ r exp ( T r α u 1 α 2µ T r α (v 2 +u 2 α 2 1+T r α u α du e 2λ r l 1 e r 2 v 2 1+T r α (v 2 +u 2 α 2 2λ l r 1 e 2µ r 2 v 2 2µ T r r α (v 2 +u 2 α 2 2 v 2 1+T r α (v 2 +u 2 α 2 du du Proof: Conditionally on the Poisson point process Ξ and on the distance to the nearest ase station X, the coverage proaility under the Palm distriution of Ψ u is given y P Ψ u (SINR > T, X Φ ( = E P Ψ u H > T r α H X k α, X Ψ X = r, Ξ f X X Ψ Ξ(r dr X k Φ +Ψ = E P H > T r α H X k α, X Ψ X k Φ +Ψ +φ l X = r, Ξ f X X Ψ Ξ(r dr T rα H X k X = E E [e α 1 Xk >r T rα H X k k Φ X E [e α 1 Xk >r k Ψ Ξ }{{}}{{} (a ( [ E e T r α X k φ l H X k α 1 Xk >r dr. (29 f X,X Ψ Ξ(r dr, (3 where (a and ( are given y Eq. (17 and (18, respectively. We have [ E e T r α X k φ l H X k α 1 Xk >r =e 2µ r r T r α v α 1+T r α v α, (31 using the Laplace transform of the Poisson point process φ l, which is independent of Ξ.
20 2 Under the Palm distriution of Ψ u, the distriution of the distance from the origin to the nearest ase station is given y f X,X Φ Ξ(r = P Ψ u ( X = r, X Φ Ξ = r (1 P Ψ u (Φ (B(r = P Ψ u (Ψ (B(r = Ξ = 2πλ re πλ r 2 P(Ψ l (B(r = = 2πλ re πλ r 2 e 2µ r i <r e 2µ r 2 r 2 i, (32 where the last expression is given y Slivnyak s theorem and the independence property: P(Ψ l (B(r = Ξ = P(Ψ!l (B(r = Ξ P(φ l (B(r = Ξ = e 2µ r r i <r e 2µ r 2 r 2 i. Comining Eqs. (17, (18, (31, and (32 and applying Fuini s theorem allows one to complete the proof. Lemma 4. Under the Palm proaility of Ψ u, the coverage proaility y a vehicular ase station is given y P Ψ u (SINR > T, X Ψ = P Ψ u (SINR > T, X Ψ, l l }{{} (a + P Ψ u (SINR > T, X Ψ, l l, (33 }{{} ( where (a and ( are given y Eqs. (36 and (38, respectively. More precisely, part (a gives the proaility that the typical vehicular user is covered and its nearest vehicular ase station is on its road, whereas part ( gives the proaility that the typical vehicular user is covered and its nearest vehicular ase station is not on its road. Proof: Under the Palm proaility and under the event {X Ψ }, we can consider two lines that are not necessarily distinct: the one containing the origin, l, and the one containing the nearest ase station l. The coverage proaility is then partitioned into the events {l l } and {l l }, which are denoted y E 1 and E 2, respectively. Then, we have P Ψ u (SINR > T, V = P Ψ u (SINR > T, V, E 1 + P Ψ u (SINR > T, V, E 2,
21 21 where V denotes the event X Ψ. In order to get an expression for (a, we condition on the Poisson line process. Then, the coverage proaility is given y P Ψ u (SINR > T, V, E 1 = E Ξ T rα H k X k X E [e α 1 Xi >r T rα k Φ E [e E [ e T r α X k φ l H k X k α 1 Xi >r X k Ψ H k X k α 1 Xk >r Ξ f X,V,E 1 Ξ(r dr, (34 where the integrand is already given as the product of Eqs. (17, (18 and (31. Analogous to the distriution function given in the proof of Lemma 3, the aove distriution function is f X,V,E 1 Ξ = P Ψ u ( X = r, X Ψ, Φ + Ψ (B(r = Ξ = P l Ψu ( X = r, X φ l, Φ + Ψ!l (B(r = Ξ = r P 1 P l Ψu (Φ + Ψ!l (B(r = Ξ X i φ l 1 Xi r = r (1 exp( 2µ r P(Φ (B(r = Ξ P(Ψ (B(r = Ξ r i <r = 2µ e 2µ r e πλ r 2 e 2µ r 2 r 2 i. (35 Incorporating (17 (18, (31, and (35 into Eq. (34 and applying Fuini s theorem gives P Ψ u (SINR > T, X Φ, l l = e 2πλ r T r α u 1 α 1+T r α u α du 2µ r 2µ e 2µ r πλ r 2 exp ( 2λ l r T r α u α 1+T r α u α du 2λ l r 2µ T r α (v 2 +u 2 α 2 1 e 1+T r α (v 2 +u 2 α 2 1 e 2µ r 2 v 2 2µ T r r α (v 2 +u 2 α 2 2 v 2 1+T r α (v 2 +u 2 α 2 du du dr. (36
22 22 On the other hand, for expression ( of Eq. (33, conditionally on Ξ and on l, the coverage proaility is given y P Ψ u (SINR > T, V, E 2 = E Ξ E l P H > T r α where the integrands are given y P H > T r α = E [e T rα [ E e X k Φ +Ψ +φ l (z +φ l X k Φ +Ψ +φ l (z +φ l T r α X k Φ H k X k α 1 Xk >r X k φ l H k X k α 1 Xk >r H k X k α 1 Xk >r, V, E 2 X, l, Ξ F (r dr, (37 H k X k α 1 Xk >r, V, E 2 X, l, Ξ E [e T rα [ E e T r α X k Ψ H k X k α 1 Xk >r X k φ l H k X k α 1 Xk >r Ξ l, that are already given y Eqs. (17, (18, (31, and (19, respectively. The function F (r is F (r = P Ψ u ( X = r, X φ l, Φ + Ψ (B(r = Ξ, l = P Ψ u ( X = r, X φ l l (z, θ P Ψ u (Φ + Ψ (B(r = Ξ = r 1 P l (z, θ P l Φu (φ l + Φ + Ψ!l (B(r = Ξ X i φ 1 Xi r = 2µ re 2µ r 2 z 2 P(φ l (B(r = P(Φ (B(r = P(Ψ (B(r = Ξ r2 z 2 = 2µ re 2µ r 2 z 2 r2 z 2 r i <r e 2µ r e πλ r 2 e 2µ r 2 r 2 i. Therefore, we comine the aove integrands and the distriution function and apply Fuini s
23 23 theorem to have P Φ u (SINR > T, X Ψ, l l = 4λ l µ re 2µ r πλ r 2 2πλ r π/2 exp exp ( ( e 2µ r sin(θ 2µ r sin(θ r 2λ l 1 e 2µ 2λ l r 1 e 2µ The aove expression gives ( of Eq. (33. T r α u 1 α 1+T r α u α du 2µ r T r α (r 2 cos 2 (θ+v 2 α 2 1+T r α (r 2 cos 2 (θ+v 2 α 2 T r α u α 1+T r α u α du dθ r 2 u 2 e 2µ T r r α (u 2 +v 2 α 2 2 u 2 T r α (u 2 +v 2 α 2 1+T r α (u 2 +v 2 α 2 1+T r α (u 2 +v 2 α 2 du du dr. (38 As a result, adding (36 and (38 gives the proaility that the typical vehicular user is associated with a vehicular ase station and is covered under the Palm distriution of Ψ u. Fig. 6 illustrates the coverage proaility of the typical user under the Palm distriution of Ψ u. Even when the spatial densities of planar ase stations and vehicular ase stations are the same, the coverage proaility provided y planar ase stations is much smaller than the one provided y vehicular ase stations. We can interpret this as follows. In general, under the Palm distriution of Ψ u, most vehicular users are associated with vehicular ase stations and only a small fraction of vehicular users are associated with planar ase stations (Proposition 1. When the vehicular users are associated with planar ase stations, they are easily located at the cell oundaries where interference from neary vehicular ase stations is significant. Note that even with twice more planar ase stations, λ l µ = 5 and λ = 1, the spatial average of the SINR provided y planar ase stations is smaller than that provided y vehicular ase stations. This phenomenon is related to the topology of lines and it should have an impact on the architecture of future cellular networks. V. COVERAGE: PALM PROBABILITY OF Φ u + Ψ u Here, we summarize Lemmas 1 to 4 to evaluate the coverage proaility of the typical user under the Palm distriution of Φ u + Ψ u.
24 coverage y planar λ l =5µ =1λ =1 coverage y vehicular λ l =5µ =1λ =1 coverage λ l =5µ =1λ =1 coverage y planar λ l =5µ =1λ =5 coverage y vehicular λ l =5µ =1λ =5 coverage λ l =5µ =1λ =5 Coverage proaility SINR Threshold (db Fig. 6. Coverage proaility of the typical user under the Palm distriution of Ψ u. A. Coverage Proaility of the Typical User: Deconditioning Theorem 1. The coverage proaility of the typical user is given y p c = λ u P Φ λ u + λ l µ u (SINR > T, X Φ + P Φ u }{{} λ u + λ l µ u (SINR > T, X Ψ u }{{} (a ( λ u + λ lµ u P Ψ λ u + λ l µ u (SINR > T, X Φ + λ lµ u P Ψ u }{{} λ u + λ l µ u (SINR > T, X Ψ, u }{{} (c where (a, (, (c, and (d are given y (9, (15, (29, and (33, respectively. Proof: The proposed model is jointly stationary. Using (3, the coverage proaility is p c = λ u P Φ λ u + λ l µ u (SINR > T + λ lµ u P Ψ u λ u + λ l µ u (SINR > T. u As a result, comining Lemmas from 1 to 4 gives the proof of the theorem. (d B. Interpretation of the Palm Coverage Proailities In a vehicular cellular network, downlink transmissions are divided into four groups: vehicleto-vehicle, vehicle-to-infrastructure, infrastructure-to-vehicle, and infrastructure-to-infrastructure. Each group has different service requirements and operation protocols. For instance, the vehicleto-vehicle communication requires higher reliaility for a shorter distance than the other groups do ecause it might e used in safety applications [1. In the course of this paper, the coverage expression of each communication group was actually derived 2. 2 Here, we consider the Poisson distriuted planar users as infrastructure users y noting their topological equivalence.
25 I2I λ l =5.34, µ =, λ =6.15, α=4 I2I λ =5.34, µ =5, λ =6.15, α=4 l.9 V2I λ l =5.34µ =5λ =6.15, α=4 V2I λ =5.34µ =1λ =6.15, α=4 l.8 I2I λ l =5.34, µ =1, λ =6.15, α=4 I2I λ =5.34µ =λ =6.15α=3 l.8 V2I λ l =5.34µ =15λ =6.15, α=4 V2I λ =5.34, µ =5, λ =6.15α=3 l I2I coverage proaility I2I λ l =5.34, µ =5, λ =6.15, α=3 I2I λ =5.34, µ =1, λ =6.15, α=3 l V2I coverage proaility V2I λ l =5.34, µ =1, λ =6.15α=3 V2I λ =5.34, µ =15, λ =6.15α=3 l SINR threshold (db SINR threshold (db I2V sparse uran areaλ l =3.17, µ =3, λ =3.7, α=3 I2V uran area λ l =5.34, µ =5, λ =6.15, α=4.9 V2V λ =5.34, µ =5, λ =6.15, α=4 l V2V λ l =5.34, µ =1, λ =6.15, α=4.8 I2V dense uran areaλ l =1.68, µ =1, λ =13.3, α=4.8 V2V λ l =5.34, µ =15, λ =6.15, α=4 V2V λ l =7.55, µ =5, λ =6.15, α=4 I2V coverage proaility V2V coverage proaility λ l increases V2V λ l =1.68, µ =5, λ =6.15, α=4 µ increases SINR threshold (db SINR threshold (db Fig. 7. Illustration of the coverage proailities of all typical links presented in the proposed model. The coverage proaility of link from vehicle ase station-to-vehicle user (V2V is P Ψ u (SINR > T X Ψ = P Ψ u (SINR > T, X Ψ P. (39 Ψ u (X Ψ The coverage proaility of link from infrastructure ase stations-to-vehicle users (I2V is P Ψ u (SINR > T X Φ = P Ψ u (SINR > T, X Φ P. (4 Ψ u (X Φ The coverage proaility of link from vehicle ase station-to-infrastructure user (V2I is P Φ u (SINR > T X Ψ = P Φ u (SINR > T, X Ψ P. (41 Φ u (X Ψ The coverage proaility of link from infrastructure ase station-to-infrastructure user (I2I is P Φ u (SINR > T X Φ = P Φ u (SINR > T, X Φ P. (42 Φ u (X Φ All numerators and denominators in Eq. (39-(42 are already provided in previous sections.
26 26 Fig. 7 illustrates the coverage proaility of all possile links present in the proposed network. Let us first investigate the coverage of infrastructure users. The upper left figure illustrates the I2I coverage proaility. As the numer of vehicular ase stations increases, µ = 5, 1, 15/km, the typical infrastructure user experiences a lower coverage proaility. Similarly, as illustrated in the upper right figure, the V2I coverage proaility diminishes as the density of vehicular ase stations grows. Then, let us investigate the coverage of vehicular users. In the lower right figure, we oserve that as the numer of vehicular ase station increases the V2V coverage proaility increases. This is ecause the typical vehicle is more likely to have an increased desired signal power. In contrast, as the size of road locks shrinks, λ l = 5.34, 7.55, 1.88/km, the V2V coverage proaility decreases. This happens ecause the typical vehicular user is associated with vehicular ase stations on the same line at the same average distance; nevertheless, it is exposed to an increased interference from vehicular ase stations on the other lines. Notice that these trends are sensitive to network parameters and path loss model. For instance, when µ is very small, the trend explained aove could e reversed; with a high proaility, the typical vehicle might e associated with vehicular ase stations on the other lines since there might e no close vehicular ase station on its own line. In the lower left figure, we consider sparse, normal, and dense scenarios where the density of road locks and planar ase stations vary. This figure shows that the I2V coverage proaility is higher in dense areas than in sparse areas. VI. CONCLUSION This paper provides a representation of heterogeneous cellular networks consisting of vehicular ase stations, vehicular users, planar ase stations, and planar users which takes their topological characteristics into account. Vehicular ase stations and users on roads are modeled y Cox point processes given y independent Poisson point processes conditionally on a Poisson line process; on the other hand, planar ase stations and users are modeled y independent Poisson point processes. We characterized the network performance seen y typical users of oth kinds y deriving the association proaility and coverage proaility under the Palm distriution of each user point process. This allows us to otain analytical expressions for the coverage proailities of all possile links present in the proposed network architecture. This rings a first understanding on the asic performance metrics such as user association proaility, interference power distriution, and coverage proaility, ut also provides a
27 27 framework for future research on practical scenarios in future cellular architecture ased on vehicles. For instance, this framework could e used to address resource allocation prolems in the presence of simultaneous vehicular and planar links with possily different quality of service requirements. ACKNOWLEDGMENT This work is supported in part y the National Science Foundation under Grant No. NSF-CCF and an award from the Simons Foundation (#197982, oth to the University of Texas at Austin. REFERENCES [1 G. Karagiannis, O. Altintas, E. Ekici, G. Heijenk, B. Jarupan, K. Lin, and T. Weil, Vehicular networking: A survey and tutorial on requirements, architectures, challenges, standards and solutions, IEEE Commun. Surveys Tuts, vol. 13, no. 4, pp , 211. [2 3GPP TS , Evolved universal terrestrial radio access (E-UTRA; physical channels and modulation. [3 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 , 213. [4 H. Seo, K.-D. Lee, S. Yasukawa, Y. Peng, and P. Sartori, LTE evolution for vehicle-to-everything services, IEEE Commun. Mag., vol. 54, no. 6, pp , 216. [5 Veniam: An Internet of moving things, accessed: [6 K. Zheng, Q. Zheng, P. Chatzimisios, W. Xiang, and Y. Zhou, Heterogeneous vehicular networking: a survey on architecture, challenges, and solutions, IEEE Commun. Surveys Tuts., vol. 17, no. 4, pp , 215. [7 P. Gupta and P. R. Kumar, The capacity of wireless networks, IEEE Trans. Inf. Theory, vol. 46, no. 2, pp , 2. [8 M. Grossglauser and D. Tse, Moility increases the capacity of ad-hoc wireless networks, in Proc. IEEE INFOCOM, vol. 3, 21, pp [9 J. Li, C. Blake, D. S. De Couto, H. I. Lee, and R. Morris, Capacity of ad hoc wireless networks, in Proc. ACM MoiCom, 21, pp [1 J. Zhao and G. Cao, VADD: Vehicle-assisted data delivery in vehicular ad hoc networks, IEEE Trans. Veh. Technol., vol. 57, no. 3, pp , May 28. [11 Y.-C. Tseng, S.-Y. Ni, Y.-S. Chen, and J.-P. Sheu, The roadcast storm prolem in a moile ad hoc network, Wireless Networks, vol. 8, no. 2/3, pp , 22. [12 C. Perkins, E. Belding-Royer, and S. Das, Ad hoc on-demand distance vector (AODV routing, Tech. Rep., 23. [13 S. N. Chiu, D. Stoyan, W. S. Kendall, and J. Mecke, Stochastic geometry and its applications. John Wiley & Sons, 213. [14 F. Baccelli and B. Błaszczyszyn, On a coverage process ranging from the Boolean model to the Poisson Voronoi tessellation, with applications to wireless communications, A. in Appl.Pro. (SGSA, vol. 33, no. 2, pp , 21. [15 F. Baccelli, B. Blaszczyszyn, and P. Muhlethaler, An aloha protocol for multihop moile wireless networks, IEEE Trans. Inf. Theory, vol. 52, no. 2, pp , Fe. 26.
28 28 [16 F. Baccelli and B. Blaszczyszyn, Stochastic geometry and wireless networks, Volumn I-Theory. Now Pulishers Inc, 29, vol. 1. [17 M. Haenggi, J. G. Andrews, F. Baccelli, O. Dousse, and M. Franceschetti, Stochastic geometry and random graphs for the analysis and design of wireless networks, IEEE J. Sel. Areas Commun., vol. 27, no. 7, pp , Sept. 29. [18 M. Haenggi, R. K. Ganti et al., Interference in large wireless networks, Foundations and Trends in Networking, vol. 3, no. 2, pp , 29. [19 J. Andrews, F. Baccelli, and R. Ganti, A tractale approach to coverage and rate in cellular networks, IEEE Trans. Commun., vol. 59, no. 11, pp , Nov [2 B. Błaszczyszyn, M. K. Karray, and H. P. Keeler, Using Poisson processes to model lattice cellular networks, in Proc. IEEE INFOCOM, 213, pp [21 H. P. Keeler, B. Błaszczyszyn, and M. K. Karray, SINR-ased k-coverage proaility in cellular networks with aritrary shadowing, in Proc. IEEE ISIT, 213, pp [22 C. Li, J. Zhang, and K. B. Letaief, Throughput and energy efficiency analysis of small cell networks with multi-antenna ase stations, IEEE Trans. Wireless Commun., vol. 13, no. 5, pp , May 214. [23 M. Di Renzo and P. Guan, Stochastic geometry modeling and system-level analysis of uplink heterogeneous cellular networks with multi-antenna ase stations, IEEE Trans. Commun., vol. 64, no. 6, pp , June 216. [24 T. Bai and R. W. Heath, Coverage and rate analysis for millimeter-wave cellular networks, IEEE Trans. Wireless Commun., vol. 14, no. 2, pp , Fe [25 M. Di Renzo, Stochastic geometry modeling and analysis of multi-tier millimeter wave cellular networks, IEEE Trans. Wireless Commun., vol. 14, no. 9, pp , Sept [26 H.-S. Jo, Y. J. Sang, P. Xia, and J. G. Andrews, Heterogeneous cellular networks with flexile cell association: A comprehensive downlink SINR analysis, IEEE Trans. Wireless Commun., vol. 11, no. 1, pp , Oct [27 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. 3, no. 3, pp , Apr [28 W. C. Cheung, T. Q. Quek, and M. Kountouris, Throughput optimization, spectrum allocation, and access control in two-tier femtocell networks, IEEE J. Sel. Areas Commun., vol. 3, no. 3, pp , Apr [29 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 , Aug [3 Q. Ye, B. Rong, Y. Chen, M. Al-Shalash, C. Caramanis, and J. G. Andrews, User association for load alancing in heterogeneous cellular networks, IEEE Trans. Wireless Commun., vol. 12, no. 6, pp , June 213. [31 N. Miyoshi and T. Shirai, A cellular network model with Ginire configured ase stations, Aances in Applied Proaility, vol. 46, no. 3, pp , 214. [32 Y. J. Chun, M. O. Hasna, and A. Ghraye, Modeling heterogeneous cellular networks interference using poisson cluster processes, IEEE J. Sel. Areas Commun., vol. 33, no. 1, pp , Oct [33 Y. Li, F. Baccelli, H. S. Dhillon, and J. G. Andrews, Statistical modeling and proailistic analysis of cellular networks with determinantal point processes, IEEE Trans. Commun., vol. 63, no. 9, pp , Dec [34 C. S. Choi, J. O. Woo, and J. G. Andrews, An analytical framework for modeling a spatially repulsive cellular network, IEEE Trans. Commun., vol. PP, no. 99, pp. 1 1, 217. [35 F. Baccelli and S. Zuyev, Stochastic geometry models of moile communication networks, Frontiers in queueing, pp , [36 B. Blaszczyszyn, P. Mühlethaler, and Y. Toor, Maximizing throughput of linear vehicular ad-hoc networks (VANETsa stochastic approach, in Proc. IEEE EW, 29, pp
Poisson Cox Point Processes for Vehicular Networks
Poisson Cox Point Processes for Vehicular Networks arxiv:8.4556v cs.it 4 Jan 28 Chang-Sik Choi and Franc ois Baccelli Abstract This paper analyzes statistical properties of the Poisson line Cox point process
More informationJoint Energy and SINR Coverage in Spatially Clustered RF-powered IoT Network
Joint Energy and SINR Coverage in Spatially Clustered RF-powered IoT Network Mohamed A. Ad-Elmagid, Mustafa A. Kishk, and Harpreet S. Dhillon arxiv:84.9689v [cs.it 25 Apr 28 Astract Owing to the uiquitous
More informationOutage and Capacity of Heterogeneous Cellular Networks with Intra-tier Dependence
Outage and Capacity of Heterogeneous Cellular Networks with Intra-tier Dependence Na Deng, Wuyang Zhou Dept. of Electronic Engineering and Information Science University of Science and Technology of China
More informationAverage Throughput Analysis of Downlink Cellular Networks with Multi-Antenna Base Stations
Average Throughput Analysis of Downlink Cellular Networks with Multi-Antenna Base Stations Rui Wang, Jun Zhang, S.H. Song and K. B. Letaief, Fellow, IEEE Dept. of ECE, The Hong Kong University of Science
More informationOptimal Area Power Efficiency in Cellular Networks
Optimal Area Power Efficiency in Cellular Networks Bhanukiran Peraathini 1, Marios Kountouris, Mérouane Deah and Alerto Conte 1 1 Alcatel-Lucent Bell Las, 916 Nozay, France Department of Telecommunications,
More informationAsymptotics and Meta-Distribution of the Signal-to-Interference Ratio in Wireless Networks
Asymptotics and Meta-Distribution of the Signal-to-Interference Ratio in Wireless Networks Part II Martin Haenggi University of Notre Dame, IN, USA EPFL, Switzerland 25 Simons Conference on Networks and
More informationTight Bounds on the Laplace Transform of Interference in a Poisson Hole Process
Tight Bounds on the Laplace Transform of Interference in a Poisson Hole Process einab Yazdanshenasan, Harpreet S. hillon, Mehrnaz Afshang, and Peter Han Joo Chong Abstract To maintain tractability, interference
More informationAnalysis of Urban Millimeter Wave Microcellular Networks
Analysis of Urban Millimeter Wave Microcellular Networks Yuyang Wang, KiranVenugopal, Andreas F. Molisch, and Robert W. Heath Jr. The University of Texas at Austin University of Southern California TheUT
More informationDNA-GA: A New Approach of Network Performance Analysis
DNA-GA: A New Approach of Network Performance Analysis Ming Ding, Data 6, Australia {Ming.Ding@nicta.com.au} David López Pérez, Bell Las Alcatel-Lucent, Ireland {dr.david.lopez@ieee.org} Guoqiang Mao,
More informationDelay-Based Connectivity of Wireless Networks
Delay-Based Connectivity of Wireless Networks Martin Haenggi Abstract Interference in wireless networks causes intricate dependencies between the formation of links. In current graph models of wireless
More informationALOHA Performs Optimal Power Control in Poisson Networks
ALOHA erforms Optimal ower Control in oisson Networks Xinchen Zhang and Martin Haenggi Department of Electrical Engineering University of Notre Dame Notre Dame, IN 46556, USA {xzhang7,mhaenggi}@nd.edu
More informationSINR-based coverage probability in cellular networks under multiple connections
SINR-based coverage probability in cellular networks under multiple connections H.P. Keeler, B. Błaszczyszyn and M. K. Karray arxiv:131.6491v2 [cs.ni] 4 Feb 213 Abstract We give numerically tractable,
More informationOn the Expected Rate of Slowly Fading Channels with Quantized Side Information
On the Expected Rate of Slowly Fading Channels with Quantized Side Information Thanh Tùng Kim and Mikael Skoglund 2005-10-30 IR S3 KT 0515 c 2005 IEEE. Personal use of this material is permitted. However,
More informationQuality of Real-Time Streaming in Wireless Cellular Networks : Stochastic Modeling and Analysis
Quality of Real-Time Streaming in Wireless Cellular Networs : Stochastic Modeling and Analysis B. Blaszczyszyn, M. Jovanovic and M. K. Karray Based on paper [1] WiOpt/WiVid Mai 16th, 2014 Outline Introduction
More informationSIR Distribution and Scheduling Gain of Normalized SNR Scheduling in Poisson Networks
SIR Distribution and Scheduling Gain of Normalized SNR Scheduling in Poisson Networs Koji Yamamoto Graduate School of Informatics, Kyoto University Yoshida-honmachi, Sayo-u, Kyoto, 66-85 Japan yamamot@i.yoto-u.ac.jp
More informationA Sufficient Condition for Optimality of Digital versus Analog Relaying in a Sensor Network
A Sufficient Condition for Optimality of Digital versus Analog Relaying in a Sensor Network Chandrashekhar Thejaswi PS Douglas Cochran and Junshan Zhang Department of Electrical Engineering Arizona State
More informationRenewables powered cellular networks: Energy field modeling and network coverage
Title Renewales powered cellular networks: Energy field modeling and network coverage Authors Huang, K; Kountouris, M; Li, VOK Citation IEEE Transactions on Wireless Communications, 4, v 4 n 8, p 434-447
More informationLearning-Based Task Offloading for Vehicular Cloud Computing Systems
Learning-Based Task Offloading for Vehicular Cloud Computing Systems Yuxuan Sun, Xueying Guo, Sheng Zhou, Zhiyuan Jiang, Xin Liu, Zhisheng Niu Tsinghua National Laoratory for Information Science and Technology
More informationMachine-Type Communication with Random Access and Data Aggregation: A Stochastic Geometry Approach
Machine-Type Communication with Random Access and Data Aggregation: A Stochastic Geometry Approach Jing Guo, Salman Durrani, Xiangyun Zhou, and Halim Yanikomeroglu Research School of Engineering, The Australian
More informationCellular-Assisted Vehicular Communications: A Stochastic Geometric Approach
Cellular-Assisted Vehicular Communications: A Stochastic Geometric Approach Sayantan Guha Thesis submitted to the Faculty of the Virginia Polytechnic Institute and State University in partial fulfillment
More informationPower Allocation and Coverage for a Relay-Assisted Downlink with Voice Users
Power Allocation and Coverage for a Relay-Assisted Downlink with Voice Users Junjik Bae, Randall Berry, and Michael L. Honig Department of Electrical Engineering and Computer Science Northwestern University,
More informationCoverage and Area Spectral Efficiency of Clustered Device-to-Device Networks
Coverage and Area Spectral Efficiency of Clustered Device-to-Device Networks Mehrnaz Afshang, Harpreet S. Dhillon, and Peter Han Joo Chong Abstract This paper develops a new spatial model for deviceto-device
More informationAnalysis of Uncoordinated Opportunistic Two-Hop Wireless Ad Hoc Systems
Analysis of Uncoordinated Opportunistic Two-Hop Wireless Ad Hoc Systems Radha Krishna Ganti and Martin Haenggi Department of Electrical Engineering University of Notre Dame Notre Dame, IN 46556, USA {rganti,mhaenggi}@nd.edu
More informationStochastic geometry and communication networks,
Stochastic geometry and communication networks Bartek Błaszczyszyn tutorial lecture Performance conference Juan-les-Pins, France, October 3-7, 25 OUTLINE I Panorama of some stochastic-geometry models in
More informationSIR Asymptotics in General Cellular Network Models
SIR Asymptotics in General Cellular Network Models Radha Krishna Ganti Department of Electrical Engineering Indian Institute of Technology, Madras Hyderabad, India 55 rganti@ee.iitm.ac.in Martin Haenggi
More informationStructuring Unreliable Radio Networks
Structuring Unreliale Radio Networks Keren Censor-Hillel Seth Gilert Faian Kuhn Nancy Lynch Calvin Newport March 29, 2011 Astract In this paper we study the prolem of uilding a connected dominating set
More informationNOMA: Principles and Recent Results
NOMA: Principles and Recent Results Jinho Choi School of EECS GIST September 2017 (VTC-Fall 2017) 1 / 46 Abstract: Non-orthogonal multiple access (NOMA) becomes a key technology in 5G as it can improve
More informationAN EXACT SOLUTION FOR OUTAGE PROBABILITY IN CELLULAR NETWORKS
1 AN EXACT SOLUTION FOR OUTAGE PROBABILITY IN CELLULAR NETWORKS Shensheng Tang, Brian L. Mark, and Alexe E. Leu Dept. of Electrical and Computer Engineering George Mason University Abstract We apply a
More informationLow-High SNR Transition in Multiuser MIMO
Low-High SNR Transition in Multiuser MIMO Malcolm Egan 1 1 Agent Technology Center, Faculty of Electrical Engineering, Czech Technical University in Prague, Czech Republic. 1 Abstract arxiv:1409.4393v1
More informationA Capacity Upper Bound for Large Wireless Networks with Generally Distributed Nodes
Capacity Upper Bound for Large Wireless Networks with Generally Distributed Nodes Guoqiang Mao, Zihuai Lin School of Electrical and Information Engineering The University of Sydney Email: {guoqiang.mao,
More informationStronger wireless signals appear more Poisson
1 Stronger wireless signals appear more Poisson Paul Keeler, Nathan Ross, Aihua Xia and Bartłomiej Błaszczyszyn Abstract arxiv:1604.02986v3 [cs.ni] 20 Jun 2016 Keeler, Ross and Xia [1] recently derived
More informationFailure-Resilient Ad Hoc and Sensor Networks in a Shadow Fading Environment
Failure-Resilient Ad Hoc and Sensor Networks in a Shadow Fading Environment Christian Bettstetter DoCoMo Euro-Labs, Future Networking Lab, Munich, Germany lastname at docomolab-euro.com Abstract This paper
More informationUplink Performance Analysis of Dense Cellular Networks with LoS and NLoS Transmissions
Uplink Performance Analysis of Dense Cellular Networks with LoS and os ransmissions ian Ding, Ming Ding, Guoqiang Mao, Zihuai Lin, David López-Pérez School of Computing and Communications, he University
More informationTRANSMISSION STRATEGIES FOR SINGLE-DESTINATION WIRELESS NETWORKS
The 20 Military Communications Conference - Track - Waveforms and Signal Processing TRANSMISSION STRATEGIES FOR SINGLE-DESTINATION WIRELESS NETWORKS Gam D. Nguyen, Jeffrey E. Wieselthier 2, Sastry Kompella,
More informationCoverage and Rate Analysis for Massive MIMO-enabled Heterogeneous Networks with Millimeter wave Small Cells
Coverage and Rate Analysis for Massive MIMO-enabled Heterogeneous etworks with Millimeter wave Small Cells Anum Umer, Syed Ali Hassan, Haris Pervaiz, Qiang i and eila Musavian School of Electrical Engineering
More informationMmWave vehicle-to-infrastructure communication: Analysis of urban microcellular networks
1 MmWave vehicle-to-infrastructure communication: Analysis of urban microcellular networks Yuyang Wang, Student Member, IEEE, Kiran Venugopal, Student Member, IEEE, arxiv:1702.08122v3 [cs.ni] 12 Apr 2018
More informationPERFORMANCE COMPARISON OF DATA-SHARING AND COMPRESSION STRATEGIES FOR CLOUD RADIO ACCESS NETWORKS. Pratik Patil, Binbin Dai, and Wei Yu
PERFORMANCE COMPARISON OF DATA-SHARING AND COMPRESSION STRATEGIES FOR CLOUD RADIO ACCESS NETWORKS Pratik Patil, Binbin Dai, and Wei Yu Department of Electrical and Computer Engineering University of Toronto,
More informationTransmission Throughput of Decentralized Overlaid Networks with Outage Constraints
Transmission Throughput of Decentralized Overlaid Networks with Outage Conraints Chengzhi Li and Huaiyu Dai Department of Electrical and Computer Engineering North Carolina State University Raleigh NC
More informationExploiting Quantization Uncertainty for Enhancing Capacity of Limited-Feedback MISO Ad Hoc Networks
Exploiting Quantization Uncertainty for Enhancing Capacity of Limited-Feedback MISO Ad Hoc Networks Mohammad G. Khoshkholgh, A. A. Haghighi @, Keivan Navaie, Kang G. Shin, Victor C. M. Leung The University
More informationPerformance analysis of cellular networks with opportunistic scheduling using queueing theory and stochastic geometry
Performance analysis of cellular networks with opportunistic scheduling using queueing theory and stochastic geometry Bartlomiej Blaszczyszyn, Mohamed Kadhem Karray To cite this version: Bartlomiej Blaszczyszyn,
More informationSINR Model with Best Server Association for High Availability Studies of Wireless Networks
SINR Model with Best Server Association for High Availability Studies of Wireless Networks 1 David Öhmann, Ahmad Awada, Ingo Viering, Meryem Simsek, Gerhard P. Fettweis arxiv:1510.04503v2 [cs.ni] 29 Oct
More informationInterference and Throughput in Aloha-based Ad Hoc Networks with Isotropic Node Distribution
Interference and Throughput in Aloha-based Ad Hoc Networks with Isotropic Node Distribution Ralph Tanbourgi, Holger Jäkel, Leonid Chaichenets and Friedrich K. Jondral Communications Engineering Lab, Karlsruhe
More informationCell Association: A Comprehensive Downlink SINR Analysis
Heterogeneous Cellular Networks with Flexible Cell Association: A Comprehensive Downlink SINR Analysis Han-Shin Jo, Young Jin Sang, Ping Xia, and Jeffrey G. Andrews arxiv:7.362v [cs.it] 9 Jul 2 Abstract
More informationLuis Manuel Santana Gallego 100 Investigation and simulation of the clock skew in modern integrated circuits. Clock Skew Model
Luis Manuel Santana Gallego 100 Appendix 3 Clock Skew Model Xiaohong Jiang and Susumu Horiguchi [JIA-01] 1. Introduction The evolution of VLSI chips toward larger die sizes and faster clock speeds makes
More informationJoint FEC Encoder and Linear Precoder Design for MIMO Systems with Antenna Correlation
Joint FEC Encoder and Linear Precoder Design for MIMO Systems with Antenna Correlation Chongbin Xu, Peng Wang, Zhonghao Zhang, and Li Ping City University of Hong Kong 1 Outline Background Mutual Information
More informationI. INTRODUCTION. Definition 2: (Spatial contention parameter contention is
IEEE/ACM TRANSACTIONS ON NETWORKING 1 Outage Probability of General Ad Hoc Networks in the High-Reliability Regime Riccardo Giacomelli, Radha Krishna Ganti, Member, IEEE, and Martin Haenggi, Senior Member,
More informationCell throughput analysis of the Proportional Fair scheduler in the single cell environment
Cell throughput analysis of the Proportional Fair scheduler in the single cell environment Jin-Ghoo Choi and Seawoong Bahk IEEE Trans on Vehicular Tech, Mar 2007 *** Presented by: Anh H. Nguyen February
More informationInformation in Aloha Networks
Achieving Proportional Fairness using Local Information in Aloha Networks Koushik Kar, Saswati Sarkar, Leandros Tassiulas Abstract We address the problem of attaining proportionally fair rates using Aloha
More informationBounds on Information Propagation Delay in Interference-Limited ALOHA Networks
Bounds on Information Propagation Delay in Interference-Limited ALOHA Networks Radha Krishna Ganti and Martin Haenggi Department of Electrical Engineering University of Notre Dame Notre Dame, IN 46556,
More informationEnabling Wireless Power Transfer in Cellular Networks: Architecture, Modeling and Deployment
Title Enaling Wireless Power Transfer in Cellular Networks: Architecture, Modeling and Deployment Author(s) Huang, K; Lau, VKN Citation IEEE Transactions on Wireless Communications, 2014, v. 13 n. 2, p.
More informationDynamic Connectivity and Path Formation Time in Poisson Networks
Noname manuscript No. (will be inserted by the editor) Dynamic Connectivity and Path Formation Time in Poisson Networks Radha Krishna Ganti Martin Haenggi Received: date / Accepted: date Abstract The connectivity
More informationMmWave Vehicle-to-infrastructure Communication: Analysis of Urban Microcellular Networks
Technical Report 123 MmWave Vehicle-to-infrastructure Communication: Analysis of Urban Microcellular Networks Research Supervisor Robert Heath Wireless Networking and Communications Group May 2017 Project
More informationCall Completion Probability in Heterogeneous Networks with Energy Harvesting Base Stations
Call Completion Probability in Heterogeneous Networks with Energy Harvesting Base Stations Craig Wang, Salman Durrani, Jing Guo and Xiangyun (Sean) Zhou Research School of Engineering, The Australian National
More informationSpectrum Opportunity Detection with Weak and Correlated Signals
Specum Opportunity Detection with Weak and Correlated Signals Yao Xie Department of Elecical and Computer Engineering Duke University orth Carolina 775 Email: yaoxie@dukeedu David Siegmund Department of
More informationarxiv: v1 [cs.ni] 28 Nov 2014
Performance laws of large heterogeneous cellular networks Bartłomiej Błaszczyszyn, Miodrag Jovanovic and Mohamed Kadhem Karray arxiv:4.7785v [cs.ni] 28 Nov 204 Abstract We propose a model for heterogeneous
More informationStatistical Modeling of Co-Channel Interference
Statistical Modeling of Co-Channel Interference Kapil Gulati, Aditya Chopra, Brian L. Evans and Keith R. Tinsley The University of Texas at Austin, Austin, Texas 7871 Email: gulati,chopra,bevans}@ece.utexas.edu
More informationThe Impact of Correlated Blocking on Millimeter-Wave Personal Networks
The Impact of Correlated Blocking on Millimeter-Wave Personal Networks Enass Hriba and Matthew C. Valenti West Virginia University, Morgantown, WV, USA. arxiv:89.8372v [cs.it] 22 Sep 28 Abstract Due to
More informationOn a coverage model in communications and its relations to a Poisson-Dirichlet process
On a coverage model in communications and its relations to a Poisson-Dirichlet process B. Błaszczyszyn Inria/ENS Simons Conference on Networks and Stochastic Geometry UT Austin Austin, 17 21 May 2015 p.
More informationDepth versus Breadth in Convolutional Polar Codes
Depth versus Breadth in Convolutional Polar Codes Maxime Tremlay, Benjamin Bourassa and David Poulin,2 Département de physique & Institut quantique, Université de Sherrooke, Sherrooke, Quéec, Canada JK
More informationTwo-Stage Channel Feedback for Beamforming and Scheduling in Network MIMO Systems
Two-Stage Channel Feedback for Beamforming and Scheduling in Network MIMO Systems Behrouz Khoshnevis and Wei Yu Department of Electrical and Computer Engineering University of Toronto, Toronto, Ontario,
More informationCooperative HARQ with Poisson Interference and Opportunistic Routing
Cooperative HARQ with Poisson Interference and Opportunistic Routing Amogh Rajanna & Mostafa Kaveh Department of Electrical and Computer Engineering University of Minnesota, Minneapolis, MN USA. Outline
More informationOn the Capacity of Distributed Antenna Systems Lin Dai
On the apacity of Distributed Antenna Systems Lin Dai ity University of Hong Kong JWIT 03 ellular Networs () Base Station (BS) Growing demand for high data rate Multiple antennas at the BS side JWIT 03
More informationA Tractable Framework for Exact Probability. of Node Isolation and Minimum Node Degree. Distribution in Finite Multi-hop Networks
A Tractable Framework for Exact Probability of Node Isolation and Minimum Node Degree Distribution in Finite Multi-hop Networks arxiv:22.283v3 [cs.it] 29 Nov 203 Zubair Khalid, Member, IEEE, Salman Durrani,
More informationApproximate Queueing Model for Multi-rate Multi-user MIMO systems.
An Approximate Queueing Model for Multi-rate Multi-user MIMO systems Boris Bellalta,Vanesa Daza, Miquel Oliver Abstract A queueing model for Multi-rate Multi-user MIMO systems is presented. The model is
More informationCellular-Enabled UAV Communication: Trajectory Optimization Under Connectivity Constraint
Cellular-Enabled UAV Communication: Trajectory Optimization Under Connectivity Constraint Shuowen Zhang, Yong Zeng, and Rui Zhang ECE Department, National University of Singapore. Email: {elezhsh,elezeng,elezhang}@nus.edu.sg
More informationSINR and Throughput of Dense Cellular Networks with Stretched Exponential Path Loss
1 SINR and Throughput of Dense Cellular Networks with Stretched Exponential Path Loss Ahmad AlAmmouri, Jeffrey G. Andrews, and François Baccelli arxiv:173.8246v1 [cs.it] 23 Mar 217 Abstract Distance-based
More informationNEW generation devices, e.g., Wireless Sensor Networks. Battery-Powered Devices in WPCNs. arxiv: v2 [cs.it] 28 Jan 2016
1 Battery-Powered Devices in WPCNs Alessandro Biason, Student Memer, IEEE, and Michele Zorzi, Fellow, IEEE arxiv:161.6847v2 [cs.it] 28 Jan 216 Astract Wireless powered communication networks are ecoming
More informationDynamic Connectivity and Packet Propagation Delay in ALOHA Wireless Networks
Dynamic Connectivity and Pacet Propagation Delay in ALOHA Wireless Networs Radha Krishna Ganti and Martin Haenggi Department of Electrical Engineering University of Notre Dame Notre Dame, IN 46556, USA
More informationCharacterization of the Burst Aggregation Process in Optical Burst Switching.
See discussions, stats, and author profiles for this pulication at: http://www.researchgate.net/pulication/221198381 Characterization of the Burst Aggregation Process in Optical Burst Switching. CONFERENCE
More informationEE 550: Notes on Markov chains, Travel Times, and Opportunistic Routing
EE 550: Notes on Markov chains, Travel Times, and Opportunistic Routing Michael J. Neely University of Southern California http://www-bcf.usc.edu/ mjneely 1 Abstract This collection of notes provides a
More informationRevisiting Frequency Reuse towards Supporting Ultra-Reliable Ubiquitous-Rate Communication
The 7 International Workshop on Spatial Stochastic Models for Wireless Networks SpaSWiN Revisiting Frequency Reuse towards Supporting Ultra-Reliable Ubiquitous-Rate Communication Jihong Park, Dong Min
More informationarxiv: v1 [cs.it] 12 Jul 2016
Analytical and Simulation Performance of a Typical User in Random Cellular Network Sinh Cong Lam Kumbesan Sandrasegaran Centre for Real-Time Information Networks, Faculty of Engineering and Information
More informationNon Orthogonal Multiple Access for 5G and beyond
Non Orthogonal Multiple Access for 5G and beyond DIET- Sapienza University of Rome mai.le.it@ieee.org November 23, 2018 Outline 1 5G Era Concept of NOMA Classification of NOMA CDM-NOMA in 5G-NR Low-density
More informationMODELING INTERFERENCE IN FINITE UNIFORMLY RANDOM NETWORKS
MODELING INTERFERENCE IN FINITE UNIFORMLY RANDOM NETWORKS Sunil Srinivasa Department of Electrical Engineering University of Notre Dame Notre Dame, IN 46556, USA ssriniv1@nd.edu Martin Haenggi Department
More informationPhase Precoded Compute-and-Forward with Partial Feedback
Phase Precoded Compute-and-Forward with Partial Feedback Amin Sakzad, Emanuele Viterbo Dept. Elec. & Comp. Sys. Monash University, Australia amin.sakzad,emanuele.viterbo@monash.edu Joseph Boutros, Dept.
More informationOptimal Association of Stations and APs in an IEEE WLAN
Optimal Association of Stations and APs in an IEEE 802. WLAN Anurag Kumar and Vinod Kumar Abstract We propose a maximum utility based formulation for the problem of optimal association of wireless stations
More informationJoint Rate and SINR Coverage Analysis for. Decoupled Uplink-Downlink Biased Cell Associations in HetNets
Joint Rate and SINR Coverage Analysis for Decoupled Uplink-Downlink Biased Cell Associations in HetNets Sarabjot Singh, Xinchen Zhang, and Jeffrey G. Andrews arxiv:42.898v2 [cs.it] 24 Mar 205 Abstract
More informationTHE dramatically increased mobile traffic can easily lead
IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, VOL. 34, NO. 12, DECEMBER 2016 3127 Dynamic Base Station Operation in Large-Scale Green Cellular Networks Yue Ling Che, Member, IEEE, Lingjie Duan, Member,
More informationTIGHT BOUNDS FOR THE FIRST ORDER MARCUM Q-FUNCTION
TIGHT BOUNDS FOR THE FIRST ORDER MARCUM Q-FUNCTION Jiangping Wang and Dapeng Wu Department of Electrical and Computer Engineering University of Florida, Gainesville, FL 3611 Correspondence author: Prof.
More informationSINR and Throughput of Dense Cellular Networks with Stretched Exponential Path Loss
SINR and Throughput of Dense Cellular Networks with Stretched Exponential Path Loss Ahmad AlAmmouri, Jeffrey G. Andrews, and François Baccelli arxiv:73.8246v2 [cs.it] 2 Nov 27 Abstract Distance-based attenuation
More informationPower Control in Random Networks: The Effect of Disorder in User Positions
8th International Workshop on Spatial Stochastic Models for Wireless Networks, 4 May 202 Power Control in Random Networks: The Effect of Disorder in User Positions Aris L. Moustakas Physics Dept., Univ.
More informationDifferential Amplify-and-Forward Relaying Using Linear Combining in Time-Varying Channels
Differential Amplify-and-Forward Relaying Using Linear Comining in Time-Varying Channels M. R. Avendi, Ha H. Nguyen and Dac-Binh Ha University of California, Irvine, USA University of Saskatchewan, Saskatoon,
More informationIntegrity-Oriented Content Transmission in Highway Vehicular Ad Hoc Networks
VANET Analysis Integrity-Oriented Content Transmission in Highway Vehicular Ad Hoc Networks Tom Hao Luan, Xuemin (Sherman) Shen, and Fan Bai BBCR, ECE, University of Waterloo, Waterloo, Ontario, N2L 3G1,
More informationPower Control for Discrete-Input Block-Fading Channels. K. D. Nguyen, A. Guillén i Fàbregas and L. K. Rasmussen
Power Control for Discrete-Input Block-Fading Channels K. D. Nguyen, A. Guillén i Fàregas and L. K. Rasmussen CUED / F-INFENG / TR 582 August 2007 Power Control for Discrete-Input Block-Fading Channels
More informationApproximately achieving the feedback interference channel capacity with point-to-point codes
Approximately achieving the feedback interference channel capacity with point-to-point codes Joyson Sebastian*, Can Karakus*, Suhas Diggavi* Abstract Superposition codes with rate-splitting have been used
More informationContent Delivery in Erasure Broadcast. Channels with Cache and Feedback
Content Delivery in Erasure Broadcast Channels with Cache and Feedack Asma Ghorel, Mari Koayashi, and Sheng Yang LSS, CentraleSupélec Gif-sur-Yvette, France arxiv:602.04630v [cs.t] 5 Fe 206 {asma.ghorel,
More informationOnline Scheduling for Energy Harvesting Broadcast Channels with Finite Battery
Online Scheduling for Energy Harvesting Broadcast Channels with Finite Battery Abdulrahman Baknina Sennur Ulukus Department of Electrical and Computer Engineering University of Maryland, College Park,
More informationTravel Grouping of Evaporating Polydisperse Droplets in Oscillating Flow- Theoretical Analysis
Travel Grouping of Evaporating Polydisperse Droplets in Oscillating Flow- Theoretical Analysis DAVID KATOSHEVSKI Department of Biotechnology and Environmental Engineering Ben-Gurion niversity of the Negev
More informationModeling and Analysis of Ergodic Capacity in Network MIMO Systems
Modeling and Analysis of Ergodic Capacity in Network MIMO Systems Kianoush Hosseini, Wei Yu, and Raviraj S. Adve The Edward S. Rogers Sr. Department of Electrical and Computer Engineering University of
More informationCapacity of Cellular Wireless Network
07 5th International Symposium on Modeling and Optimization in Mobile Ad Hoc and Wireless Networks WiOpt Capacity of Cellular Wireless Network Rahul Vaze School of Technology and Computer Science Tata
More informationA Tractable Framework for the Analysis of Dense Heterogeneous Cellular Networks
A Tractable Framework for the Analysis of Dense Heterogeneous Cellular Networks Serkan Ak, Hazer Inaltekin, Member, IEEE, H. Vincent Poor, Fellow, IEEE arxiv:6.567v3 [cs.it] 26 Mar 28 Abstract This paper
More informationHow long before I regain my signal?
How long before I regain my signal? Tingting Lu, Pei Liu and Shivendra S. Panwar Polytechnic School of Engineering New York University Brooklyn, New York Email: tl984@nyu.edu, peiliu@gmail.com, panwar@catt.poly.edu
More informationDelay-Throughput Performance in Mobile Ad-Hoc Networks with Heterogeneous Nodes
Delay-Throughput Performance in Moile Ad-Hoc Networks with Heterogeneous Nodes Valentina Martina Michele Garetto Emilio Leonardi Dipartimento di Informatica, Università di Torino, Italy Dipartimento di
More informationTask Offloading in Heterogeneous Mobile Cloud Computing: Modeling, Analysis, and Cloudlet Deployment
Received January 20, 2018, accepted February 14, 2018, date of publication March 5, 2018, date of current version April 4, 2018. Digital Object Identifier 10.1109/AESS.2018.2812144 Task Offloading in Heterogeneous
More informationCritical value of the total debt in view of the debts. durations
Critical value of the total det in view of the dets durations I.A. Molotov, N.A. Ryaova N.V.Pushov Institute of Terrestrial Magnetism, the Ionosphere and Radio Wave Propagation, Russian Academy of Sciences,
More informationAnalysis of Heterogeneous Wireless Networks Using Poisson Hard-Core Hole Process
Analysis of Heterogeneous Wireless Networks Using Poisson Hard-Core Hole Process Ian Flint, Han-Bae Kong, Member, IEEE, Nicolas Privault, Ping Wang, Senior Member, IEEE and Dusit Niyato, Fellow, IEEE Abstract
More informationA CASE STUDY ON REGULARITY IN CELLULAR NETWORK DEPLOYMENT
A CASE STUDY ON REGULARITY IN CELLULAR NETWORK DEPLOYMENT Jean-Sébastien Gomez, Aurélien Vasseur, Anaïs Vergne, Philippe Martins, Laurent Decreusefond, Wei Chen To cite this version: Jean-Sébastien Gomez,
More informationContinuous-Model Communication Complexity with Application in Distributed Resource Allocation in Wireless Ad hoc Networks
Continuous-Model Communication Complexity with Application in Distributed Resource Allocation in Wireless Ad hoc Networks Husheng Li 1 and Huaiyu Dai 2 1 Department of Electrical Engineering and Computer
More informationTransmitter-Receiver Cooperative Sensing in MIMO Cognitive Network with Limited Feedback
IEEE INFOCOM Workshop On Cognitive & Cooperative Networks Transmitter-Receiver Cooperative Sensing in MIMO Cognitive Network with Limited Feedback Chao Wang, Zhaoyang Zhang, Xiaoming Chen, Yuen Chau. Dept.of
More informationOptimal Power Control in Decentralized Gaussian Multiple Access Channels
1 Optimal Power Control in Decentralized Gaussian Multiple Access Channels Kamal Singh Department of Electrical Engineering Indian Institute of Technology Bombay. arxiv:1711.08272v1 [eess.sp] 21 Nov 2017
More information