Trust management-based and energy efficient hierarchical routing protocol in wireless sensor networks

Fang, Weidong; Zhang, Wuxiong; Yang, Wei; Li, Zhannan; Gao, Weiwei; Yang, Yinxuan

doi:10.1016/j.dcan.2021.03.005

Cited by 85 publications

(28 citation statements)

References 32 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The DDTMB utilizes data collected from internet of things devices to demonstrate the resulting communication. Similarly, a trust management-based and energy-efficient hierarchical routing protocol were also suggested in [9]. To reduce node energy consumption, LEACH-TM restricted the cluster size.…”

Section: Related Workmentioning

confidence: 99%

Utilising Acknowledge for the Trust in Wireless Sensor Networks

et al. 2022

View full text Add to dashboard Cite

Wireless Sensor Networks (WSNs) are emerging networks that are being utilized in a variety of applications, such as remote sensing images, military, healthcare, and traffic monitoring. Those critical applications require different levels of security; however, due to the limitation of the sensor networks, security is a challenge where traditional algorithms cannot be used. In addition, sensor networks are considered as the core of the Internet of Things (IoT) and smart cities, where security became one of the most significant problems with IoT and smart cities applications. Therefore, this paper proposes a novel and light trust algorithm to satisfy the security requirements of WSNs. It considers sensor nodes’ limitations and cross-layer information for efficient secure routing in WSNs. It proposes a Tow-ACKs Trust (TAT) Routing protocol for secure routing in WSNs. TAT computes the trust values based on direct and indirect observation of the nodes. TAT uses the first-hand and second-hand information from the Data Link and the Transmission Control Protocol layers to modify the trust’s value. The suggested TATs’ protocols performance is compared to BTRM and Peertrust models in terms of malicious detection ratio, accuracy, average path length, and average energy consumption. The proposed algorithm is compared to BTRM and Peertrust models, the most recent algorithms that proved their efficiency in WSNs. The simulation results indicate that TAT is scalable and provides excellent performance over both BTRM and Peertrust models, even when the number of malicious nodes is high.

show abstract

Section: Related Workmentioning

confidence: 99%

Utilising Acknowledge for the Trust in Wireless Sensor Networks

et al. 2022

View full text Add to dashboard Cite

show abstract

“…Moreover, the analysis of invulnerability is undoubtedly concerned with the guarantee of QoS performance under the impact of various network attacks [ 34 , 35 , 36 , 37 ]. Nevertheless, the related studies cannot fully reflect the difference value of network invulnerability in the process of node failure.…”

Section: Related Workmentioning

confidence: 99%

IACRA: Lifetime Optimization by Invulnerability-Aware Clustering Routing Algorithm Using Game-Theoretic Approach for Wsns

Wang

Zhang²,

et al. 2022

Sensors

View full text Add to dashboard Cite

Energy limitation is one of the intrinsic shortcomings of wireless sensor networks (WSNs), although it has been widely applied in disaster response, battlefield surveillance, wildfire monitoring, radioactivity detection, etc. Due to the large amount of energy consumed for data transmission, how to prolong the network lifespan by designing various hierarchical routing protocols has attracted more and more attention. As a result, numerous achievements have emerged successively. However, these presented mechanisms can rarely guarantee the satisfactory quality of service (QoS), while lowering the energy cost level of WSNs. Meanwhile, invulnerability is undoubtedly an excellent quantitative index to assess QoS. Therefore, it is critical to develop a practical routing method to optimize network lifetime by considering both invulnerability and energy efficiency. Game theory is suitable for such a critical problem as it can be used in node or at network level to encourage the decision-making capabilities of WSNs. In this paper, a novel invulnerability-aware clustering routing algorithm (IACRA) using game-theoretic method is proposed to solve the predicament. The core features of the addressed game-theory-based routing protocol include integral invulnerability awareness, optimal cluster head selection in hierarchical routing, distance-aware cluster head discovery, and cluster rotation update mechanism for lifetime optimization. Particularly, the integral network invulnerability based on weighted fusion is constructed for further defining the profit model by combining the invulnerability indicators used to evaluate the local and whole network. Meanwhile, the optimal probability function of every node elected as CH in per cluster is established through the game between invulnerability and node energy consumption. In addition, the cluster update mechanism base on cluster rotation is proposed to avoid the rapid death of nodes with large energy consumption for maximizing network lifetime. The experimental results indicated a significant improvement in energy balance as well as in invulnerability compared with the other three kinds of well-known clustering routing protocols including GEEC (Game-theory-based energy efficient clustering routing protocol), HGTD (Hybrid, game-theory-based distributed clustering protocol), and EEGC (Efficient energy-aware and game-theory-based clustering protocol). Concretely, at the 400 communication rounds, the invulnerability of IACRA was higher than that of GEEC, HGTD, and EEGC by 77.56%, 29.45% and 15.90%, respectively, and the average residual energy of IACRA was 8.61%, 18.35% and 6.36% larger than that of GEEC, HGTD, and EEGC, respectively. Based on these results, the proposed protocol can be utilized to increase the capability of WSNs against deterioration of QoS and energy constraints.

show abstract

“…Wireless sensor networks (WSNs) are comprised of multitudinous sensor nodes that are low-priced, low-power and miniature characteristics [1]- [3]. These nodes are datacentric responsible for collecting relevant data in the target area and transmitting the data to the sink node (base station or control center) in a single-hop or multi-hop manner [4], [5].…”

Section: Introductionmentioning

confidence: 99%

Energy-Aware and Trust-Based Secure Routing Protocol for Wireless Sensor Networks Using Adaptive Genetic Algorithm

Han

Guo

2022

IEEE Access

View full text Add to dashboard Cite

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.INDEX TERMS Wireless sensor networks, secure routing, comprehensive trust, direct trust.

show abstract

Trust management-based and energy efficient hierarchical routing protocol in wireless sensor networks

Cited by 85 publications

References 32 publications

Utilising Acknowledge for the Trust in Wireless Sensor Networks

Utilising Acknowledge for the Trust in Wireless Sensor Networks

IACRA: Lifetime Optimization by Invulnerability-Aware Clustering Routing Algorithm Using Game-Theoretic Approach for Wsns

Energy-Aware and Trust-Based Secure Routing Protocol for Wireless Sensor Networks Using Adaptive Genetic Algorithm

Contact Info

Product

Resources

About