An Efficient Energy-Aware and Game-Theory-Based Clustering Protocol for Wireless Sensor Networks

Xuegang WU  Xiaoping ZENG  Bin FANG  

IEICE TRANSACTIONS on Communications   Vol.E101-B   No.3   pp.709-722
Publication Date: 2018/03/01
Publicized: 2017/08/29
Online ISSN: 1745-1345
DOI: 10.1587/transcom.2017EBP3195
Type of Manuscript: PAPER
Category: Fundamental Theories for Communications
wireless sensor networks,  clustering,  network lifetime,  game theory,  network protocol,  

Full Text: PDF(1.7MB)>>
Buy this Article

Clustering is known to be an effective means of reducing energy dissipation and prolonging network lifetime in wireless sensor networks (WSNs). Recently, game theory has been used to search for optimal solutions to clustering problems. The residual energy of each node is vital to balance a WSN, but was not used in the previous game-theory-based studies when calculating the final probability of being a cluster head. Furthermore, the node payoffs have also not been expressed in terms of energy consumption. To address these issues, the final probability of being a cluster head is determined by both the equilibrium probability in a game and a node residual energy-dependent exponential function. In the process of computing the equilibrium probability, new payoff definitions related to energy consumption are adopted. In order to further reduce the energy consumption, an assistant method is proposed, in which the candidate nodes with the most residual energy in the close point pairs completely covered by other neighboring sensors are firstly selected and then transmit same sensing data to the corresponding cluster heads. In this paper, we propose an efficient energy-aware clustering protocol based on game theory for WSNs. Although only game-based method can perform well in this paper, the protocol of the cooperation with both two methods exceeds previous by a big margin in terms of network lifetime in a series of experiments.