An Effective Sensor Deployment Scheme that Ensures Multilevel Coverage of Wireless Sensor Networks with Uncertain Properties

. 2020 Mar 25;20(7):1831. doi: 10.3390/s20071831

Algorithm 2:

Input: The

r_{1}

derived by Algorithm 1, the length L of the ROI, and the height H of the ROI.
Output: The designated locations of nodes.

1:
$r_{2} \leftarrow \sqrt{3} r_{1}$ ; $ℓ \leftarrow ⌈\frac{2 H}{3 r_{1}}⌉ + 1$ ; $n_{1} \leftarrow ⌈\frac{L}{r_{2}}⌉ + 1$ ; $n_{2} \leftarrow ⌈\frac{2 L - r_{2}}{2 r_{2}}⌉ + 2$ ;
2:
for $i = 1$ to $ℓ - 1$ do //row 1, row 2, …, row $(ℓ - 1)$
3:
if (i is odd) then
4:
output the location ( $j \cdot r_{2}, \frac{3 (i - 1)}{2} r_{1})$ for each $j = 0$ to $n_{1} - 1$ ;
5:
else //i is even
6:
output the location ( $0, \frac{3 (i - 1)}{2} r_{1})$ ; //location of the first node in this row
7:
output the location ( $\frac{2 j + 1}{2} r_{2}, \frac{3 (i - 1)}{2} r_{1})$ for each $j = 0$ to $n_{2} - 2$ ;
8:
end if
9:
output the location ( $L, \frac{3 (i - 1)}{2} r_{1})$ ; //location of the last node in this row
10:
end for
11:
//row ℓ (i.e., the last row)
12:
if (ℓ is odd) then
13:
output the location ( $j \cdot r_{2}, H)$ for each $j = 0$ to $n_{1} - 1$ ;
14:
else //ℓ is even
15:
output the location ( $0, H)$ ; //location of the first node in row ℓ
16:
output the location ( $\frac{2 j + 1}{2} r_{2}, H)$ for each $j = 0$ to $n_{2} - 2$ ;
17:
end if
18:
output the location ( $L, H)$ ; //location of the last node in row ℓ