面向不同目标覆盖要求的异构有向传感器网络节点调度算法

Node Scheduling Algorithm for Priority-based Target Coverage in Heterogeneous Directional Sensor Networks

针对给定部署区域中不同的监测目标有不同的覆盖需求和现有的调度算法大多针对同构有向传感器节点忽略了节点异构对调度性能的影响的问题,提出两种异构有向传感器网络节点调度策略。一种方法是通过对问题进行数学建模,将节点调度问题转化为目标优化问题,采用改进的和声搜索算法进行求解。改进和声搜索算法针对原始和声搜索在陷入局部最优时的过早收敛问题,通过将和声搜索算法和模拟退火算法结合增强其局部搜索能力。另一种方法采用贪婪算法求解满足条件的节点集合。仿真结果显示,与原始和声搜索算法相比,改进和声搜索算法能有效提高网络的工作时间,证明了改进算法的有效性。

Two node scheduling strategies for heterogeneous directional sensor networks are proposed to solve the heterogeneous coverage requirements of the targets in the deployed area.The characteristic of node heterogeneity and heterogeneous coverage re⁃quirements of the targets have great impacts on performance of scheduling algorithm,which are neglected by most of the existing re⁃search.One of the proposed algorithms formulate the scheduling problem as an objective optimization problem and improved har⁃mony search algorithm(shortly for IHS)is utilized to address such scheduling problem.The IHS hybrid harmony search algorithm and simulated annealing algorithm to address the premature convergence problem especially when one or more initial harmonies are in the vicinity of local optimal.The other proposed algorithm is based on greedy algorithm to construct as more cover set as pos⁃sible.Simulation results shows that the proposed IHS achieves better performance than the primitive harmony algorithm(shortly for HS),which proves the effectiveness of the proposed algorithm.