A new algorithm of clustering AODV based on edge computing strategy in IOV

In the vehicular ad hoc network (VANET), due to the particularity of high-speed movement of vehicle nodes, there are higher challenges in link stability and network topology control overhead. In this paper, a new algorithm of clustering AODV based on edge computing strategy is proposed. Considering the vehicle node energy and speed, the AODV routing protocol based on the minimum hop number is optimized, which divided the communication mode into vehicle to vehicle (V2V) and vehicle to road (V2R) mode. Adding edge server in the road side unit (RSU) and using the idea of clustering, that is, the nodes in the cluster use V2V communication mode, and the nodes between clusters use V2V and V2R combined communication mode to select routes. The algorithm improves the routing efficiency in the high-speed mobile. Experiments show that the algorithm is feasible, reducing the network topology control overhead, lowering the end-to-end delay and improving the packet delivery rate comparing with others in different environment.

Automated summary

This paper introduces a new clustering AODV algorithm based on edge computing strategy, which improves routing efficiency in high-speed mobile environments by optimizing the AODV routing protocol. Experimental results demonstrate that the algorithm reduces network topology control overhead, decreases end-to-end delay, and enhances packet delivery rate in various environments.