Algorithm 3 Equal Price-Basedd Search Method With Coordination SNs Monitor Patrolling Algorithm

1:Input: New ID set ${\mathcal{I}}_i\in \mathcal{Q}$, $(i=1$, 2, ⋯, $m)$ and sequence it in an increasing way. 2:Initialization, set the min ID ${\mathcal{I}}_i$ in the waiting expand node list ${\mathcal{D}}_k$, set the have expanded node list ${\mathcal{H}}_k=0$. 3:Take ${\mathcal{I}}_i$ from ${\mathcal{D}}_k$ and expand ${\mathcal{I}}_i$ to ${\mathcal{I}}_i{\mathcal{I}}_{i+1}$, ${\mathcal{I}}_i{\mathcal{I}}_{i+2}$, ⋯, ${\mathcal{I}}_i{\mathcal{I}}_m$, meanwhile record the corresponding distance $d_{i,i+1}$, $d_{i,i+2}$, ⋯, $d_{i,m}$. At last, put ${\mathcal{I}}_i{\mathcal{I}}_{i+1}\left(d_{i,i+1}\right)$, ${\mathcal{I}}_i{\mathcal{I}}_{i+2}\left(d_{i,i+2}\right)$, ⋯, ${\mathcal{I}}_i{\mathcal{I}}_m\left(d_{i,m}\right)$ into ${\mathcal{D}}_k$ and ${\mathcal{I}}_i$ into ${\mathcal{H}}_k$, respectively. 4:Take $min{\mathcal{D}}_k$ continue to expand, i.e., ${\mathcal{I}}_i{\mathcal{I}}_{i+2}\left(d_{i,i+2}\right)$ is the minimum node, expand it to ${\mathcal{I}}_i{\mathcal{I}}_{i+2}\left(d_{i,i+2}\right)$, $\left(j\sim i,j\sim i+2\right)$, then update ${\mathcal{D}}_k$ and ${\mathcal{H}}_k$. 5:Continue Step 4 until a new expanded lattice with all of the ID sequence ${\mathcal{I}}_i{\mathcal{I}}_{i+1}{\mathcal{I}}_{i+2}{\mathcal{I}}_m$ appeared. 6:Set $t=0$, ${\mathcal{I}}_i=0$. According to the new ID sequence, assign each ANs to monitor one lattice. 7:If there is no ANs monitoring at ID ${\mathcal{I}}_i$, Set ${\mathcal{I}}_i={\mathcal{I}}_i+1$; otherwise ${\mathcal{I}}_i=0$ 8:Call algorithm 2. 9:$t=t+1$, If an AN detects an intruder at time slot $t-1$, then it claims itself not busy. Count the total number of not busy ANs $\overline{n}$, if $\overline{n}>0$, continue. 10:The $\overline{n}$ ANs are newly selected to monitor lattices with ID ${\mathcal{I}}_i={\mathcal{I}}_i+1$. 11:Continue Step 6 until all ANs run out of energy.