Algorithm 3$C{V}_2(n,r_2,s)$ for the $(r_2,s)$-coverage and interference requirement on the ${[0,1]}^2$ when $r_2=\frac{1+ϵ}{2\lfloor \sqrt{n}\rfloor }$ and $s=\frac{1-\delta }{\lfloor \sqrt{n}\rfloor }$ provided that $ϵ>0$ and $1>\delta >0$ are fixed and independent of $n$

Require: The initial locations of n mobile sensors with the identical square sensing radius $r_2=\frac{1+ϵ}{2\lfloor \sqrt{n}\rfloor }$, placed uniformly and independently at random on the unit square ${[0,1]}^2.$ Ensure: The final positions of the sensors satisfying the $(r_2,s)$-coverage and interference requirement on the square ${[0,1]}^2.$ Initialization:    Choose ${\lfloor \sqrt{n}\rfloor }^2$ sensors at random; Sort the initial locations of sensors according to the second coordinate; let the sorted locations be $S_1=(x_1,y_1),$ $S_2=(x_2,y_2),\dots$ $S_n=(x_n,y_n),$$y_1\le y_2\le \cdots \le y_n;$ 1: for $j=1$ to $\lfloor \sqrt{n}\rfloor$ do 2:   for $i=1$ to $\lfloor \sqrt{n}\rfloor$ do 3:     move sensor $S_{(j-1)\lfloor \sqrt{n}\rfloor +i}$ to position      $\left(x_{(j-1)\lfloor \sqrt{n}\rfloor +i},\frac{j}{\lfloor \sqrt{n}\rfloor }-\frac{1}{2\lfloor \sqrt{n}\rfloor }\right)$ 4:   end for 5: end for 6:for$j=1$to$\lfloor \sqrt{n}\rfloor$ do 7: apply Algorithm $C{V}_1(n,r_1,s)$ for $n:=\lfloor \sqrt{n}\rfloor ,$$s:=\frac{1-\delta }{\lfloor \sqrt{n}\rfloor },$$r_1:=\frac{1+ϵ}{2\lfloor \sqrt{n}\rfloor }$ and sensors $S_{(j-1)\lfloor \sqrt{n}\rfloor +1},S_{(j-1)\lfloor \sqrt{n}\rfloor +2},\cdots S_{(j-1)\lfloor \sqrt{n}\rfloor +\lfloor \sqrt{n}\rfloor };$ 8: end for