RVMF: RELIABLE ROUTING METHOD FOR VEHICULAR AD HOC NETWORKS USING MOTH-FLAME AND FIREFLY OPTIMIZATION ALGORITHMS

Abstract

With the advancement of wireless communication technology, the intelligent transportation system (ITS) has attracted the attention of vehicle companies and academic researchers. Recently, vehicular ad hoc networks (VANETs) as a leading genuine technology have received serious attention as a kind of mobile ad hoc network (MANET) to ensure the safety of vehicles, drivers, and passengers. However, these networks face many challenges due to the mobility of vehicle nodes, wireless communication, and frequent topology changes. One of the crucial issues of these networks is a cluster-based routing scheme with the ability to provide quality of service (QoS) parameters. A clustering scheme is an appropriate method for increasing the scalability of VANETs. In a cluster-based routing scheme, the cluster head (CH) is responsible for receiving data from its member nodes, and aggregating and transferring data to the next CH node. On the other hand, providing a suitable clustering method is NP-hard problems and meta-heuristic algorithms are suitable for solving these problems. A scalable and reliable routing scheme is necessary and essential in VANETs. In this paper, a routing method based on the clustering technique is presented considering the moth-flame optimization (MFO) algorithm for clustering and the Firefly optimization algorithm (FoA) with a suitable fitness function for routing between CHs. The simulation of the proposed method with MATLAB software shows that the proposed RVMF method improves the parameters of packet delivery rate (PDR), latency, and throughput.

Keywords

• VANETs
• Routing
• Clustering
• Moth-flame optimization algorithm
• VANETs, Routing, Clustering, Moth-flame optimization algorithm, Firefly optimization algorithm.