All-Domain Fusion-Based Time Synchronization Protocol in SD-ATSN

Algorithm 1

Rough election of virtual centroid of K-means++.

	Step 1: rasterize the global combat network and randomly select a location coordinate as the initial clustering centroid
	Step 2: calculate the shortest distance between each node and the existing cluster centroid
	Step 3: calculate the probability that each node is selected as the next cluster centroid
	Step 4: using the roulette method to select the next cluster centroid
	Step 5: repeat step 2 until a total centroid is selected
	Step 6: determine the initial centroid
	Step 7: calculate the distance from each node to a centroid and divide it into the subdomain corresponding to the minimum centroid
	Step 8: recalculate the centroid of clustering
	Step 9: repeat steps 5 and 6 until the position of the center of mass no longer changes