Clustering routing algorithm using game-theoretic techniques for WSNs
Zheng Zeng-Wei, Zhaohui Wu, Lin Huai-Zhong · 2004
Wireless sensor networks (for short, WSNs) can be used in many aspects in the future. One obstacle is their limited supply of energy. Therefore, minimizing energy consumption and maximizing the system lifetime have been major design goals for WSNs. This paper presents an energy-efficient ACHGT (Adaptive Clustering Hierarchy based on Game-theoretic Techniques) routing algorithm for WSNs. Individual sensors of the algorithm are modeled as players to make decisions about whether electing to become cluster-head nodes by using node energy payoff functions to weigh their own costs and benefits. This strategy can keep sensor nodes of lower remainder energy out from being used up quickly. Besides, it can evenly distribute the energy load among the sensors in the network to prolong system lifetime. Detailed simulations of sensor network environments demonstrate that the ACHGT algorithm reduces energy consumption, and improves the evenness of dissipated network energy and the ability to postpone the network partitions.