Multiple Query Routing Trees in Sensor Networks.
Andreea Munteanu, Jonathan Beaver, Alexandros Labrinidis, Panos K. Chrysanthis · 2005
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 innetwork 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. KEY WORDS load balancing, in-network aggregation, reliability 1