Target coverage computation protocols in wireless sensor networks: a comprehensive review

Abstract

Wireless sensor network comprises tiny sensor nodes having the ability of sensing to surveil an area of interest. The amount of area sensed by a sensor node is known as coverage. Coverage is a multi-dimensional quality of service (QoS) metric in terms of diversity in its computation algorithms according to the real-time applications. Different applications require a distinctive level of coverage. But every coverage computation algorithm has one common objective, i.e. to maximize the network’s lifespan and coverage quality with minimum number of sensor nodes. Several algorithms have derived optimal or close-to-optimal solutions based on similar or distinct parameters. This paper presents a concise review of various target coverage protocols for both static and mobile targets. Total target coverage provided by the deployed sensor nodes is a measure of sensing quality. Target coverage is bifurcated as static coverage and dynamic coverage. This paper highlights and describes various application specific target coverage protocols and their QoS metrics and parameters. Each protocol has solved multi-dimensional coverage issues and challenges and proposed optimum solutions. The comprehensive review of the target coverage protocol helps in understanding about various research challenges and its existed solutions in target coverage, detection and tracking in a better way.