一种优化的基于博弈论的无线传感器网络区域分簇算法-计算机科学.pdfVIP

第 44 卷第3 期 计算机科学 Vo1. 44 NO.3 COMPUTER SCIENCE 岛1ar.2017 2017 年 3 月 一种优化的基于博弈论的无线传感器网络区域分簇算法 尹翔常丽萍戴维超李春晓 (扬州大学信息工程学院 扬州 225127) 摘 要 能量消耗是设计无线传感器网络时需要考虑的主要因素。已有的研究大都利用分簇的思想实现网络能耗的 节省与均衡，但这些方法存在簇首个数不稳定及分布不均等缺点，ρ、而影响了整个网络的生存时间。给出一种优化的 基于博弈论的分簇路由协议。该算法根据最优簇头数来对区域进行为i 分，在每个区域内采用博弈的方式博弈出一个 簇头。同时，为了均衡整个网络的能耗、延长网络生命期，还引入了概率归零机制和区域轮转机制。最后，通过仿真实 验验证了算法的优越性。 关键词 无线传感器网络，分簇，能量，博弈论 中图法分类号 TP393.04 文献标识码 A 001 10. 11896/j. issn. 1002-137叉 2017.03.027 Optimized Clustering Wireless Sensor Network Algorithm ßased on Game Theory Y卧~ Xiang CHANG Li-ping DAI Wei-chao LI Chun-xiao (College of Information Engineering ,Yangzhou University ,Yangzhou 225127 ,China) Abstract One main factor which should be considered in the design of wireless sensor network is the energy consump tio n. Most of existing researches achieve the decline and balance of network energy by clustering ,and these approaches still have some drawbacks ,such as the unstable number and uneven distributions of cluster heads ,and then it affects the lifetime of the whole network. An optimized clustering routing protocol based on game theory was proposed in this pa per. The protocol partitions the region according to the optimal number of cluster head ,and a cluster head is generated through gaming within each sub-regio n. In order to balance the energy consumption of the entire network and extend the network lifetime ,the algorithm also introduces zero probability mechanism and regional rotation mechanisrn. Finally ,the superiority of the algorithm is verified by simulation experiments. Ke归lords Wireless sensor network ,Clustering , Energy ,Game theory