## 4 Related Works  
Over the past few years, there has been a surge in proposals for improving the performance and security of V2X communications. These schemes aim to tackle various network vulnerabilities and assess their impact on performance. However, although certain focus has been directed toward dealing with individual issues related to OLSR contributions to QoS, a few works have focused on addressing OLSR control plane security. [PERSON] et al. conducted a survey on cyber security challenges and solutions for V2X Communications. They examined existing security solutions for V2X communication technology and conducted a threat analysis for V2X enabling technologies. The paper also identifies future research challenges in this area [17]. In [18], the authors introduce a hash chain of secret keys for a Message Authentication Code for V2X communications in order to improve secure message authentication at a substantially lower cost. [PERSON] et al. [19] highlight changes in the communication model and identify the prevalent attack categories on name services infrastructure relevant to the V2X network environment. Ref. [20] suggests incorporating blockchain technology into 5G-based MEC (Multi-access Edge Computing) vehicular networks to enhance security, privacy protection, and content caching. With this proposition, they aim to improve security and management mechanisms for 5G V2X along with MEC. In [21; 22], [PERSON] et al. provide a complete overview of security threats to OLSRv2 and highlight the benefits of addressing security issues to ensure secure and reliable OLSRv2 routing in MANETs. Moreover, in [23], [PERSON] et al. proposed the concept of signature. The purpose of this signature is to prevent malicious nodes from inserting inaccurate information into the network. A signature is created by each OLSR control message sender and transferred with the control message. Furthermore, a timestamp is coupled with each signature in order to estimate the freshness of a message. The limitation of the proposed solution is that it assumes that network nodes' integrity is undamaged, i.e., a trusted node is not compromised (i.e., a node of trust behaves properly). Hence, the objective is to ensure that only control traffic from trusted nodes is considered and that the integrity of this control traffic is maintained. [PERSON] et al. proposed in [24] a MANETs Intrusion Detection System (IDS). In order to detect misbehaving nodes, the proposed method initially validates the communication path and subsequently detects and isolates the misbehaving nodes in the invalid paths. The proposed detection system is based on the collaboration of a group of nodes in order to make accurate decisions. The detected node is then added to a blacklist broadcast to all 1-Neighbors, and so on to all nodes in the network. Then all the neighboring nodes receive this list, and it makes another confirmation by sending a Path Validation Message (PVM) to the attacker to make sure that this node is in fact an attacker. The process begins with the periodic sending of PVM to the destination. The destination node must acknowledge the sender with a response PVM to confirm the validity of the path. When the PVM fails to reach the sender before sending the next PVM, the source node increases the number of unsuccessful PVMs. Unsuccessful PVMs indicate an issue in the path, prompting the source node to initiate the attacker's searching process. The process begins by generating an attacker finder message (AFM) for every node on the path to the destination. Each intermediate node that receives the AFM must do two things. First, it responds to the source node with a message containing information on the number of hops and the next node to the destination. Besides, it sends the AFM to its destination. The node waits for an acknowledgment from intermediate nodes for some time. The node waits for a certain duration to receive acknowledgments from intermediate nodes. The downside is that this algorithm works only if the malicious node drops all packets.