WSNs中最小通信代价的非均匀分簇算法  

Unequal clustering algorithm with minimum communication costs for WSNs

作　　者：靳士慧[1] 陈岱[1] 周勇[1] 

机构地区：[1]中国矿业大学计算机科学与技术学院,江苏徐州221116

出　　处：《传感器与微系统》2012年第7期126-129,共4页Transducer and Microsystem Technologies

基　　金：教育部博士点基金资助项目(20100095110003)

摘　　要：在现有的无线传感器网络分布式多跳路由的基础上,提出一种最小通信代价的非均匀分簇组网算法,采用定时器策略选择剩余能量较大的节点作为簇头节点,簇内与簇间都选择通信代价最小的路径进行通信,根据簇头剩余能量和距Sink节点距离控制簇规模,通过控制泛洪速度,节点优先加入与Sink节点通信代价较小的分簇,防止数据回传。经实验表明:算法能有效地控制分簇结构的建立,能量利用更加高效,拥有更长的网络生存期。On the basis of current multiple hop router in wireless sensor networks, an unequal clustering algorithm with the minimum communication costs is proposed,which uses a time-based strategy to select a node with higher residual energy as the cluster-head, selects the route with minimum communication costs to communicate among clusters or within clusters, according to the residual energy of cluster-head and the distance from Sink node to control the cluster scale, and avoids data sent back again from the far by controlling the flood speed and node joining the cluster with least communication costs to Sink node for the first priority. Simulation experimental results show that the algorithm can control the establishment of clustering structure effectively, the energy can he used more efficiently, and the network can has longer lifetime.

关 键 词：无线传感器网络 分簇 非均匀 最小通信代价 

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