Abstract

Vehicular ad hoc networks (VANETs) represent an advanced iteration of mobile ad hoc networks (MANETs) designed specifically for internet communication within vehicles. VANETs aim to enable vehicle-to-vehicle (V2V) communication, enhancing safety and convenience for drivers and passengers. However, the open nature of ad hoc networks and the absence of a well-defined line of defense make security a crucial concern for VANETs. Prior to deploying mobile ad hoc networks in hostile or sensitive areas, it becomes imperative to establish robust security services. This study addresses the need for a trusted VANET routing protocol that incorporates a diverse range of security services. The proposed approach implements a secure routing protocol based on the Dijkstra Algorithm to identify the secure and shortest path. For ensuring secure routing, the protocol employs route request (RREQ) and route reply (RREP) mechanisms to identify trustworthy nodes. Additionally, message authentication is utilized to provide end-to-end, hop-to-hop, and entire-route authentication. To transmit messages securely, the Diffie-Hellman Key Exchange Protocol is employed for message encryption, ensuring safe delivery to the intended destination. To assess the performance of the suggested protocol, the authors conducted simulations using NS2. These simulation results demonstrate that the proposed routing protocol outperforms existing methods, affirming its effectiveness in VANET environments.

Full Text
Paper version not known

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 call

Disclaimer: 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.