Liu, Yuzhen; Liang, Weifa
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]
Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.