Yang, Li; Cao, Yu
College of Engineering and Computer Science
University of Tennessee at Chattanooga
Place of Publication
In this paper, we explore the problem of data acquisition using compressive sensing (CS) in wireless sensor networks. Unique properties of wireless sensor networks require we minimize communication cost for efficient power usage. At first, a compressive distributed sensing (CDS) algorithm is proposed but is then modified to decrease communication costs. The final algorithm presented is compressive distributed sensing with random walk CDS(RW); an algorithm that combines the data gathering and projection generation process of CDS.CDS(RW) uses rateless encoding, graph algorithms, and belief propagation decoding to improve upon the communication cost associated with CDS. In the end, we show that the communication cost of CDS(RW) versus existing CS algorithms is far superior, while still having satisfactory decoding accuracy.
M. S.; A thesis submitted to the faculty of the University of Tennessee at Chattanooga in partial fulfillment of the requirements of the degree of Master of Science.
Random walks (Mathematics); Wireless sensor networks
Applied Mathematics | Computer Engineering
vii, 34 leaves
Fletcher, Robert Brian, "Energy efficient compressed sensing in wireless sensor networks via random walk" (2011). Masters Theses and Doctoral Dissertations.