Multiple Query Routing Trees in Sensor Networks
DocUID: 2005-005 Full Text:
PDF Author: Andreea Munteanu, Jonathan Beaver, Alexandros Labrinidis, Panos K. Chrysanthis
Abstract: Advances in sensor technology provide the opportunity for a wide range of applications not examined before. These advances come with the realization of many limitations, like energy constraints, communication limitations, or sensor node failures. To combat these limitations, several solutions have been proposed, most of which organize the sensor nodes into a tree-like configuration that enables in network aggregation. These solutions can lead to a heavy energy burden being put on nodes higher up in the tree, causing node failure and stranded nodes, unable to communicate their results. One solution to this problem is to use multiple query routing trees, which leads to a more balanced network with less burden on the nodes higher in the tree. In this paper, we present a system framework for using multiple query routing trees, along with an analytical examination which enables us to determine the appropriate number of trees to be used and the proper placement of those trees. We also provide an evaluation tool for different network configurations.
Published In: Proc. of the IASTED International Conference on Databases and Applications
Pages: pp. 145-150
Year Published: 2005
Project: TiNA Subject Area: Sensor Databases
Publication Type: Conference Paper
Sponsor: NSF ANI-0123705