A Center-Based Secure and Stable Clustering Algorithm for VANETs on Highways

Algorithm 3

Cluster maintenance algorithm.

 Input: Initial clusters and vehicle set V

 Output: New clusters

1 if the eNodeB can not reach a CH  then

2  Call Cluster Head Selection Algorithm;

3 end

4 if the CH can not reach a CM  then

5  Reomve the CM;

6  Notice eNodeB;

7 end

8 if the distance between two CHs ≤ for a period then

9    Merge the two clusters into one cluster;

10  Call the Cluster Head Selected Algorithm;

11  Check values of new CHs;

12  New CHs check values of their CMs;

13 end

14 if  a CM can not reach the CH  then

15  if  it can receive a signal from CHs then

16   Join the cluster whose signal of CH is strongest;

17   CH check its value;

18  end

19  else

20   Notice eNodeB;

21   The node performs as a CH;

22  end

23 end