Committee Chair

Sartipi, Mina

Committee Member

Yang, Li; Cao, Yu

Department

Dept. of Computer Science and Engineering

College

College of Engineering and Computer Science

Publisher

University of Tennessee at Chattanooga

Place of Publication

Chattanooga (Tenn.)

Abstract

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.

Degree

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.

Date

5-2011

Subject

Random walks (Mathematics); Wireless sensor networks

Keyword

Belief propagation; Compressive sensing; Random walks; Wireless sensor networks

Discipline

Applied Mathematics | Computer Engineering

Document Type

Masters theses

DCMI Type

Text

Extent

vii, 34 leaves

Language

English

Rights

https://rightsstatements.org/page/InC/1.0/?language=en

License

http://creativecommons.org/licenses/by-nc-nd/3.0/

Download

Share

COinS