N-Person Card Game algorithm for solving set K-Cover problem in WSN
Wenjie Yan, Qiang Wang, Yi Shen · 2011
Solutions to Set K-Cover problem can prolong the life time of WSN by partitioning the nodes into K sets. In this paper, a novel pure distributed method for solving K-Cover problem is introduced based on game theory, in which we consider the Set K-Cover problem as a Non-Cooperate N-Person Card Game. The nodes in WSN are considered as the players, the cover sets chosen by N nodes as strategies, and the sensing area alone as the payoff function for each node. After the gaming process, the best strategies all the players have chosen constitute the Nash equilibrium. Finally, extensive simulations have been conducted to show the superiority in convergence and coverage of the proposed method over the random, K-cover and SNECA algorithms.