On the construction of a delay-constrained maximum lifetime tree in wireless sensor networks
Academic Article
Overview
Additional Document Info
View All
Overview
abstract
In some delay-sensitive and durative surveillance applications, a tree that can satisfy user's requirements of maximizing the network lifetime and constraining the data gathering delay needs to be constructed in wireless sensor networks. The problem of constructing the tree is NP-complete. A novel algorithm, named MILD, is proposed to solve this problem. MILD satisfies user's requirement for the delay by limiting the tree's height, and it extends the tree lifetime by decreasing the degree of bottleneck nodes to the minimum. Simulation results show that MILD can construct a tree that has longer lifetime than previous protocols under constrained delay.