作者投稿和查稿 主编审稿 专家审稿 编委审稿 远程编辑

计算机工程 ›› 2009, Vol. 35 ›› Issue (11): 65-67. doi: 10.3969/j.issn.1000-3428.2009.11.022

• 网络与通信 • 上一篇    下一篇

基于Bloom过滤器改进的Growth Codes

胡世文1,2,华 蓓1,2   

  1. (1. 中国科学技术大学计算机科学技术系,合肥 230027;2. 中国科学技术大学苏州研究院移动计算实验室,苏州 215123)
  • 收稿日期:1900-01-01 修回日期:1900-01-01 出版日期:2009-06-05 发布日期:2009-06-05

Improved Growth Codes Based on Bloom Filter

HU Shi-wen1,2, HUA Bei1,2   

  1. (1. Depterment of Computer Science & Technology, University of Science and Technology of China, Hefei 230027; 2. Mobile Computing Lab, Suzhou Institute for Advanced Study, University of Science and Technology of China, Suzhou 215123)
  • Received:1900-01-01 Revised:1900-01-01 Online:2009-06-05 Published:2009-06-05

摘要: Growth Codes是为提高灾难环境中传感器网络的持久性而设计的网络编码方案,但它完全随机的数据交换方式导致较多的传输冗余。针对此问题,通过在Growth Codes算法中引入Bloom过滤器减少冗余数据传输。仿真结果表明,改进的Growth Codes算法在包交换数量和解码速度方面优于Growth Codes。

关键词: 无线传感器网络, 网络持久性, Growth Codes算法, Bloom过滤器

Abstract: Growth Codes is a network coding scheme designed for increasing the persistence of Wireless Sensor Network(WSN) in catastrophic scenarios, but its completely random data exchange results in much transmission redundance. This paper introduces Bloom filter into Growth Codes algorithm to reduce the redundant data exchange. Simulation results show that the improved Growth Codes algorithm outperforms the original algorithm in the aspects of the number of packets exchanged and decoding speed of sink node.

Key words: Wireless Sensor Network(WSN), network persistence, Growth Codes algorithm, Bloom filter

中图分类号: