计算机工程与应用2016，Vol.52Issue(20)：132-137,6.DOI:10.3778/j.issn.1002-8331.1603-0335
基于相对局部密度的三维节点调度算法
Node-based relative local density scheduling algorithm for three-dimensional wireless sensor networks
摘要
Abstract
In node scheduling algorithms in the back off dormancy process of redundant nodes, high energy consumption is the problem to be addressed at present. A three-dimensional node scheduling method on the basis of relative local density is proposed in this paper. The algorithm defines the concept of relative local density of nodes. It firstly determines whether a node is redundant according to the principle of redundancy, then puts the redundant node to sleep in the form of probabi-listic competition according to residual energy and relative local density of the nodes, and thus avoids the energy consump-tion of node back off dormancy. Simulation shows that the three-dimensional node scheduling method on the basis of rela-tive local density, under the premise of meeting the specified coverage, can reduce the energy consumption of nodes and prolong the lifetime of network.关键词
无线传感器网络/三维覆盖/节点调度/相对局部密度Key words
wireless sensor networks/three-dimensional coverage/node-scheduling/relative local density分类
信息技术与安全科学引用本文复制引用
党小超,蒲世强,郝占军..基于相对局部密度的三维节点调度算法[J].计算机工程与应用,2016,52(20):132-137,6.基金项目
国家自然科学基金（No.61363059）；西北师范大学青年教师科研能力提升计划项目（No.NWNU-LKQN-13-24）。 （）
