EtHgSC: Eigen Trick-Based Hypergraph Stable Clustering Algorithm in VANET

Algorithm 1

Cluster formation using Eigen-trick method.

	Input: maximum vehicles: , vehicle’s location:
(1)	Choose the time period during which there is the largest number of vehicles
(2)	A hypergraph formation
(3)	The similarity matrix is calculated based on the distance proximity between the vehicles , and also, an incidence matrix is generated, its size of
(4)	A diagonal matrix for vehicles , and for edges
(5)	Find the hyperedge Laplacian
(6)	The dominant eigenvector of is calculated
(7)	Computed the from the hyperedge eigenvectors
(8)	Normalize each row of
(9)	Run k-means on the rows of
(10)	is obtained through k-means partition
(11)	Compute the Calinski–Harabasz index for each cluster
(12)	is the optimal number of clusters
	Output: , partitioning vehicles in clusters