Table - PMC

Skip to main content

View full-text article in PMC

. 2020 Apr 29;20(9):2513. doi: 10.3390/s20092513

Algorithm 3 findSensorClusters.

Input:

{\vec{F}}_{k}^{s}, {\vec{c}}_{k}^{s}, λ^{s}, (Δ_{1}^{h}, Δ_{2}^{h}, \dots Δ_{\hat{h}}^{h}), (Δ_{1}^{s}, Δ_{2}^{s}, \dots Δ_{n}^{s})

Output: ${\vec{c}}_{k}^{s}, {\hat{\vec{c}}}_{k}^{s}$

1:
$c l u s t e r I D = m a x ({\vec{c}}_{k}^{s}) + 1$
2:
${\hat{o}}_{c l u s t e r I D}^{s} = c l u s t e r I D$
3:
for $i \leftarrow 1$ to n do
4:
$u p d a t e C l u s t e r = f a l s e$
5:
if $o_{i}^{s} = 0$ then
6:
for $j \leftarrow 1$ to n do
7:
for $a \leftarrow 1$ to $\hat{h}$ do
8:
compute $Y^{s} (i, j)$ as in Equation (9)
9:
if $(1 - Y^{s} (i, j) < 0.5 \land o_{j}^{s} = 0)$ then
10:
$o_{j}^{s} = c l u s t e r I D$ //assign i and j to the same cluster
11:
$u p d a t e C l u s t e r = t r u e$
12:
end if
13:
end for
14:
end for
15:
if $(u p d a t e C l u s t e r)$ then
16:
$c l u s t e r I D = c l u s t e r I D + 1$
17:
${\hat{o}}_{c l u s t e r I D}^{s} = c l u s t e r I D$
18:
end if
19:
end if
20:
end for