Abstract

Jerry Zhao, R. Govindan, D. Estrin, Computing Aggregates for Monitoring Wireless Sensor Networks, In Proceedings of the International Workshop on Sensor Net Protocols and Applications, April 2003. [PDF] [Abstract] {Best Paper Award}

Wireless sensor networks involve very large numbers of small, low-power, wireless devices. Given their unattended nature, and their potential applications in harsh environments, we need a monitoring infrastructure that indicates system failures and resource depletion. In this paper, we briefly describe an architecture for sensor network monitoring, then focus on one aspect of this architecture: continuously computing aggregates (sum, average, count) of network properties (loss rates, energy-levels etc., packet counts). Our contributions are two-fold. First, we propose a novel tree construction algorithm that enables energy-efficient computation of some classes of aggregates. Second, we show through actual implementation and experiments that wireless communication artifacts in even relatively benign environments can significantly impact the computation of these aggregate properties. In some cases, without careful attention to detail, the relative error in the computed aggregates can be as much as 50%. However, by carefully discarding lossy and asymmetric links, we can improve accuracy by an order of magnitude.

@inproceedings{Zhao03,
	author = {Jerry Zhao and R. Govindan and D. Estrin},
	title = {{Computing Aggregates for Monitoring Wireless Sensor Networks}},
	booktitle = "Proceedings of the International Workshop on Sensor Net Protocols and Applications",
	year = "2003",
	month = "April",
	address = "Anchorage, AK",
}