Efficient Deployment of Key Nodes for Optimal Coverage of Industrial Mobile Wireless Networks

. 2018 Feb 10;18(2):545. doi: 10.3390/s18020545

Algorithm 2: The minimum inter-cluster interference strategy based on improved virtual force and motion.
	Input: $A P = {a p_{1}, a p_{2}, \dots, a p_{z}}$ and N^AP, $A P_{P_{o s i t i o n_o l d}} = {a p_{P o s i t o n_o l d}^{1}, a p_{P o s i t o n_o l d}^{2}, \dots}$ , F_TH Output: AP_{Positon_new}
1	Initialization: Max_interation; C; $a p_{P o s i t o n_o l d}$
2	While (h < Max_interation)
3	if $\| {\vec{F}}^{h} \| \geq \| {\vec{F}}^{h - 1} \|$
4	for j = 1; j ≤ \|AP\|; j++ do
5	Calculate the virtual force $\vec{F_{j}}$ of ap_j according to Equations (15)–(18);
6	if $\vec{F_{j}}$ > 0
7	Calculate the maximum move distance d_p according to Equation (20);
8	if d_p > d_{move_step} // Ensure that the cluster head covers its target points
9	d_in ← d_{move_step}
10	else
11	d_in ← d_p
12	end if
13	Update the new position of $a p_{P o s i t o n_o l d}$ according to Equation (22)
14	if ap_{position_new} ∈ A // Evaluate whether the new position is in A
15	ap_{position_new} ← ch_{position_new}
16	else
17	ap_{position_old} ← the corresponding boundary value of A
18	end if
19	Move the cluster head to the new position
20	ap_{position_new} ← ch_{position_new}
21	end if
22	Compute the total virtual force of the entire network $\vec{F}$
23	end for
24	end if
25	end while
26	Return AP_{Position_new} // Return the new position of the cluster heads