Aggregation-aware routing on wireless sensor networks

Abstract

In wireless sensor networks, data aggregation is critical to network lifetime. It implies that data will be processed in an efficient flow from multiple sources to a specific node named sink. However, there are trade-offs for fusing multisensor data and creating a path between source and sink that increase the likelihood of aggregation. In this work, we propose a decentralized mechanism using parametric-based techniques, such as Bayesian Inference and Dempster-Shafer Method, for data aggregation in wireless sensor networks. Moreover, we propose an extension to an existing data-centric routing protocol in order to favor aggregation. Our approach is evaluated by means of simulation. © IFIP International Federation for Information Processing 2004.