At the beginning of the algorithm, as shown in Procedure 2, the neighbor cluster head set of cluster head si is denoted by N si, which is obtained at cluster formation phase.
In practical scenarios, several UEs can appear near different cluster head of beacon cluster simultaneously.
Hence, the cluster head of the cluster with huge number of sensor nodes will suffer from heavy traffic load and result in significant energy consumption.
In consequence, the cluster head of the cluster does not have the basic standards to manage the VANET groups, so that it enables them to connect with the cellular network.
In clustering, the nodes are divided into some clusters and then some nodes, called cluster-heads, are selected to be the head of each cluster.
In the proposed algorithm, if a cluster head moves from the cluster, the immediate cluster head election is not required because backup node will act as new cluster head (in absence of cluster head) to make network more stable and later on, a backup node is created by the new cluster head, using LID algorithm.
Cluster head of a particular cluster can communicate with the cluster heads in the other clusters.
This node becomes cluster head in absence of cluster head for a cluster, and a new backup node is created later on.
The working principle of this algorithm is also inverted compared to others and uses unneeded cluster head elimination instead of cluster head election.
Network states' information is obtained from the Forward_Ant, and is only broadcast by the head of every cluster, thus decreasing the overhead required to transmit ant packets.
