Tree based heuristic algorithms for maximizing network lifetime: A review

Maximizing the network lifetime in wireless sensor networks using minimum spanning tree proves to be efficient in case of mobile sink. Sensor nodes route their data to root nodes through intermediate nodes. In Power Efficient Data Gathering and Aggregation lifetime is improved by taking minimum weight edge from root to leaf nodes while Energy conserving routing tree algorithm maximizes the life span of network. Local optimization algorithm enhances the lifetime of the network. Various balanced trees are used to diversify load of routing to nodes. Although balanced tree implementation is difficult but lifetime of network increases considerably. The various tree formation techniques are compared based on complexity of tree formation and underlying main ideas. All algorithms work on approximations as complete implementation is NP-complete.