Safety In Vehicular Networks Research Articles

Graph Theoretical Models for Enhancing Highway Connectivity and Safety in Vehicular Networks

Vehicular networks play a crucial role in modern transportation systems, significantly impacting connectivity and safety on highways. This paper explores the application of graph theoretical models to enhance both connectivity and safety in vehicular networks. Graph theory, a branch of discrete mathematics, provides a robust framework for modeling and analyzing complex networks, including those formed by vehicles on highways. Our study begins by defining the vehicular network as a graph where nodes represent vehicles, and edges denote communication links between them. We employ various graph theoretical concepts such as connectivity, centrality, and network flow to evaluate and improve the network's performance. Key metrics, including the degree of nodes, clustering coefficients, and shortest path lengths, are utilized to quantify network connectivity and identify critical nodes and edges that influence overall network efficiency. One of the primary objectives is to ensure uninterrupted connectivity in the presence of dynamic and often unpredictable vehicular movement. To this end, we analyze the network's resilience to node failures and propose strategies to enhance robustness using redundancy and alternative routing paths. By incorporating concepts like k-connectivity and network diameter, we develop models that maintain high levels of connectivity despite the removal or failure of multiple nodes or edges. Safety is addressed through the lens of network stability and reliability. We investigate the impact of vehicular density, speed, and communication range on the network's ability to sustain reliable communication channels. Techniques such as dynamic topology management and adaptive power control are proposed to mitigate the risks associated with network fragmentation and communication delays. Furthermore, we introduce optimization algorithms that leverage graph partitioning and community detection to improve the management of vehicular clusters, facilitating efficient data dissemination and reducing the likelihood of congestion-related incidents. The proposed models are validated through simulations that mimic real-world highway conditions, demonstrating significant improvements in both connectivity and safety metrics. In conclusion, the application of graph theoretical models offers a promising approach to enhancing highway connectivity and safety in vehicular networks

TCaS‐VN: A novel V2V communication scheme to improve traffic control and safety in vehicular cloud networks

SummaryRoad accidents and traffic congestion are the unavoidable consequences of the growing number of vehicles on the road. Conventional management systems are not effective in mitigating these issues. However, a range of technologies, including sensors, processors, vehicle‐based resources, and mobile cloud computing, can help solve traffic and safety problems. Vehicular cloud networks, a cutting‐edge technology for the development of intelligent transportation systems, face significant challenges, such as ensuring reliable service providers that maintain stable connections between vehicles. Roadside units (RSUs) play a crucial role in these networks, but they come with several drawbacks, including high costs, imbalanced load distribution, and unreliable connections. To address these issues, we propose the Traffic Control and Safety in Vehicular Networks (TCaS‐VN) algorithm, a cloud‐based sharing services framework for vehicles that eliminates the need for RSUs. This approach offers several advantages, including a twofold improvement in the lifetime of clusters, the elimination of noncluster head nodes, a 54% reduction in overhead, a 58% reduction in service search time, and a success rate of over 95% in service provisioning.

An Enhanced Information Sharing Roadside Unit Allocation Scheme for Vehicular Networks

Sharing up-to-date environment information collected by intelligent connected vehicles is critical in achieving travel comfort, convenience, and safety in vehicular networks. Individually collected information should be made available to other vehicular nodes, adjacent or distant, to achieve an informed and well-managed vehicular traffic. The coverage reach of sharing these road data can be maximized by allocating roadside units in strategic positions. In this work, we propose an Enhanced Information SHAring via Roadside Unit Allocation (EISHA–RSU) scheme that strategically determines where RSUs must be deployed from all spatial candidate locations. The urban area is irregularly partitioned into effective regions of movement (ERM) according to vehicular capacity with priority. For each ERM, EISHA–RSU greedily allocates the initial RSU to an effective position and optimally assigns the remaining RSUs to spatial locations that capture the maximum I2V/V2I information sharing based on the area’s average road speed. In effect, the proposed deployment scheme addresses both the issues of coverage and connectivity among vehicles and the infrastructure. We evaluate the proposed RSU allocation scheme by employing three urban empirical mobility datasets and compare its network starvation fairness, effectiveness, and efficiency performance measures with three other deployment benchmarks. Overall, EISHA–RSU reduces the number of required RSUs to cover a certain area, exhibits higher connectivity, and achieves maximum I2V/V2I information sharing among the evaluated schemes.

Risk Aware Trust of Information for Improving Safety in Vehicular Networks

Risk Aware Trust of Information for Improving Safety in Vehicular Networks