Approximate summation algorithm of distinct records for wireless sensor network
LIU Caiping1,CAI Yuwu1,MAO Jianxu2,CAI Yuwen3
1. School of Information Science and Engineering, Hunan University，Changsha Hunan 410082，China； 2. College of Electrical and Information Engineering, Hunan University，Changsha Hunan 410082，China； 3. College of Biomedical Engineering，South-Central University for Nationalities，Wuhan Hubei 430000，China
Abstract：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.
刘彩苹 蔡玉武 毛建旭 蔡玉文. 无线传感器网络不重复记录求和近似算法[J]. 计算机应用, 2014, 34(2): 313-317.
LIU Caiping CAI Yuwu MAO Jianxu CAI Yuwen. Approximate summation algorithm of distinct records for wireless sensor network. Journal of Computer Applications, 2014, 34(2): 313-317.
2014, Vol. 34 
