Load-Balanced Trees for Data Collection in Wireless Sensor Networks

摘要

In static wireless sensor networks, it is an important research issue to achieve effectively periodic data collection and prolong the network lifetime. In this paper, a distributed k-load-balanced tree scheme is proposed to prolong the network lifetime for periodic data collection. A k-load-balanced tree is a tree that the difference of the number of children of each two non-leaf nodes in a network is less than k. Each node chooses the node with the least current number of children and number of neighbor as parent for avoiding that the difference of the number of children of each two non-leaf nodes in a network is more than k. The simulation results show that our scheme can prolong the network lifetime and the network delay time is close to the result of centralized method.