Adaptive Distributed Algorithms for Power-Efficient Data Gathering in Sensor Networks

In this work, we consider the problem of designing adaptive distributed processing algorithms in large sensor networks that are efficient in terms of minimizing the total power spent for gathering the spatially correlated data from the sensor nodes to a sink node. We take into account both the power spent for purposes of communication as well as the power spent for local computation. Our distributed algorithms are also matched to the nature of the correlated field, namely, for piecewise smooth signals, we provide two distributed multiresolution wavelet-based algorithms, while for correlated Gaussian fields, we use distributed prediction based processing. In both cases, we provide distributed algorithms that perform network division into groups of different sizes. The distribution of the group sizes within the network is the result of an optimal trade-off between the local communication inside each group needed to perform decorrelation, the communication needed to bring the processed data (coefficients) to the sink and the local computation cost, which grows as the network becomes larger. Our experimental results show clearly that important gains in power consumption can be obtained with respect to the case of not performing any distributed decorrelating processing.

Published in:
International Conference on Wireless Networks, Communications and Mobile Computing 2005 , vol. 2, 946- 951
Presented at:
International Conference on Wireless Networks, Communications and Mobile Computing 2005, Maui, Hawaii, 13-16 June 2005

 Record created 2007-10-08, last modified 2018-03-17

Download fulltext

Rate this document:

Rate this document:
(Not yet reviewed)