中文摘要：

已有传感器网络虚假数据过滤机制采用随机策略部署节点，由转发节点对数据包中附带的t个MAC(messageauthenticationcode)签名进行验证,从而实现对虚假数据的识别和过滤。然而在实际应用中，随机部署往往在网络中形成部分稀疏区域，无法被t个拥有不同密钥分区的节点同时覆盖。提出利用覆盖算法对节点进行部署，在均衡覆盖质量及网络开销的情况下，证明了适用于虚假数据过滤的最优节点覆盖度为2t，并进一步推导了一些相关的覆盖结论。理论分析及仿真实验表明，与随机部署相比，最优覆盖算法极大提高了t个密钥分区同时覆盖的概率。当400个节点部署于50X50m2的区域时，随机部署和最优覆盖算法保证t个密钥分区同时覆盖的概率分别为9%和92%。

英文摘要：

In wireless sensor netw orks, existing false data filte ring mechanisms exploit random method to deploy nodes, andve rify the attached t MACs (message authentication codes) in each data re port on interm ediate nodes, thus to detect and filte rout false reports. However, in actually applications, random deployment method usually forms some sparse areas in the network which cannot be covered by t nodes with distinct key partitions simultaneously. W ith an aim to balance covering qu a lityand overhead o f the n e tw o rk, this paper first analyzed and proved the op tim al covering degree was 2t fo r false data filte rin g ,and then exp lo ited the corresponding o p tim al covering algo rithm to deploy nodes. M oreover, it also derived some useful covering theorems. Theoretical analysis and sim ulation results dem onstrate th a t, com pared w ith random de ploym e nt, op tim al covering can im prove the efficiency of covering by t keys sim ultaneously. For exa m ple, when there are 400 nodes deployed in an a reao f 50 x 50 m 2 , the p ro b a b ilitie s o f random deploym ent and op tim al covering algo rithm to guarantee covering by t keys sim u ltaneouslyare 9 % and 9 2 % respectively.