Abstract: 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.

Key words: Wireless Sensor Network(WSN), coverage, redundancy, sensing radius

CLC Number: 

• TP393