无线传感器网络中的覆盖优化算法研究

Research on Coverage Optimization Algorithm in WSN

针对无线传感器网络中经典的覆盖保持节点调度算法(CPNSS)查找冗余节点效率不高的问题,考虑实际传感器网络中节点感应半径不相同的情况,提出一种推广的高效覆盖优化算法(GECPNSS)。建立扩展节点网络模型,分析多种节点位置关系,对中心角计算法进行扩展改进,并从活动节点数、平均覆盖度方面比较算法的性能。仿真实验结果表明,在保持初始覆盖的前提下,GECPNSS能更有效地提高冗余节点判定效率、扩展算法适应面。

Aiming at the problems of low efficiency to find redundant nodes in classical Coverage-Preserving Node Scheduling Scheme（CPNSS） of the Wireless Sensor Network（WSN）, this paper considers the situation that nodes have different sensing ranges in actual network and proposes a Generalized Efficient Coverage-Preserving Node Scheduling Scheme（GECPNSS）. The algorithm builds extended node network model, analyzes different cases that how the nodes and their neighbors are located and improves the central angle calculation. The performances of these algorithms are compared in terms of number of active nodes and average cover degree. Simulation experimental results show that this improved algorithm enhances the efficiency of redundant nodes determine more effectively and better adapts to the complexity of the network, while maintaining the initial coverage.