Skip to main content
. 2018 Mar 1;18(3):747. doi: 10.3390/s18030747
Algorithm 3 The K-Temporal sampling (K-T) Algorithm.
Input: System running period |T|, T1, T2, new sampling rate s3,s4
Output: The decision set D for the N nodes in time T
 1: for iN and tT do
 2:  if tT1 then
 3:   D(i,t)=Rand()<s3 // the stationary phase.
 4:  else if tT2 then
 5:   D(i,t)=Rand()<s4 // the dynamic case.
 6:  end if
 7: end for
 8: return D