An Approach for Maximum Lifetime Data Gathering with Aggregation Issue in Wireless Sensor Networks
Saving energy and prolonging network lifetime are key issues of wireless sensor networks. In this paper we consider the problem of Maximum Lifetime data gathering in wireless sensor networks. This is a NP-hard problem and the size of the solution, which consists of a collection of aggregation trees together with the number of rounds each such tree should be used, is desired 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- aggregation trees and achieves lifetime, which depends on the network topology and initial energy available at the sensors. We obtain an approximate optimal integral solution by simply optimal continuous solution. The simulation experiment is shown that the RSM algorithm for computing maximum lifetime is more effective.
WSNs lifetime rsm algorithms linear programming
KONG Ruirui
College of information Science and Technology Qingdao University of Science and Technology Qingdao 266061, P.R China
国际会议
太原
英文
577-581
2010-10-22（万方平台首次上网日期，不代表论文的发表时间）