一种优化的基于博弈论的无线传感器网络区域分簇算法  

Optimized Clustering Wireless Sensor Network Algorithm Based on Game Theory

作　　者：尹翔[1] 常丽萍[1] 戴维超 李春晓[1] YIN Xiang CHANG Li-ping DAI Wei-chao LI Chun-xiao(College of Information Engineering, Yangzhou University, Yangzhou 225127, China)

机构地区：[1]扬州大学信息工程学院,扬州225127

出　　处：《计算机科学》2017年第3期123-127,共5页Computer Science

基　　金：国家自然科学基金(61472344;61401387);江苏省自然科学基金(BK20150460);扬州市自然科学基金(YZ2014054);扬州大学科技创新培育基金资助

摘　　要：能量消耗是设计无线传感器网络时需要考虑的主要因素。已有的研究大都利用分簇的思想实现网络能耗的节省与均衡,但这些方法存在簇首个数不稳定及分布不均等缺点,从而影响了整个网络的生存时间。给出一种优化的基于博弈论的分簇路由协议。该算法根据最优簇头数来对区域进行划分,在每个区域内采用博弈的方式博弈出一个簇头。同时,为了均衡整个网络的能耗、延长网络生命期,还引入了概率归零机制和区域轮转机制。最后,通过仿真实验验证了算法的优越性。One main factor which should be considered in the design of wireless sensor network is the energy consump- tion. 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-region. 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 mechanism. Finally, the superiority of the algorithm is verified by simulation experiments.

关 键 词：无线传感器网络 分簇 能量 博弈论 

分 类 号：TP393.04[自动化与计算机技术—计算机应用技术]