针对传统的有向传感器网络目标覆盖算法只考虑网络覆盖率而不能保证网络连通性的问题,利用目标点部署圆内覆盖最多邻居目标点的候选节点集合和整数线性规划(ILP)模型设计了一种面向目标的连通覆盖算法(CTA)。该算法通过建立目标部署圆内覆盖最多邻居目标点的候选节点集合对随机部署的节点进行初步调度,在此基础上,通过ILP模型找出实现目标检测,并保证整个网络连通性的最少节点数和最佳位置的节点集合。仿真实验表明:CTA在保证目标覆盖率的前提下,不仅极大地降低了网络部署成本,而且保证了网络连通性。
Traditional coverage algorithms for directional sensor network only consider coverage, but can' t guarantee the connectivity. In view of this deficiency, a connective target-coverage algorithm (CTA) is proposed by using the maximum multi-overlapping domains of neighbor target points and the integer linear programming (ILP) formulation. Candidate position sets are calculated using the concept of covering maximum targets within deployment-circle, f~en the ILP formulation is used to find the optimal positions of these nodes from the candidate position sets on the basis of meeting users' demand and connectivity. Simulation results show that CTA can greatly reduce network deployment costs and ensure network ' s connectivity on the premise that coverage is guaranteed.