School of Information Engineering, Henan University of Science and Technology, Luoyang 471000, China.
School of Information and Electrical Engineering, China Agriculture University, Beijing 100083, China.
Sensors (Basel). 2022 Oct 18;22(20):7936. doi: 10.3390/s22207936.
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.
能量限制是无线传感器网络（WSN）的固有缺点之一，尽管它已广泛应用于灾害响应、战场监测、野火监测、放射性检测等领域。由于数据传输消耗大量能量，因此通过设计各种分层路由协议来延长网络寿命引起了越来越多的关注。结果，相继出现了许多成果。然而，这些提出的机制很少能够保证令人满意的服务质量（QoS），同时降低 WSN 的能量成本水平。同时，不可侵性无疑是评估 QoS 的一个极好的定量指标。因此，开发一种实用的路由方法来优化网络寿命，同时考虑不可侵性和能量效率，这一点至关重要。博弈论适用于这样一个关键问题，因为它可以在节点或网络级别使用，以鼓励 WSN 的决策能力。在本文中，提出了一种使用博弈论方法的新的抗毁性感知聚类路由算法（IACRA）来解决这一困境。基于博弈论的路由协议的核心特征包括整体抗毁性感知、分层路由中的最优簇头选择、距离感知簇头发现以及用于优化寿命的簇旋转更新机制。特别地，基于加权融合构建了整体网络抗毁性，通过组合用于评估局部和整个网络的抗毁性指标来进一步定义利润模型。同时，通过不可侵性和节点能量消耗之间的博弈，建立了每个节点选为 CH 的最优概率函数。此外，提出了基于簇旋转的簇更新机制，以避免由于能量消耗大而快速死亡的节点，从而最大限度地延长网络寿命。实验结果表明，与包括 GEEC（基于博弈论的节能聚类路由协议）、HGTD（基于博弈论的混合分布式聚类协议）和 EEGC（高效节能和基于博弈论的聚类协议）在内的其他三种著名聚类路由协议相比，该算法在能量平衡和抗毁性方面都有显著提高。具体来说，在 400 个通信回合中，IACRA 的抗毁性比 GEEC、HGTD 和 EEGC 分别高出 77.56%、29.45%和 15.90%，而 IACRA 的平均剩余能量比 GEEC、HGTD 和 EEGC 分别高出 8.61%、18.35%和 6.36%。基于这些结果，所提出的协议可用于提高 WSN 对 QoS 恶化和能量约束的适应能力。
