Energy-Efficient Multiple Routing Trees for Aggregate Query Evaluation in Sensor Networks
In this paper we consider the problem of finding multiple routing trees in sensor networks for the evaluation of a class of aggregate queries including AVG, MIN, MAX, and COUNT with an objective to maximizing the network lifetime. Due to the NP hardness of the problem, we instead devise a heuristic algorithm for it. Unlike the previous work that focused on finding a single routing tree for query evaluation, we introduce the concept of multiple routing trees, and use these trees to evaluate...[Show more]
|Collections||ANU Research Publications|
|Source:||Wired/Wireless Internet Communications: 6th International Conference, WWIC 2008 Proceedings|
|01_Liu_Energy-Efficient_Multiple_2008.pdf||3.58 MB||Adobe PDF||Request a copy|
|02_Liu_Energy-Efficient_Multiple_2008.pdf||442.13 kB||Adobe PDF||Request a copy|
Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.