Study on Connected Target Coverage Algorithm for Wireless Sensor Network

Abstract

Aiming at the serious effect of coverage hole caused by the poor deployment environment and the limited energy of wireless sensor network (WSN) on network lifetime, an optimized and lightweight energy-efficient connected coverage heuristic (OECCH) algorithm is proposed. Armed with the analysis of the coverage contribution, the sensor nodes are categorized into sensing nodes and relay nodes. Then, an intersection connected cover set is constructed based on the heuristic values, and the network lifetime is maximized in combination with energy update and coverage recovery. Simulation results indicate that OECCH can prolong the network lifetime while reducing the computation overhead of WSN obviously.

Keywords

• Connected target coverage
• coverage/connectivity heuristic
• network lifetime
• wireless sensor network