TY - GEN

T1 - Achievable distortion/rate tradeoff in a decentralized Gaussian parameter estimation problem

AU - Scaglione, Anna

AU - Yildiz, Mehmet E.

AU - Aysal, Tuncer C.

PY - 2008/9/15

Y1 - 2008/9/15

N2 - In this paper, we study the decentralized version of the classical rate constrained Gaussian parameter estimation problem referred to as the Central Estimation Officer (CEO) problem which we refer to as the Decentralized Estimation Officers (DEO) problem. Like in the CEO case, we consider a group of N sensors observing an independently corrupted version of an infinite i.i.d. sequence of samples from a Gaussian source, in additive Gaussian noise. Unlike the CEO case, the sensors in our study are also the estimation officers. They are uniformly deployed in a circular pattern of radius r and communicate over RF links with limited energy. Their task is to reconstruct the quantity of interest (the samples of the source), without a central fusion node, better than what they are capable of with their local observations. We find achievable scaling laws by structuring our communication protocol as an instance of the so called average consensus algorithm, a gossiping protocol used for averaging original sensor measurements via near neighbors communications. We derive how the Mean Squared Error (MSE) of the sensors' estimation scales with the network size, per node power and ring radius r. Moreover, we compare our results with scaling laws previously derived for the centralized case, i.e, the CEO problem in a comparable scenario.

AB - In this paper, we study the decentralized version of the classical rate constrained Gaussian parameter estimation problem referred to as the Central Estimation Officer (CEO) problem which we refer to as the Decentralized Estimation Officers (DEO) problem. Like in the CEO case, we consider a group of N sensors observing an independently corrupted version of an infinite i.i.d. sequence of samples from a Gaussian source, in additive Gaussian noise. Unlike the CEO case, the sensors in our study are also the estimation officers. They are uniformly deployed in a circular pattern of radius r and communicate over RF links with limited energy. Their task is to reconstruct the quantity of interest (the samples of the source), without a central fusion node, better than what they are capable of with their local observations. We find achievable scaling laws by structuring our communication protocol as an instance of the so called average consensus algorithm, a gossiping protocol used for averaging original sensor measurements via near neighbors communications. We derive how the Mean Squared Error (MSE) of the sensors' estimation scales with the network size, per node power and ring radius r. Moreover, we compare our results with scaling laws previously derived for the centralized case, i.e, the CEO problem in a comparable scenario.

KW - Average consensus

KW - CEO problem

KW - Parameter estimation

KW - Sensor networks

UR - http://www.scopus.com/inward/record.url?scp=51349094385&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=51349094385&partnerID=8YFLogxK

U2 - 10.1109/IZS.2008.4497286

DO - 10.1109/IZS.2008.4497286

M3 - Conference contribution

AN - SCOPUS:51349094385

SN - 9781424416820

T3 - International Zurich Seminar on Digital Communications

SP - 102

EP - 105

BT - Proceedings - 2008 International Zurich Seminar on Communications, IZS

T2 - 2008 International Zurich Seminar on Communications, IZS

Y2 - 12 March 2008 through 14 March 2008

ER -