基于相对局部密度的三维节点调度算法  

Node-based relative local density scheduling algorithm for three-dimensional wireless sensor networks

作　　者：党小超[1,2] 蒲世强 郝占军[1,2] DANG Xiaochao;PU Shiqiang;HAO Zhanjun(College of Computer Science and Engineering, Northwest Normal University, Lanzhou 730070, China;Gansu Province Internet of Things Engineering Research Center, Lanzhou 730070, China)

机构地区：[1]西北师范大学计算机科学与工程学院,兰州730070 [2]甘肃省物联网工程研究中心,兰州730070

出　　处：《计算机工程与应用》2016年第20期132-137,共6页Computer Engineering and Applications

基　　金：国家自然科学基金(No.61363059);西北师范大学青年教师科研能力提升计划项目(No.NWNU-LKQN-13-24)

摘　　要：针对目前大多数节点调度算法在冗余节点退避休眠过程中能耗大的问题,提出了一种基于相对局部密度的三维节点调度方法。算法定义了节点相对局部密度的概念,首先根据冗余法则判断节点是否冗余,然后根据节点的剩余能量和相对局部密度让冗余节点以概率竞争的方式休眠,从而避免了节点退避休眠的能耗。仿真实验表明基于相对局部密度的三维节点调度方法能在满足指定的覆盖率的前提下,降低节点的能耗,延长网络的生存时间。In node scheduling algorithms in the back off dormancy process of redundant nodes, high energy consumptionis the problem to be addressed at present. A three-dimensional node scheduling method on the basis of relative local densityis proposed in this paper. The algorithm defines the concept of relative local density of nodes. It firstly determines whethera node is redundant according to the principle of redundancy, then puts the redundant node to sleep in the form of probabilisticcompetition according to residual energy and relative local density of the nodes, and thus avoids the energy consumptionof node back off dormancy. Simulation shows that the three-dimensional node scheduling method on the basis of relativelocal density, under the premise of meeting the specified coverage, can reduce the energy consumption of nodes andprolong the lifetime of network.

关 键 词：无线传感器网络 三维覆盖 节点调度 相对局部密度 

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