Social-Aware Link Reliability Prediction Model Based Minimum Delay Routing for CR-VANETs

Cognitive radio vehicle ad hoc networks (CR-VANETs) can utilize spectrum resources flexibly and efficiently and mitigate the conflict between limited spectrum resources and the ever-increasing demand for vehicular communication services. However, in CR-VANETs, the mobility characteristics of vehicles as well as the dynamic topology changes and frequent disruptions of links can lead to large end-to-end delays. To address this issue, we propose the social-based minimum end-to-end delay routing (SMED) algorithm, which leverages the social attributes of both primary and secondary users to reduce end-to-end delay and packet loss. We analyze the influencing factors of vehicle communication in urban road segments and at intersections, formulate the end-to-end delay minimization problem as a nonlinear integer programming problem, and utilize two sub-algorithms to solve this problem. Simulation results show that, compared to the intersection delay-aware routing algorithm (IDRA) and the expected path duration maximization routing algorithm (EPDMR), our method demonstrates significant improvements in both end-to-end delay and packet loss rate. Specifically, the SMED routing algorithm achieved an average reduction of 11.7% in end-to-end delay compared to EPDMR and 25.0% compared to IDRA. Additionally, it lowered the packet loss rate by 24.9% on average compared to EPDMR and 32.5% compared to IDRA.