Abstract

AbstractMaintaining user privacy and security is a critical concern in vehicular ad hoc networks (VANETs). However, prior research has neglected the study of matrix recovery attack methods in VANETs and the challenge of reducing the number of roadside units (RSUs). In this article, we formulate a path recovery strategy using matrix recovery techniques from an adversarial view. Subsequently, the challenge of minimizing RSUs while monitoring all user vehicles in a region is converted into a set cover problem. We introduce a heuristic algorithm that utilizes clustering to address this issue. To minimize matrix recovery errors, a Kalman filter based method is integrated to enhance the performance. This paper also presents an initial deployment of path recovery attacks, maintaining effectiveness even with certain defense mechanisms in place. Furthermore, we conduct simulation experiments to evaluate the effectiveness of the proposed attack strategy. The simulation results demonstrate the performance across various dimensions. Finally, the results show that the success rate of our proposed counter‐defense strategy in overcoming user defenses surpasses 50%.

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.