A Secure Zone Probabilistic Routing Algorithm For WSNs

With the rapid development of semiconductor technology, which has led humankind into the information world, human aspiration at information reaches unprecedented lev-els. Under this circumstance, wireless sensor network has been devised by researchers.The performance of wireless sensor networks relies heavily on routing algorithms, and researchers hope to design efficient and stable routing algorithms to prolong the lifetime of the network and improve the availability of the network. However, due to the limited capacity of sensor nodes, it is very difficult to design routing algorithms.A secure probabilistic routing algorithm for wireless sensor networks is proposed in this paper. The algorithm computes forwarding probability distribution in considering multiple factors and selects the next hop forwarding node randomly based the computed probability distribution value. So that the node can consider the current state of the candidate node when selecting the next hop forwarding node, largely avoided to forward the packet to the node is not suitable. At the same time, the algorithm uses the multi-polynomial key distribution scheme to negotiate the key, which is always used to encrypt the communication process, improves the security of the network greatly.The multi-polynomial key distribution scheme proposed in this paper is a combi-nation of q-composite scheme and blundo scheme. The polynomials is generated by the server before deploying the nodes, and then part of the polynomials are assigned to the sensor nodes randomly. In the establishment of communication, the sensor nodes select the same polynomials, use the node ID as parameters to calculate the key. In this scheme, the node calculates multiple polynomials at a time, each time the data is sent, the key is used to encrypt. This avoids the vulnerability of the key in the q-composite scheme, improves the security of the key. The results show that the program has a greater advantage in terms of security and connectivity, with better scalability, but there are some shortcomings in resource cost.Finally, this paper uses C# program language to simulate the routing algorithm this paper proposed. Firstly, the influence of different parameters on the energy con-sumption, delay and balancing of the energy is analyzed. The results show that the configuration of the parameters can make the network performance meet the expecta-tion in most cases. When the parameter configuration satisfy a certain relationship, it makes the network performance best. Secondly, several similar routing algorithm are compared and analyzed by simulation. The results show that the algorithm proposed has a greater advantages in energy consumption, routing efficiency and network lifetime.