从理论上分析了最大化网络生命周期的数据收集问题.主要做了以下4项工作:(1)分析了简化的静态路由模式,其中只有一棵路由树用于收集数据.(2)分析了真实的动态路由模式,其中有一系列的路由树用于收集数据.(3)提出了一种近似最优的最大化网络生命周期的数据收集和聚集算法MLDGA,MLDGA一方面试图最小化每轮数据收集中所消耗的总能量,另一方面试图最大化每轮数据收集中所使用的路由树的生命周期.(4)用Java语言实验模拟了MLDGA算法,并与现有的算法进行比较.实验结果表明,无论基站的位置还是传感器的初始能量发生变化,MLDGA都取得良好的性能,而现有的数据收集算法只适应于特定的变化. This paper analyzes the data collection problem of maximizing network life cycle theoretically, and mainly does the following four tasks: (1) Analyzed a simplified static routing model, in which only one routing tree is used to collect data. (2) Real dynamic routing model, in which a series of routing trees are used to collect data. (3) An approximate optimal MLDGA algorithm is proposed to maximize the network life-cycle data collection and aggregation. On the one hand, MLDGA tries to minimize the data of each round Collect the total energy consumed in the collection, and on the other hand try to maximize the life cycle of the routing tree used in each round of data collection. (4) MLDGA algorithm is simulated in Java language and compared with the existing algorithms. The results show that MLDGA achieves good performance regardless of the location of the base station or the initial energy of the sensor, whereas the existing data collection algorithms only adapt to specific changes.