A Random Walk-Based Energy-Aware Compressive Data Collection for Wireless Sensor Networks

Algorithm 1

Iteratively solve for transition probabilities.

1 Input the graph , the weight matrix , the starting probabilities of nodes and the randomness of random walks .

2. Compute layers , the successors set and the predecessors set for every node .

3. Output an estimator of .

4. Initialize the step index and such that.

where is the -th entry of

5. whiledo

6. Compute .

7. Compute for any .

8. Compute based on equation (25) in a layer-by-layer manner.

9. Compute for any .

10. Compute for any .

11. Compute based on equation (27) for any .

12. Update based on equation (24) for any .

13. Update the step index .

14. end while