一种基于邻居节点运动的分布式有向栅栏构建算法

发布时间：2018-03-19 17:48

  本文选题：有向栅栏覆盖　切入点：目标位置　出处：《计算机研究与发展》2017年01期 　论文类型：期刊论文

【摘要】：K-栅栏覆盖是有向传感器网络的研究热点之一.目前为止,很少从移动和转动能耗相结合考虑有向栅栏构建.提出一种基于邻居节点运动的分布式有向强栅栏构建方法(distributed directional strong barrier construction based on neighbor actuation,DBCNA).在形成栅栏的节点集合中,若在前一个感知区域内部存在节点,横坐标最大的节点就是节点的目标位置.如果感知区域内部没有节点,则令前一个节点正右方向一个半径距离处作为下一节点的目标位置.有向节点的目标感知方向由移动到该位置的移动节点的初始感知方向决定.若初始感知方向0≤β≤α/2或2π-α/2≤β≤2π,目标感知方向就是节点的初始感知方向;若α/2≤β≤π,目标感知方向为β=α/2;若πβ2π-α/2,目标感知方向为β=2π-α/2.仿真结果证明了该栅栏构建方法比其他方法节省40%的节点,平均能耗降低了40%~50%,具有重要的理论与实际意义.
[Abstract]:K- fence coverage is one of the research hotspots in directed sensor networks. In this paper, a new method of distributed directional strong barrier construction based on neighbor actuation is presented, which is based on neighbor node motion. In the set of nodes that form the fence, a new method is proposed, which is based on the energy consumption of movement and rotation. If there is a node within the previous perceptual region, the node with the largest transverse coordinates is the target location of the node. The target perception direction of the directed node is determined by the initial perceptual direction of the moving node moving to that position. If 0 鈮，

本文编号：1635345