Skip to Main Content
Wireless sensor network has the two major tasks: sensing & detecting of any event over a sensing region. Quality of network coverage entirely depends upon the success of these tasks. Network coverage can be degraded after sensor deployment due to sensor's finite energy. So, it is a decisive task to identify those regions of a network where further deployment of sensor is required to improve the quality of network coverage. Exposure is a probabilistic concept and it determines the probability of detecting any event by the sensors. In this paper we proposed a new approach to find out least covered regions in a sensor network where further sensor deployment is desirable. This approach used some graph-theory based algorithm. In order to improve the network coverage the proposed technique of this paper gives a noticeable performance. The experimental output of the proposed approach is a satisfied one for the improvement quality of network coverage. Moreover in case of sensing or detecting, use of closest sensor of a cluster to a particular point of event makes the overall computation less expensive for the proposed technique.