一种分布式的1-栅栏覆盖构建算法

摘要

在构建栅栏覆盖的过程中,需要考虑网络构建成本和生存时间这两个核心问题.对于前者主要考虑节点数和信息传输量,而对于后者则应避免网络因个别节点的死亡而陷入瘫痪.该文针对上述两个问题,提出一种基于1-栅栏覆盖的分布式栅栏覆盖算法(Distributed Barrier Coverage Algorithm,DBCA),算法通过聚类分簇和簇内路径选择这两个过程来实现覆盖.理论分析和仿真结果表明,该文所提出的算法能够有效减少网络部署的节点数以及传输的信息量.在部署节点达到700时,该算法比最优节点选择算法(Optimal Node Selection Algorithm,ONSA)和本地栅栏覆盖协议(Localized Barrier Coverage Protocol,LBCP)算法传输的信息量分别减少25%和41.6%,生存时间分别多44%和30%.%The constructing cost and lifetime are two core problems when constructing a barrier coverage of Wireless Sensor Network (WSN). For the former, the amount of nodes and information transferred are considered very much. And the WSN shutdown Caused by just for some specific nodes died should be avoided. This paper proposes an algorithm named Distributed Barrier Coverage Algorithm (DBCA) to construct a distributed 1-barrier coverage by using k-HOP clustering and path planning. Theory analysis and simulation results show that the algorithm can reduce the number of nodes and information transferred effectively. When the deployed nodes reach the number of 700, it performs better than Optimal Node Selection Algorithm (ONSA) and Localized Barrier Coverage Protocol (LBCP) algorithm in reducing transferring information with 25% and 41.6%, and in prolonging lifetime with 44% and 30%.