Towards an Efficient Method for Large-Scale Wi-SUN-Enabled AMI Network Planning

. 2022 Nov 23;22(23):9105. doi: 10.3390/s22239105

Algorithm 1 Bottom–Up Approach (BU)

1:
Input: $V$ , $C$ , $L$ , $l_{m i n}$ , $n_{m a x}$
2:
Output: $V_{c o n}$
3:
$V_{c o n} \leftarrow {}$
4:
for all $v_{i} \in V$ do
5:
$K \leftarrow$ Select all $c_{j} \in {C$ | $(c_{j}^{n} < n_{m a x}) \land (d i s t (v_{i}, c_{j}) \leq c_{j}^{r})}$
6:
$l_{m a x} \leftarrow l_{m i n}$
7:
$c_{s} \leftarrow {}$
8:
for all $c_{k} \in K$ do
9:
$l_{c o n} \leftarrow {l_{v_{i}, c_{k}}$ | $(l_{v_{i}, c_{k}} \in L)}$
10:
if $l_{c o n} \geq l_{m a x}$ then
11:
$l_{m a x} \leftarrow l_{c o n}$
12:
$c_{s} \leftarrow c_{k}$
13:
end if
14:
end for
15:
if $c_{s} \neq {}$ then
16:
$V_{c o n} \leftarrow V_{c o n} \cup {< v_{i}, c_{s}, l_{m a x} >}$
17:
$c_{s}^{n} \leftarrow c_{s}^{n} + 1$
18:
end if
19:
end for