Algorithm 1: Coverage verification algorithm based on the sensing area of sensor node

Input: Sensor nodes group: $s=\left\{s_1,s_2,\dots s_n\right\}$

Sensing direction and sensing radius of sensor node: $\overrightarrow{D},R$

The length and width of target area: $m_1,m_2$

Output: The coverage situations of grid points in target area

1: Calculate the coordinates of four peak points $x_{sl},x_{sh},y_{sl},y_{sh}$

2: for $i=1$ $to$ n do

3:        for $x=x_{sl}$ $to$ $x_{sh}$ do

4:               for $y=y_{sl}$ $to$ $y_{sh}$ do

5:                     if $P\left(x,y\right)$ can be covered by $S\left(x_s,y_s\right)$ then

6:                          $C\left[x\right]\left[y\right]=1$;%Justify whether $P\left(x,y\right)$ is covered.

7:                     end if

8:                     if $P\left(x,y\right)$ can be covered by at least two sensor nodes. then

9:                          $R\left[x\right]\left[y\right]=1$;%Justify whether $P\left(x,y\right)$ is covered by at least two sensor nodes.

10:                   end if

11:              end for

12:       end for

13: end for