基于博弈的大规模无线传感器网络分簇算法  

Game Theoretic Clustering Algorithm for Large Scale WSN

作　　者：张玺栋[1,2] 康桂霞[1] 张平[1] 张恒 

机构地区：[1]北京邮电大学泛网无线通信教育部重点实验室,北京100876 [2]陆军航空兵学院机载设备系,北京101123 [3]中国电子设备系统工程公司网管中心,北京100840

出　　处：《电子与信息学报》2011年第10期2516-2520,共5页Journal of Electronics & Information Technology

基　　金：国家自然科学基金(2008BAH24B02);国家863计划项目(2009AA02Z412);国际科技合作项目(2010DFA11590)资助课题

摘　　要：合理的分簇方式能够有效延长大规模无线传感器网络(LS-WSN)的寿命,从而降低其部署使用成本。当前很多WSN分簇的研究均假设节点均匀分布,这与实际应用中的大规模WSN有所差距。该文针对节点非均匀分布的大规模WSN,提出了一种分簇算法。该算法在基于蜂窝结构虚拟网格的位置分簇之后,引入博弈理论设计分簇调整流程,使网络达到各簇中节点数尽量均匀的分簇状态。理论分析和仿真结果证明,通过该方法进行分簇,可以有效均衡各个簇中的节点数,从而延长网络有效寿命。Reasonable clustering algorithm can prolong the Large Scale Wireless Sensor Network （LS-WSN） lifetime, so as to reduce the cost of using it. Up to now, most research on WSN clustering assumes that the nodes in WSN are uniformly distributed. But this assumption is different from practical LS-WSN. In this paper, a novel clustering algorithm is proposed, which is suitable for the non-uniformly distributed LS-WSNs. In the proposed algorithm, LS-WSN is clustered according to the location aware clustering method, which based on the hexagons virtual grid, then the clusters are adjusted following a game theoretic adjustment process. After the algorithm, the numbers of nodes in each cluster is nearly similar. Theoretical analysis and simulation results show that the proposed algorithm can effectively balance the number of nodes in each cluster, thus prolonging the effective lifetime of WSN.

关 键 词：泛在网络 无线传感器网络 分簇 节能 博弈 

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