Ad Hoc Communication Topology Construction for Delay-Sensitive Internet of Vehicle Applications

Algorithm 1

Geographic clustering algorithm (GCA) for the k-LTTC problem.

Input: A set of vehicle , time constant k
Output: Cluster set
(1)	= min{};
(2)	;
(3)	GList = {δ(i, j), δ(k, l),.…};
(4)	for i = 1 to GList length do
(5)	δ(i, j) = getElement(GList);
(6)	ifthen
(7)	GList = GList − {δ(i, j)}
(8)	end if
(9)	end for
(10)	ECList = make the beginning Clusters by disconnected edge;
(11)	for i = 1 to ECList length do
(12)	Ci = getClusterElement(ECList);
(13)	TECS = TotalSize
(14)	if TECS ≤ β then
(15)
(16)	else
(17)	make sub-Clusters dividing by ECS β;
(18)	GCA(, k);
(19)	end if
(20)	end for
(21)	Return cluster set