Clustering routing algorithm of wireless sensor networks based on Bayesian game |
| |
Authors: | Gengzhong Zheng Sanyang Liu Xiaogang Qi |
| |
Institution: | 1. School of Computer Science and Technology, Xidian University, Xi'an 710071, P. R. China; Department of Mathematics and Information Technology, Hanshan Normal University, Chaozhou 521041, P. R. China; 2. School of Science, Xidian University, Xi'an 710071, P. R. China |
| |
Abstract: | 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. |
| |
Keywords: | wireless sensor networks (WSNs) clustering routing Bayesian game energy efficiency |
本文献已被 CNKI 维普 万方数据 等数据库收录! |
| 点击此处可从《系统工程与电子技术(英文版)》浏览原始摘要信息 |
| 点击此处可从《系统工程与电子技术(英文版)》下载免费的PDF全文 |