Compressed RSS Measurement for Communication and Sensing in the Internet of Things

Algorithm 2

Distributed CS-based solution.

Require: Number of Nodes, Synchronized global

Ensure: RSS matrix for each channel

(1) Use one node to choose a channel with less or constant noise.

(2) Utilize the pathloss model to compute an estimation of RSS matrix ;

(3) Get the sparsity of by omitting the singular value smaller than ;

(4) Each node generates the measurement matrix following the LDPC matrix with the predetermined time

slot under the random function with the same seed as the global time.

(5) Each node sends a test signal following the measurement plan.

(6) Each node generate their own representation basis using DCT.

(7) Each node solve

, ()

and get the RSS in node .

(8) Aggregate the from each node and get the final RSS matrix.