Skip navigation
Skip navigation

Approximate Querying in Wireless Sensor Networks

Liu, Yuzhen; Liang, Weifa

Description

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]

CollectionsANU Research Publications
Date published: 2008
Type: Conference paper
URI: http://hdl.handle.net/1885/49897
Source: Proceedings of the 2008 3rd International Conference on Pervasive Computing and Applications (ICPCA 2008)
DOI: 10.1109/ICPCA.2008.4783563

Download

File Description SizeFormat Image
01_Liu_Approximate_Querying_in_2008.pdf83.13 kBAdobe PDF    Request a copy
02_Liu_Approximate_Querying_in_2008.pdf114.92 kBAdobe PDF    Request a copy
03_Liu_Approximate_Querying_in_2008.pdf1.91 MBAdobe PDF    Request a copy


Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.

Updated:  20 July 2017/ Responsible Officer:  University Librarian/ Page Contact:  Library Systems & Web Coordinator