## 6 Conclusions  
To improve the security and reliability of wireless sensor network nodes, this paper introduces a multi-attribute pheromone ant secure routing algorithm based on reputation value (MPASR). In this algorithm, ant-colony optimization is applied in the routing protocol, and the node reputation, residual energy and transmission delay are all treated as major components of the pheromone used in the optimization. In the calculation of the node reputation values, the randomness of the node distributions in wireless sensor networks is considered. Because the calculation of the reputation values may otherwise incur excessive energy consumption, we filter out unnecessary nodes by calculating the coincidence rates among the nodes. This reduces the information coincidence rate while considering network security, thereby allowing the energy consumption of the network to be reduced as much as possible to prolong the network lifetime. To ensure that the nodes can effectively resist attack from malicious nodes, the node reputation value is given the highest weight during node selection. Finally, experimental simulations are presented to compare the performances of the proposed algorithm, the TANARP algorithm, the ACORC algorithm and the QOS-PSO algorithm in terms of the packet delivery ratio, the packet loss rate, and the final number of data packets successfully received. The results fully demonstrate the superiority of the algorithm proposed in this paper.  
Although this algorithm represents a considerable improvement in terms of security, it also has some shortcomings. For example, in the simulation experiment, all routing algorithms do not consider the redundant path and only select one path to transmit data. However, in practice, it is very common to use redundant paths to improve the reliability of data transmission in wireless sensor networks. In the future work, the redundant path should be taken into account. Secondly, the algorithm needs to release the query ant to judge the direction of the path in the process of routing optimization and increase the additional computing time to evaluate the attributes of the path, which has a certain effect on delay. On top of these, this paper considered only malicious nodes to simulate an attack on a wireless sensor network; however, because of the complexity of real-world networks, the ability of the  
Figure 11: Comparison of the numbers of data packets received.  
experimental simulations to represent practical situations is limited. Therefore, more different attacks should be studied in the future work.  
This research was sponsored by the National Natural Science Foundation of China (61402241, 61572260, 61373017, 61572261, 61472192) and by the Scientific & Technological Support Project of Jiangsu Province (BE2014718, BE2015702).  
[PERSON] proposed the main principle of the MPASR algorithm, and [PERSON] designed the algorithm's implementation. [PERSON] and [PERSON] conducted the simulation experiments and verified the theory. [PERSON] served as advisor to the authors listed above and provided suggestions regarding the simulations and the performance evaluation. The manuscript was written through the combined effort of the five authors. All authors have read and approved the final manuscript.  
The authors declare no conflict of interest.