Abstract
Due to their working environments, limited resources and communication characteristics, wireless sensor networks face some challenges including energy optimization and security enhancement to extend the network lifetime and guarantee the network security. Therefore, an energy-aware and trust-based routing protocol for wireless sensor networks using adaptive genetic algorithm called TAGA is proposed to not only resist common routing attacks and special trust attacks, but also minimize the energy consumption caused by data transmission. To this end, TAGA constructs the nodes’ comprehensive trust values based on their direct trust values considering the volatilization and adaptive penalty factors, and indirect trust values with the filtering mechanisms. In addition, a novel threshold function is presented to select the optimal cluster heads, which considers the dynamic changes of the nodes’ comprehensive trust values and residual energy. Finally, a genetic algorithm with adaptive crossover probability and mutation probability is applied to find the optimal secure routing for the cluster heads. The simulation results show that TAGA can reduce the number of packets discarded by malicious nodes when facing common attacks and special trust attacks, and effectively improve the energy efficiency compared to the relative secure routing protocols EOSR and IASR.
Highlights
Wireless sensor networks (WSNs) are comprised of multitudinous sensor nodes that are low-priced, low-power and miniature characteristics [1]–[3]
The rest of the paper is organized as follows: Section 2 presents the past work of many researchers; Section 3 describes the improved trust proposed in this paper; Section 4 presents the energy model of TAGA; Section 5 describes the pathfinding process of TAGA in detail; Section 6 verifies the performance of TAGA through simulation experiments; Section 7 concludes the paper
The proposed TAGA uses comprehensive trust values to evaluate the security of individual nodes and adaptive genetic algorithms to evaluate the security of links, improving the network’s ability to cope with attacks
Summary
Wireless sensor networks (WSNs) are comprised of multitudinous sensor nodes that are low-priced, low-power and miniature characteristics [1]–[3]. Y. Han et al.: Energy-Aware and Trust-Based Secure Routing Protocol for WSNs Using Adaptive Genetic Algorithm bad-mouth attacks) are designed to target trust-based security mechanisms. How to resist both common attacks and trust attacks, as well as to find a secure and energy-saving route for the network, is one of the important issues that many researchers explore. The routing protocol based on trust and adaptive genetic algorithm proposed in this paper resists common routing attacks and special trust attacks by building a trust model. TAGA design the fitness function of an adaptive genetic algorithm (AGA) according to node comprehensive trust value, energy trust value and hop count as parameters to find secure and energy-saving routes. TAGA is improving security by building an adaptive trust model to evaluate the comprehensive trust value of each node to resist common attacks and special trust attacks. The rest of the paper is organized as follows: Section 2 presents the past work of many researchers; Section 3 describes the improved trust proposed in this paper; Section 4 presents the energy model of TAGA; Section 5 describes the pathfinding process of TAGA in detail; Section 6 verifies the performance of TAGA through simulation experiments; Section 7 concludes the paper
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.