基于测距的无线传感器网络均衡式招募调度算法  

Range-based Distributed Recruit Scheduling in WSNs

作　　者：林志贵[1,2,3] 杜春辉[1] 孟德军[1] 杨子原[2] 王玺[1] 

机构地区：[1]天津工业大学电子与信息工程学院,天津300387 [2]天津工业大学天津市光电检测技术与系统重点实验室,天津300387 [3]国家海洋技术中心近海海洋环境观测与监测技术研究室,天津300112

出　　处：《信息与控制》2016年第6期684-690,共7页Information and Control

基　　金：国家自然科学基金资助项目(61372011)

摘　　要：节点调度是均衡无线传感器网络能量有效方法之一.分析基于测距的睡眠调度算法(RBSS)发现其招募节点能耗过大,造成其过早死亡,影响网络的生命周期.针对这个问题,本文在正六边形覆盖模型的基础上,基于能量均衡思想,提出基于测距的均衡式招募调度算法(RBDRS).RBDRS算法将协作节点招募的任务转移到新招募的协作节点上,均衡网络能耗.招募节点通过测距招募距其最远的邻居节点作为协作节点,协作节点再依次为招募节点招募新的协作节点,直至无法招募到新的协作节点.仿真实验结果表明,与RBSS算法相比,在不增加额外开销的条件下,RBDRS算法能够有效减少工作节点数目,提高网络覆盖率,均衡网络能耗,延长网络生命周期.Node scheduling is one approach used to balance the problems of energy constraints in wireless sensor networks. By analyzing the range-based sleep scheduling algorithm （RBSS）, we find that the recruitnode energy consmnption of the RBSS is too large. This condition results in the node having premature deaths, which in turn, affect the network life cycle. To solve this problem, we propose a range-based distributed recruit scheduling （RBDRS） method based on the regular hexagon node coverage model, combined with energy-balanced concept. The RBDRS algorithm adopts the method of distributed recruitment, which transfers the recruited task of cooperating nodes to new-recruitment cooperative nodes in order to balance network energy consumption. Recruitment nodes recruit the farthest neighbor nodes as collaborative nodes based on their distance ; then, the collaborative nodes recruit new collaborative nodes for recruitment nodes until they are unable to recruit new ones. Simulation results show that, compared with the RBSS algorithm, in case the overhead does not increase, the RBDRS algorithm can effectively reduce the number of worker nodes, thus improving network coverage, achieving balanced network energy consumption, and prolonging the network＇s lifetime.

关 键 词：节点调度 分布式招募 无线传感器网络 

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