We consider the problem of data estimation in a sensor wireless network where sensors transmit their observations according to decentralized and centralized transmission schedules. A data collector is interested in achieving a data estimation using several sensor observations such that the variance of the estimation is below a targeted threshold. We analyze the waiting time for a collector to receive sufficient sensor observations. We show that, for sufficiently large sensor sets, the decentralized schedule results in a waiting time that is a constant factor approximation of the waiting time under the optimal centralized scheme.
['Mihaela Mitici', 'Jasper Goseling', 'Maurits de Graaf', 'Richard J. Boucherie']
Decentralized vs. centralized scheduling in wireless sensor networks for data fusion