N-Person Card Game algorithm for solving set K-Cover problem in WSN

@article{Wenjie2011NPersonCG,
  title={N-Person Card Game algorithm for solving set K-Cover problem in WSN},
  author={Yan Wenjie and Wang Qiang and Shen Jia Yi},
  journal={2011 IEEE International Instrumentation and Measurement Technology Conference},
  year={2011},
  pages={1-6}
}
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… CONTINUE READING