Abstract: Aiming at the global unicast address of WSN, this paper proposes a fast IP lookup scheme for IPv6 by using Bloom Filter(BF) as the storage structure by finding an appropriate storage method to reduce the false positive rate and longest prefix matching algorithm with a reasonable allocation of the prefix, so that it adopts a relatively small number of Static Random Access Memory(SRAM) to reduce the cost. Experimental results show that the method can reduce the hash probe of each routing, which can enhance the lookup speed of routing table and so improve the performance of WSN.

Key words: WSN, IPv6, longest prefix match algorithm, routing lookup, Bloom Filter(BF)

摘要： 针对无线传感器网络(WSN)中的全局单播地址，提出一种IPv6快速路由查找机制。利用布鲁姆过滤器作为存储结构，以合适的存储方法降低错误率，采用最长前缀匹配算法合理分配前缀，以减少静态随机存取存储器的数量，降低成本。实验结果表明，利用该算法可以减少每一次查找的散列探头，从而提高路由表的查找速度，改善WSN的性能。

关键词: 无线传感器网络, IPv6, 最长前缀匹配算法, 路由查找, 布鲁姆过滤器

CLC Number: 

• TP393