摘要 : Communications and routing protocols for vehicular ad-hoc networks (VANETs) are affected by dynamic vehicular constraints like high mobility, efficient delivery, reliable path, and trustworthiness. We propose a novel "VAR(2)" sche... 展开 Communications and routing protocols for vehicular ad-hoc networks (VANETs) are affected by dynamic vehicular constraints like high mobility, efficient delivery, reliable path, and trustworthiness. We propose a novel "VAR(2)" scheme that enables autonomous trust and selects routes with the longest connectivity time to efficiently deliver messages. In multi-hop and multi-path VANETs, the proposed scheme ensures reliability by selecting compatible and trustworthy routes with minimum additional communications. Our Python simulations on sparse and dense SUMO traffic traces show that the proposed VAR(2) routes have 100 similar to 400s connectivity with only 3 similar to 4 hops and achieve 6 similar to 15% PDR, which are comparatively more efficient results than that of existing schemes. 收起