Journal of Systems Engineering and Electronics ›› 2012, Vol. 23 ›› Issue (1): 154-159.doi: 10.1109/JSEE.2012.00019

• SOFTWARE ALGORITHM AND SIMULATION • Previous Articles     Next Articles

Clustering routing algorithm of wireless sensor networks based on Bayesian game

Gengzhong Zheng1,2,*, Sanyang Liu3, and Xiaogang Qi3   

  1. 1. School of Computer Science and Technology, Xidian University, Xi’an 710071, P. R. China;
    2. Department of Mathematics and Information Technology, Hanshan Normal University, Chaozhou 521041, P. R. China;
    3. School of Science, Xidian University, Xi’an 710071, P. R. China
  • Online:2012-02-25 Published:2010-01-03


To avoid uneven energy consuming in wireless sensor networks, a clustering routing model is proposed based on a Bayesian game. In the model, Harsanyi transformation is introduced to convert a static game of incomplete information to the static game of complete but imperfect information. In addition, the existence of Bayesian nash equilibrium is proved. A clustering routing algorithm is also designed according to the proposed model, both cluster head distribution and residual energy are considered in the design of the algorithm. Simulation results show that the algorithm can balance network load, save energy and prolong network lifetime effectively.