Approximate Querying in Wireless Sensor Networks
In this paper, we study the maximization problem of network lifetime for answering a sequence of aggregate queries based on snapshot data. We build a series of nearly optimal representative routing trees for query evaluation, where a representative routing tree is such a tree rooted at the base station that each node in it represents a set of non-tree nodes by holding their historical data (snapshot data). A representative routing tree is optimal if the minimum residual energy among its nodes...[Show more]
|Collections||ANU Research Publications|
|Source:||Proceedings of the 2008 3rd International Conference on Pervasive Computing and Applications (ICPCA 2008)|
|01_Liu_Approximate_Querying_in_2008.pdf||83.13 kB||Adobe PDF||Request a copy|
|02_Liu_Approximate_Querying_in_2008.pdf||114.92 kB||Adobe PDF||Request a copy|
|03_Liu_Approximate_Querying_in_2008.pdf||1.91 MB||Adobe PDF||Request a copy|
Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.