Analysis Of Wireless Sensor Network Routing Strategy Based On Complex Network Theory

With the continuous development of human society, the way access to information is ever-changing. Nowadays, wireless sensor network is a very good platform, the cost of the node in it is very cheap, and the volume is small too. The node can be randomly placed in the region of the detected depends on specific needs. As the energy of the node itself can carry is very limited. Therefore, researchers hope to reasonably distributed sensor nodes in the monitoring region, efficient routing algorithm et al. to extend the working time of the network and improve the performance of the network communication. Since the characteristics of wireless sensor networks is very different from many traditional wireless network, such as there will be lots of sensor nodes in the detected region, and it is a data-centric network with dynamic changes in the topology in limited energy reserve, our work is creating a preferential strategy routing for wireless sensor networks by using scale-free network theory of complex networks. Discovering the network’s topology and performance characteristics under the routing policy which our proposed, and observing degree distribution characteristics of the network, the average path length and the random attack and deliberately attacking performance at the same time. After studying the performance of this protocol, we proposed another routing protocol named reverse scale-free preferential routing strategy.Through experimental simulation, we compare the performance and characteristics of the two strategies in the three aspects of the network degree distribution, average path length, and capability of random attacks and deliberately attack. Comparison by the degree distribution of the network diagram, we found the RFS strategy network’s average degree is smaller, and the maximum value of degree in this RFS network is also relatively small. In the same time, small degree nodes share a greater proportion of the total network nodes. We also found that RFS strategy network average path length is smaller than the FS strategy by comparing the average path length. After that, the two strategies are similar in the performance on the random attacks and deliberately attacks. Overall the preference of the RFS strategy is better than the FS strategy.