A secure routing algorithm in wireless sensor networks

Wireless sensor networks suffer from the secure threat, which leads to excessive energy consumption and the expense of increased transmission delay. In this paper, a secure routing algorithm is proposed. The node evaluates the neighbor node by the trust value. The trust value of node is calculated by the accuracy rate of messages exchanging between two nodes. The trusted neighbor nodes set of the node is built on the trusted nodes those trust value is larger than the threshold value. Using the object function that consists of the parameters trust value, energy and delay, the most optimal path is found out by ant colony optimization. When the trust value of next hop node is lower than the threshold value, the routing path is deleted and changed into the other node. The experiment results show the algorithm has better performance than the current algorithm in terms of the network residual energy and transmission delay.