中文摘要：

提出了一种应用于无线传感器网络数据聚合的有效划分算法算法选取网络中一组无环连通点集抽象为广义数据汇聚点集．当传感器节点进行数据汇报时，信源节点依按需路由策略将数据传送到广义数据汇聚点集中数据在广义数据汇聚点集内经过在网计算，依表驱动路由快速转发至sink．理论计算确定最优广义数据汇聚点集选取方式，提出分布式“贪婪远跳”算法构建广义数据汇聚点集．仿真论证该优化选择保证网络内任意节点两跳可达广义数据汇聚点集的概率为97％，分析数据传输性能证明了该算法的有效性．

英文摘要：

A wireless sensor network segmentation algorithm for data gather is proposed. The algorithm uses a group of connective nodes without loop as a generalized data gather vertex set. The source transmits data to the generalized data gather vertex set with demand routing. In the set, data are aggregated and transmitted to sink with table driven routing. This paper proposes an optimal method to select the generalized data gather vertex setand a distributed ＂greedy long-distance＂ algorithm to build the generalized data gather vertex set. The simulation proves the optimal method can make the probability of each sensor node reaching the generalized data gather vertex set in two jumps achieve 97%. The analysis of data transmission shows the segmentation algorithm is feasible.