【摘要】 为解决异构静态传感节点部署和失效引起的覆盖盲区问题,提出一种优化网络生存时间的移动传感节点覆盖调度算法(coverage scheduling algorithm,CSA)。CSA考虑静态传感节点的感知半径异构,根据周围邻居传感节点信息计算移动传感节点的停留位置。根据静态传感节点上报的位置,建立覆盖调度模型,并采用启发式求解方法求解调度模型,获得移动传感节点的停留位置较优方案。仿真结果表明:CSA可提高区域覆盖率和静态传感节点存活个数,提高网络生存时间和降低平均静态传感节点能耗。在一定的条件下,CSA比Mno、MNode和MGrid等算法性能更优。更多还原

【Abstract】 In order to solve the coverage blind problem caused by deployment and failure of heterogeneous static sensor nodes, a coverage scheduling algorithm of mobile sensor nodes for optimizing network lifetime(CSA) was proposed. CSA considerd heterogeneous perceived radius of static sensor nodes and calculates the location of mobile sensor nodes based on the information of neighbor static sensor nodes. According to the location reported by static sensor nodes, coverage scheduling model was established. Heuristic solution method was proposed, to solve the scheduling model, and optimal location of mobile sensor nodes was obtained. The simulation results show that CSA can improve regional coverage and the number of survival static sensor nodes, improve network lifetime and reduce energy consumption of average static sensor nodes. Under certain conditions, CSA is better than Mno, MNode and MGrid algorithms.更多还原