A hybrid, game theory based, and distributed clustering protocol for wireless sensor networks

作者：Yang, Liu; Lu, Yin-Zhi; Zhong, Yuan-Chang^*; Wu, Xue-Gang; Xing, Shao-Jing

来源：Wireless Networks, 2016, 22(3): 1007-1021.

DOI：10.1007/s11276-015-1011-3

• Wireless sensor networks
• Clustering
• Game theory
• Equilibrium
• Network lifetime

Clustering has been well known as an effective way to reduce energy dissipation and prolong network lifetime in wireless sensor networks. Recently, game theory has been used to model clustering problem. Each node is modeled as a player which can selfishly choose its own strategies to be a cluster head (CH) or not. And by playing a localized clustering game, it gets an equilibrium probability to be a CH that makes its payoff keep equilibrium. In this paper, based on game theory, we present a clustering protocol named Hybrid, Game Theory based and Distributed clustering. In our protocol, we specifically define the payoff for each node when choosing different strategies, where both node degree and distance to base station are considered. Under this definition, each node gets its equilibrium probability by playing the game. And it decides whether to be a CH based on this equilibrium probability that can achieve a good trade-off between minimizing energy dissipation and providing the required services effectively. Moreover, an iterative algorithm is proposed to select the final CHs from the potential CHs according to a hybrid of residual energy and the number of neighboring potential CHs. Our iterative algorithm can balance the energy consumption among nodes and avoid the case that more than one CH occurs in a close proximity. And we prove it terminates in finite iterations. Simulation results show that our protocol outperforms LEACH, CROSS and LGCA in terms of network lifetime.

• 出版日期2016-4
• 单位重庆大学; 长江师范学院