Searcharxiv⌕ Search

arXiv subjects

Samar Elaraby

Publications and source records attributed to Samar Elaraby.

2 recordsLinked to original sources
arXiv2023

Connectivity Analysis of Directed Highway VANETs using Graph Theory

Graph theory is a promising approach in handling the problem of estimating the connectivity probability of vehicular ad-hoc networks (VANETs). With a communication network represented as graph, graph connectivity indicators become valid for connectivity analysis of communication networks as well. In this article, we discuss two different graph-based methods for VANETs connectivity analysis showing that they capture the same behavior as estimated using probabilistic models. The study is, then, extended to include the case of directed VANETs, resulting from the utilization of different communication ranges by different vehicles. Overall, the graph-based methods prove a robust performance, as they can be simply diversified into scenarios that are too complex to acquire a rigid probabilistic model for them.

cs.NI↗
arXiv2019

Fading Improves Connectivity in Vehicular Ad-hoc Networks

Connectivity analysis is a crucial metric for network performance in vehicular ad-hoc networks (VANETs). Although VANET connectivity has been intensively studied and investigated under no-fading channel models for their simplicity, these models do not represent real-world scenarios that suffer channel impairments. The connectivity probability in a multipath propagation environment is too challenging to be caught by a closed formula due to the emerging complexity associated with the randomness in a fading channel. This leads to contradicting statements about the impact of fading on VANET connectivity. In this paper, we numerically estimate the connectivity probability using graph-based Monte-Carlo simulations aiming for better understanding of the connectivity in fading channels. The results show that Rayleigh-fading channels reinforce the connectivity compared to no-fading models at the same level of transmitting power and vehicle densities. While these findings may seem counterintuitive, they agree with similar behavior that was reported earlier in other ad-hoc networks. Using simulations and stochastic analysis, we thoroughly investigate this effect and provide an intuitive interpretation of the positive impact of fading on connectivity.

cs.NI↗