Abstract
Wireless sensor networks have often been used to monitor and report the locations of moving objects. Since sensors can also be used for storage, a wireless sensor network can be considered a distributed database, enabling us to update and query the location information of in-network moving objects. Many researchers have studied the problem of how to construct message-pruning trees that can update a database and query objects for the minimum cost (the Minimum Cost Message-Pruning Tree problem). The trees are constructed in such a way that the cost of updating the database and querying objects is kept as minimum as possible. In this thesis, instead of constructing a new message-pruning tree, we will add shortcuts to an existing tree, thus introducing a new data aggregation model. Simulation results show that the proposed method significantly reduces the cost of updating the database and querying objects.