## 2 Literature Review
### Effectual Routing Strategies  
A novel approach grounded in fuzzy logic is posited to enhance routing efficiency within VANETs [29]. This study endeavours to augment the AODV protocol by infusing fuzzy logic rules. The construction of a routing table underpins the proposed technique, and these fuzzy rules determine the route selection with the lowest hop count. A threshold value is introduced to govern the propagation of routing packets within the vehicular network. Each node's choice of an appropriate neighbor for packet transmission is influenced by specific parameters such as velocity, direction, and distance. The threshold value's calibration is contingent upon the network's density. When a source node dispatches a route request to neighboring nodes, each recipient node scrutinizes the request packet, calculating the link expiration metric and the link reliability model. These calculations, constituting inputs to the fuzzy system, are based on parameters like velocity, direction, and distance. At the receiving end, notably the destination node, fuzzy inputs are harnessed to compute the fuzzy cost for each prospective route, culminating in selecting the route boasting the highest cost function. Various routing protocols are at the forefront of efficient packet delivery. Within the proposed approach [30], routing decisions are executed at intersections with the assistance of roadside units. The process commences with the transmission of a beacon message by the RSU, aimed at discovering and sustaining a link between itself and neighboring nodes, facilitated by a link discovery beacon. After link establishment, real-time information about lane availability, the direction of the next-hop intersection, and traffic flow is harnessed to ascertain a triangular fuzzy number. Per our proposed method, packets with the highest fuzzy score are dispatched to the intersection. Utilizing a greedy forwarding approach augments the link lifetime or strength between two intersections, a parameter contingent upon temporal and nodal velocity considerations. This optimization contributes to a reduction in end-to-end delay, packet routing delay, and hop count. In our proposed approach [4], a secure routing algorithm is devised to detect and thwart black hole attacks. The AODV routing method is employed with tailored modifications for detecting malicious nodes and facilitating efficient packet delivery. Cryptographic encryption and decryption techniques serve to verify the identities of both the source and destination nodes. Within our proposed approach, the source node conducts an initial assessment of the status of neighbouring nodes before generating an encrypted packet. Subsequently, the encrypted packet is transmitted to these neighboring nodes, and their presence is ascertained within the loop. The requisite secret key is transmitted to the identified neighbor node. Following the scrutiny of packet request and response data, the packet is relayed to its ultimate destination; the secure routing protocol known as TAD-HOC routing protocol was introduced in [31]. AODV is coupled with group authentication keys to ensure secure packet delivery with minimal delays. Our methodology hinges on the sequential reception of TROPHY messages by authenticated nodes. Four key entities play integral roles in creating a secure environment: onboard units, RSUs, key distribution centers (KDC), and human operators. The KDC generates periodic keys, subsequently disseminated to nodes for authentication. If a node is not actively participating in the routing process, KDC and RSUs swiftly initiate refreshing and updating the routing paradigm by expunging superfluous or malicious nodes and disseminating information regarding the identified malicious nodes to all other network nodes. In the event of a node's abrupt disconnection from the network, KDC initiates data recovery procedures and essential refreshment processes. It facilitates the retrieval of data about all inactive nodes, ultimately leading to their permanent removal from the routing process. Ref.