LESS: Link Estimation with Sparse Sampling in Intertidal WSNs

. 2018 Mar 1;18(3):747. doi: 10.3390/s18030747

Algorithm 2 The

K

-Spatial sampling (K-S) Algorithm.

Input: Number of nodes

| N |

N_{1}

N_{2}

, new sampling rate

s_{1}, s_{2}

Output: The decision set D for the N nodes in time T
1: for

i \in N

and

t \in T

do
2: if

i \in N_{1}

then
3:

D (i, t) = R a n d () < s_{1}

// the dense-deployed case.
4: else if

i \in N_{2}

then
5:

D (i, t) = R a n d () < s_{2}

// the sparse-deployed case.
6: end if
7: end for
8: return D