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

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

针对目前大多数节点调度算法在冗余节点退避休眠过程中能耗大的问题,提出了一种基于相对局部密度的三维节点调度方法。算法定义了节点相对局部密度的概念,首先根据冗余法则判断节点是否冗余,然后根据节点的剩余能量和相对局部密度让冗余节点以概率竞争的方式休眠,从而避免了节点退避休眠的能耗。仿真实验表明基于相对局部密度的三维节点调度方法能在满足指定的覆盖率的前提下,降低节点的能耗,延长网络的生存时间。

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.