Determining an Efficient Family of Trees in Large Scale Wireless Sensor Networks

In our previous work, we have demonstrated that multiple trees, as well as split trees, can provide additional lifetime extensions when certain nodes are deployed in a wireless sensor network. The main motivation of this paper is to explore how the number of the family-set of trees influences the lifetime gain, and we work on the problem of constructing data aggregation trees that minimizes the total energy cost of data transmission under diverse set of scenarios and network query region. Through query region division, we have compared and analyzed an angular division routing algorithm and query region division routing with LEACH. Theoretical and experimental results show that the query region division algorithm based on LEACH have better performance in terms of energy cost.