视角受限传感器网络强栅栏覆盖判定算法

摘要

栅栏覆盖研究如何分配网络时空资源来确保移动目标穿越监控区域时被监测.本文通过视角受限节点传感方向的调整,设计一种分布式算法以判定网络能否提供强栅栏覆盖.算法主要思想是利用节点及邻居节点的物理位置关系构建强/弱栅栏对.另外,本文设计贪心策略优先选择邻居节点数多的候选节点构建强栅栏路径.仿真实验证明:本算法可以较小代价判定并改善网络强栅栏覆盖性能.%Barrier coverage focuses on how to assign space-time resource to detect the intruders that attempt to cross the network. By resetting the sensing orientations of directional field of view sensors,we propose a distributed algorithm to detect whether a given sensor network can provide strong barrier coverage or not. The basic idea is defining strong/weak barrier pair by sensor neighbors' position information. Moreover, we design a greedy algorithm with priority to select candidate node(s) with the maximum number of neighbor nodes in order to build up the strong barrier path. Experimental data testify that our algorithm can effectively detect in order and improve strong barrier coverage for a directional field of view sensor network with small cost.