Counting Geodesic Paths in 1D VANETs

Abstract

In the IEEE 802.11p standard addressing vehicular communications, Basic Safety Messages (BSMs) can be bundled together and relayed as to increase the effective communication range of transmitting vehicles. This process forms a vehicular ad hoc network (VANET) for the dissemination of safety information. The number of "shortest multihop paths" (or geodesics) connecting two network nodes is an important statistic which can be used to enhance throughput, validate threat events, protect against collusion attacks, infer location information, and also limit redundant broadcasts thus reducing interference. To this end, we analytically calculate for the first time the mean and variance of the number of geodesics in 1D VANETs.

arXiv comment11 pages, 5 figures

References in corpus (3)

• A Semiconductor Nanowire-Based Superconducting Qubit
• Betweenness Centrality in Dense Random Geometric Networks
• Connectivity of confined 3D Networks with Anisotropically Radiating Nodes

Cited by in corpus (6)

• The shape of shortest paths in random spatial networks
• Connectivity in One-Dimensional Soft Random Geometric Graphs
• Euclidean Matchings in Ultra-Dense Networks
• An Introduction to Complex Networks in Climate Finance
• Counting k-Hop Paths in the Random Connection Model
• Connectivity of 1d random geometric graphs