Abstract
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 <sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">2</sup> ” 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 <sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">2</sup> routes have 100~400s connectivity with only 3~4 hops and achieve 6~15% PDR, which are comparatively more efficient results than that of existing schemes.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
