ABSTRACT
Due to their diverse applicability, sensor networks have gained major research attention these days. However, the design and implementation of sensor networks is also prone to several challenges such as energy efficiency, routing, security, and coverage. Coverage is usually defined as a quality criterion, which ensures the monitoring capability for the target region. Assuring coverage to a predefined set of targets with the desired confidence level such that network lifetime is maximized is known as the target coverage problem. Scheduling the nodes to remain in active or sleep mode is an efficient mechanism to ensure the coverage as well as network lifetime maximization. Also, the researchers have proposed a node scheduling strategy which schedules the node to include in a set cover such that all the targets are monitored for the maximum possible time by using the concept of probabilistic coverage detection, trust values of the nodes, and the contribution of nodes toward the coverage. This chapter aims to enhance the efficiency of the node scheduling protocol by introducing the concept of priority of the nodes in determination of set covers. The network lifetime in this approach is determined as the summation of the operational time of the set covers. The operational time of each set cover is determined on the basis of the priority of the nodes. The priority of the nodes is determined as the targets being monitored by that node divided by the total nodes which can monitor the target. The efficiency of the proposed approach is evaluated for varying numbers of sensors, targets, and operational time.
