On Efficient Deployment of Wireless Sensors for Coverage and Connectivity in Constrained 3D Space

. 2017 Oct 10;17(10):2304. doi: 10.3390/s17102304

Algorithm 3 Approximation Algorithm for STP-MSPCL
Input: L,

L_{0}

r_{c}

Output: A set C of Steiner points,

C \subseteq L - L_{0}

1:
for all $l_{i}, l_{j} \in L$ , $i \neq j$ do
2:
if distance( $l_{i}, l_{j}$ ) $\leq r_{c}$ then
3:
if $l_{i} \in L_{0}$ and $l_{j} \in L_{0}$ then
4:
$w_{(l_{i}, l_{j})} = 0;$
5:
else
6:
$w_{(l_{i}, l_{j})} = 1;$
7:
for all $l_{i}, l_{j} \in L_{0}$ , $i \neq j$ do
8:
Compute the shortest path P between $l_{i}$ and $l_{j}$ ;
9:
$w_{(l_{i}, l_{j})} = l e n g t h (P)$ ;
10:
Compute a minimum spanning tree $M S T (L_{0})$ on $L_{0}$ ;
11:
Let C be the set of locations $l \in L - L_{0}$ on the shortest path between any two locations in $M S T (L_{0})$ ;
12:
return $C .$