基于连通覆盖度的WSN分簇协议  

WSN Clustering Protocol Based on Connectivity Coverage

作　　者：马小飞[1] 缪亮[2] 范媛媛[3] 

机构地区：[1]河南大学计算机与信息工程学院,开封475004 [2]开封教育学院计算机系,开封475000 [3]北京邮电大学计算机学院,北京100876

出　　处：《计算机工程》2010年第15期114-116,共3页Computer Engineering

基　　金：国家"863"计划基金资助项目(2007AA01Z478);河南省教育厅自然科学基金资助项目(2008A520002);河南省高等学校青年骨干教师资助计划基金资助项目(08210221000)

摘　　要：针对层次型分簇网络的结构特性,提出基于连通覆盖度的WSN分簇协议。利用最大熵原理对整个网络进行预分簇得到临时簇头,在保证网络覆盖度的前提下获取各分簇内活跃节点的连通支配集,通过优化更新临时簇头选出真实簇头和替补簇头,实现簇内与簇间节点的通信。仿真结果表明,相比HEED,SPAN协议,该协议能均衡分簇能量,优化连通覆盖性能,具有较强的鲁棒性。Aiming at the structural property of layered clustering network,this paper proposes a WSN clustering protocol based on connectivity coverage.It makes use of maximum entropy principle to select temporary cluster head by pre-clustering for whole network,and selects Connected Dominating Set（CDS） of active nodes in each cluster under the premise of coverage connectivity,and selects real and substitute cluster head by optimizing and updating temporary node to realize communication between intra-cluster and inter-cluster.Simulation result shows that this protocol can improve the connectivity coverage performance,balance energy in clustering,and achieve strong robustness compared with HEED and SPAN protocol.

关 键 词：连通覆盖度 分簇 负载平衡 鲁棒性 

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