基于最小覆盖集的WSN数据聚集算法  

Data Aggregation Algorithm for WSN Based on Minimal Covering Set

作　　者：吴旦[1] 王改云[1] 李小龙[1] 

机构地区：[1]桂林电子科技大学计算机与控制学院,广西桂林541004

出　　处：《计算机工程》2012年第2期97-99,共3页Computer Engineering

基　　金：国家自然科学基金资助项目"基于信任管理的无线传感器网络高可靠技术研究"(61063040)

摘　　要：针对无线传感器网络(WSN)能量有限且网内聚集错误检测率较低的问题,提出一种基于最小覆盖集的WSN数据聚集算法。构造一颗以汇聚节点为根并包含最少中间转发节点的树,其中间转发节点为树的最小覆盖集。在中间转发节点中引入读向量的相似性判断,以去除网内冗余及错误数据。实验结果表明,该算法能减少网内通信能耗,提高收集数据的准确性。For the limited energy in the Wireless Sensor Network（WSN）,and the shortage of low error detection rate in traditional in-net aggregation.A data aggregation algorithm for WSN based on Minimal Covering Set（MCS） is proposed.It constructs a tree,which contains minimum intermediate forwarding nodes,and root at the sink node.The forwarding nodes are the minimal covering set of the tree.In order to remove the redundant and error data,intermediate nodes introduces similarity judgment of read vectors.Experimental results show the algorithm can reduce the energy consumption of communication within the network,and can improve the accuracy of data collection.

关 键 词：无线传感器网络 最小覆盖集 错误检测 数据聚集 读向量 

分 类 号：TP393[自动化与计算机技术—计算机应用技术]