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

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