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

Algorithm 2

A weight calculation for the k-LTTC problem.

Input: clustering set , time constant k
Output: List of edge weight W(i,j)
(1)	;
(2)	GList = Sort {δ(i,j), δ(k,l), …};
(3)	whileC do
(4)	if δ (i, j) ≥ CommunicationRange then
(5)	remove Edge;
(6)	end if
(7)	;
(8)	Calculate edge weights considering time slots k at each Cluster;
(9)	end while
(10)	Return List of edge weight W(i,j);