Description

It is important to extend the network lifetime in order to achieve the better transmission in wireless sensor network. However, when one sensor dies, the rest of the network can still work, as long as useful data generated by other sensors can reach the sink. In earlier days, centralized algorithm that solves a series of linear programming problems with high-order complexities. A fully distributed progressive algorithm which iteratively produces a series of lifetime vectors, each better than the previous one. Simulation result demonstrate that the algorithm is able to converge rapidly towards the maximum lifetime vector with low overhead. To solve this problem, Proposed coordinated node selection method considering the spatial correlation of sensing nodes to dynamically select the best set of nodes for tracking missions. For Each cluster, select one adaptive aggregation node for data collection to reduce the redundant data transmission and balance the energy cost.