Clustering‐based routing protocol using gray wolf optimization and technique for order of preference by similarity to ideal solution algorithms in the vehicular ad hoc networks

Abstract

Summary In a vehicular ad‐hoc network (VANET), each vehicle is equipped with an on‐board unit to communicate vehicle to vehicle or vehicle to fixed infrastructure. VANET technology is offered to provide many facilities to passengers and drivers, including safety, entertainment, mobile commerce, driver assistance, and emergency alarms. VANET has unique features such as high‐speed node mobility and network topology dynamics. These special features cause many problems such as increased transmission delays and packet loss. On the other hand, providing a good routing plan for VANET is a critical issue. Therefore, this article proposes a cluster‐based routing using in‐vehicle meta‐heuristic algorithms (CRMHA‐VANET) which has two phases. In the first stage, the vehicles are clustered and the most suitable cluster head (CH) is selected using the gray wolf optimization algorithm (GWO). In the next step, the next suitable CH is selected for data transmission in direct paths using the technique for order of preference by similarity to ideal solution (TOPSIS). The performance of the proposed method is analyzed through several criteria such as package delivery rate, end‐to‐end delay and throughput. CRMHA‐VANET results in a 10% to 25% improvement over all performance metrics, that is, packet delivery rate, latency, and throughput, over CRBP (clustering routing based on PSO [particle swarm optimization]), WCV (weight based clustering for VANET), and AODV‐CD methods.

Beetle colony optimization algorithm‐based node clustering scheme for efficient data dissemination in vehicular ad hoc networks

“…where X i,j t and e i,j t represents "j th " dimensional co-ordinate of "i th " beetle (SAs) and the "j th " dimension of "i th " optimal value presently determined at time "t." Moreover, 'dis i,j t ' indicates the distance of "i th " beetle and elite individual in "j th " dimension. Moreover, the value of "dis i,j t " is multiplied with a random scaling factor as specified in Equation (23).…”

“…This is dynamic as "dis i,j t " is inevitably computed and attuned based on the distance amid beetle and elite individuals. While searching, to permit beetles to stabilize local exploitation as well as global exploration, the LF method is appended to Equation (23). A constant of 0.1 is multiplied.…”

“…Kheradmand et al 23 proposed cluster‐based routing using in‐vehicle meta‐heuristic algorithms (CRMHA‐VANET) that involve two stages. Initially, it clustered vehicles and chose appropriate CH using GWOA.…”