K覆盖保证的异构传感器网络节点调度设计

Design for Sensor Node Scheduling in Heterogeneous Wireless Sensor Network Based on K-Coverage Guarantee

为了提高某些关键区域的监测质量,往往需要对这些区域进行多重覆盖,为此,设计了一种适用于异构型传感器网络的节点调度方法;首先,建立了网络的系统模型并以最大化分组数为优化目标,然后描述了节点调度的具体过程,即首先节点通过邻居信息交换获得邻居信息,然后对自身的冗余性进行判断,从而确定工作节点分组,最后对工作节点分组集合中的分组进行调度,在调度过程中,为了均衡节点能耗,考虑了平均剩余能量因素;仿真实验表明:文中方法能正确地实现异构传感器网络监测区域的节点调度,保证网络区域的完全覆盖,且在运行到40轮时,还有18个节点存活,具有较长的网络生命周期。

In order to improve the quality of some monitoring area, the area usually needing to be covered multiply, therefore, a node scheduling method for heterogeneous sensor network was proposed. Firstly, the system model was set and the maximum subsets was regar-ded as the optimal goal, then the specific process for sensor node scheduling was described, such as the node was exchanged the information with the neighbor nodes and justified its redundancy, and then the working node subsets can be determined, finally the subset can be sched- uled, and for balance the node energy consumption, in the process of scheduling, the average remain energy for node subset was considered. The simulation experiment shows the method in this paper can realize node scheduling in heterogeneous wireless sensor network and guaran-tee the full coverage for network area, and there is still 18 nodes when it was 40^th wheel, therefore, it has longer network life cycle.