Performance Enhancement of Cluster-Based Ad Hoc On-Demand Distance Vector Routing in Vehicular Ad Hoc Networks

Algorithm 1

Centroid selection.

	Start
	Deploy nodes, initialize attributes
	Total CH (Jc) =
	First CH_P1 = n.get avg (x)
	First CH_P2 = n.get avg (y)
	First CH_P3 = n. get avg drop
	Calculate rest
	While
	Res CH_P1 = n.get avg (x)
	Res CH_P2 = n.get avg (y)
	Res CH_P3 = n. get avg drop
	=
	End
	Foreach
	Veh in vehlist
	Vp = [x, y, drop]
	Calculate Euclidean distance from the vehicle to the centroid
	For each I in vehicles
	Ed. Append (Ecl [, CH2])
	End
	Calculate min Ed⟶
	Append I to cluster
	For each member in the cluster
	Where t is the total no. of centroids in clusters
	Select min ()⟶ Assign as CH
	Stop