## 3 Intelligent Cluster-Based Routing Approach
### Cluster Formation
Upon reaching the destination node, the system generates a reverse communication path (RBP), and the FCP is subsequently dismantled. Following the deactivation of the FCP, the destination node crafts a bidirectional communication path (BCP) and dispatches it back to the source node using the same route. During this process, the system computes the distance between the source and destination nodes and the number of intermediary nodes along this route. The source node receives the RBP from multiple neighboring nodes, while the BCP offers multiple routes to the source node for transmitting packets. The modification in the creation and management of the FCP involves the transmission of a forward communication path (FCP) from the source node to the destination node. This path accumulates and stores data regarding visited nodes, arrival times, distances from the source, and node capacity. The FCP is deactivated upon reaching the destination, generating a bidirectional communication path (BCP), which is sent back to the source using the same route. The BCP provides multiple routes for transmitting packets, and Equation (1) is employed to calculate distances along these routes. The introduced parameters include node identification, arrival times, distances, and node capacity, contributing to a more comprehensive and detailed path establishment than the standard AODV. However, it introduces a forward communication path (FCP) and reverse communication path (RBP) in the initial phase, along with a bidirectional communication path (BCP) during the route reply process. The details suggest an enhanced mechanism for path establishment and data accumulation compared to the traditional AODV. Equation (1) is employed to calculate the distances along these routes. \[\text{Dis}_{\text{N}}=\frac{\text{Dis}^{2}(\text{S},\text{D})+\text{Dis}^{2}( \text{S},\text{n})-\text{Dis}^{2}(\text{n},\text{D})}{2\times\text{Dis}^{2}( \text{S},\text{D})}. \tag{1}\]

The introduced forwarding candidate path (FCP), repairing backup path (RBP), and backup candidate path (BCP) in the modified AODV protocol significantly contribute to improved efficiency, reduced latency, and enhanced reliability. FCP strategically identifies and utilizes optimal paths for data forwarding, minimizing congestion and enhancing overall network efficiency. RBP acts as a proactive measure, swiftly repairing broken links to maintain seamless communication, thereby reducing latency. BCP adds a layer of reliability by establishing alternative paths in advance, mitigating the impact of link failures and ensuring robust connectivity. Collectively, these enhancements result in a protocol that not only optimizes resource utilization but also minimizes data transfer delays and fortifies the network against potential disruptions, thereby elevating the overall performance and dependability of the AODV protocol. #### 3.5.2 Route Maintenance

Upon route establishment, the system selects the optimal pathway from the routing table, aiming for the one that offers the shortest distance and the least number of hops. The path selection criteria with minimal transmission delay may shift depending on the scenario. An objective function is introduced, driven by decision variables, to facilitate the achievement of this objective. These decision variables encompass hop counts, distance, and node capacity, aiming to optimize packet transmission delay. The delay experienced in transmitting packets is contingent upon these decision variables. Following a comprehensive, objective function evaluation, the source node dispatches the packet to the destination. If path errors are detected, the roadside unit (RSU) broadcasts a route error message back to the source. Subsequently, the source node redirects the packet through an alternative path that is the next most suitable. It is important to note that this communication method applies exclusively when the destination is located within the cluster.