Two-Hop Connectivity to the Roadside in a VANET Under the Random Connection Model

We compute the expected number of cars that have at least one two-hop path to a fixed roadside unit in a one-dimensional vehicular ad hoc network in which other cars can be used as relays to reach a roadside unit when they do not have a reliable direct link. The pairwise channels between cars experience Rayleigh fading in the random connection model, and so exist, with probability function of the mutual distance between the cars, or between the cars and the roadside unit. We derive exact equivalents for this expected number of cars when the car density $\rho$ tends to zero and to infinity, and determine its behaviour using an infinite oscillating power series in $\rho$, which is accurate for all regimes. We also corroborate those findings to a realistic situation, using snapshots of actual traffic data. Finally, a normal approximation is discussed for the probability mass function of the number of cars with a two-hop connection to the origin. The probability mass function appears to be well fitted by a Gaussian approximation with mean equal to the expected number of cars with two hops to the origin.

[1]  Dmitri V. Krioukov,et al.  Clustering Implies Geometry in Networks. , 2016, Physical review letters.

[2]  B. Sklar,et al.  Rayleigh fading channels in mobile digital communication systems Part I: Characterization , 1997, IEEE Commun. Mag..

[3]  S.A.G. Chandler,et al.  Calculation of number of relay hops required in randomly located radio network , 1989 .

[4]  François Baccelli,et al.  A correlated shadowing model for urban wireless networks , 2015, 2015 IEEE Conference on Computer Communications (INFOCOM).

[5]  Mohamed-Slim Alouini,et al.  A Stochastic Geometry Model for Multi-Hop Highway Vehicular Communication , 2016, IEEE Transactions on Wireless Communications.

[6]  Brian D. O. Anderson,et al.  Probability of k-Hop Connection under Random Connection Model , 2010, IEEE Communications Letters.

[7]  François Baccelli,et al.  An Analytical Framework for Coverage in Cellular Networks Leveraging Vehicles , 2017, IEEE Transactions on Communications.

[8]  Brian D. O. Anderson,et al.  On the asymptotic connectivity of random networks under the random connection model , 2011, 2011 Proceedings IEEE INFOCOM.

[9]  Yu Zhang,et al.  Analysis of Access and Connectivity Probabilities in Vehicular Relay Networks , 2011, IEEE Journal on Selected Areas in Communications.

[10]  Martin Haenggi,et al.  Reliability Analysis of V2V Communications on Orthogonal Street Systems , 2017, GLOBECOM 2017 - 2017 IEEE Global Communications Conference.

[11]  Guoqiang Mao Connectivity of Communication Networks , 2017 .

[12]  Xavier Pérez-Giménez,et al.  On the relation between graph distance and Euclidean distance in random geometric graphs , 2014, Advances in Applied Probability.

[13]  Marco Fiore,et al.  Vehicular networks on two Madrid highways , 2014, 2014 Eleventh Annual IEEE International Conference on Sensing, Communication, and Networking (SECON).

[14]  Brian D. O. Anderson,et al.  On the Probability of K-hop Connection in Wireless Sensor Networks , 2007, IEEE Communications Letters.

[15]  Carl P. Dettmann,et al.  Connectivity of Soft Random Geometric Graphs over Annuli , 2016 .

[16]  J. Dall,et al.  Random geometric graphs. , 2002, Physical review. E, Statistical, nonlinear, and soft matter physics.

[17]  Christian Poellabauer,et al.  A Stochastic Geometry Approach to the Modeling of DSRC for Vehicular Safety Communication , 2016, IEEE Transactions on Intelligent Transportation Systems.

[18]  Sunwoo Kim,et al.  Counting $k$ -Hop Paths in the Random Connection Model , 2017, IEEE Transactions on Wireless Communications.

[19]  Francois Baccelli,et al.  Analysis of Vehicular Safety Messaging in Cellular Networks , 2020, ArXiv.

[20]  Nicolas Privault,et al.  Moments of k-hop counts in the random-connection model , 2019, Journal of Applied Probability.

[21]  Exact solution of a one-dimensional continuum percolation model , 1996, cond-mat/9610062.

[22]  François Baccelli,et al.  Poisson Cox Point Processes for Vehicular Networks , 2018, IEEE Transactions on Vehicular Technology.

[23]  Yu Zhang,et al.  Multi-Hop Connectivity Probability in Infrastructure-Based Vehicular Networks , 2012, IEEE Journal on Selected Areas in Communications.

[24]  Justin P. Coon,et al.  Full Connectivity: Corners, Edges and Faces , 2012, ArXiv.

[25]  Carl P. Dettmann,et al.  Outage in Motorway Multi-Lane VANETs with Hardcore Headway Distance Using Synthetic Traces , 2019, ArXiv.

[26]  Harpreet S. Dhillon,et al.  Coverage Analysis of a Vehicular Network Modeled as Cox Process Driven by Poisson Line Process , 2017, IEEE Transactions on Wireless Communications.

[27]  Marco Fiore,et al.  Mobility and connectivity in highway vehicular networks: A case study in Madrid , 2016, Comput. Commun..

[28]  Carl P. Dettmann,et al.  Moments of Interference in Vehicular Networks With Hardcore Headway Distance , 2018, IEEE Transactions on Wireless Communications.

[29]  Carl P. Dettmann,et al.  The Meta Distribution of the SIR in Linear Motorway VANETs , 2019, IEEE Transactions on Communications.