中文摘要：

针对现有的求和算法基本上都是对副本敏感的算法，提出一种对副本不敏感的求和近似算法FM-S。网络中各节点由FM—S和服从二项分布的随机数样本对节点记录进行哈希转换以填充一个长度为三的二进制求和序列，并且每个节点会把生成的序列转发给路由树中的父亲节点，根节点将接收到全网的求和序列，最终根据此序列可计算出网络中不重复记录求和的近似值。实验结果显示该算法是一种分布式、低功耗、容错性高、扩展性和健壮性强的聚集查询算法。

英文摘要：

Since the existing summation aggregation algorithms are almost duplicate-sensitive, an approximate algorithm Flajolet-Martin SUM （FM-S） of distinct summation query for Wireless Sensor Network （WSN） was proposed. In FM-S, each node in WSN combined the FM-S algorithm and the random number sample of binomial distribution to do hash conversion so as to fill a summation sequence of length L, and each node forwarded the generated sequence to the father node in routing tree. Then the root node received the summation sequence of whole network. Finally, according to the sequence of root node, the approximation summation value of distinct records in sensor networks could be obtained. The experimental results show that the distributed algorithm is of low power consumption, high fault tolerance, robustness and scalability.