An Algorithm of Maximum Lifetime of Data Gathering Aggregation Issue Based on Linear Programming in WSNs

Saving energy and prolonging network lifetime are key problem of wireless sensor networks (WSNS). In this paper, Maximum Lifetime data gathering in WSNS is considered, in which the WSNS is consists of a collection of aggregation trees together with the number of rounds each such tree which is required to be small, given the limited computation and communication resources of sensor nodes. We describe a simple and efficient combinatorial iterative algorithm for finding an optimal continuous solution that has up to n-1 aggregation trees and achieves lifetime using linear programming, which depends on the network topology and initial energy available at the sensors. An approximate optimal integral solution is obtained. The simulation experiment is expressed that the algorithm for computing maximum lifetime is more effective.