The Research On The Routing Algorithm Of WSN

Wireless Sensor Network (WSN) has been more and more popular in recent study. Based on the different features of WSN, the routing protocols for WSN have drawn much attention in the academic world. It has become one of the most urgent problems to develop the specific WSN routing protocol in this field.In this paper, the classical routing protocols are analyzed and an improved longest prefix matching routing algorithm based on IPv6 is proposed. The improved algorithm transforms the network-prefixes and destination addresses to the decimal representation. Then the network-prefixes are stored using Scalable Bloom filter and the transformed destination addresses are stored sectionally to reduce the number of filters. The purpose of fast lookup is achieved by equitable distribution of prefix. Based on the features of Scalable Bloom filter, the extension times and error rate subject to the same address length are decreased, which ensures the algorithm's accuracy. Besides, the transformation of the network-prefixes and destination addresses to decimal representation can shorten the length of the address; reduce times of matching and achieve quick routing lookup speed. In the context of a great number of sensor nodes in the WSN, the improved algorithm can reduce the average detections of address decrease the number of the filters, accelerate the lookup speed and improve the performance of WSN.With the same network-prefix, the improved algorithm in this paper reduces the average detection times compared with the original algorithms. What's more, with the increase of sensor nodes, it is verified by the simulation of OMNeT++that the improved algorithm also has better performance in the time and storing efficiency.