Sensing and coverage are the two most relevant tasks for a sensor network. Wireless sensor network performance entirely depends on the success of sensing and detecting any object over a monitored region. Network performance may always degrade due to t...
Sensing and coverage are the two most relevant tasks for a sensor network. Wireless sensor network performance entirely depends on the success of sensing and detecting any object over a monitored region. Network performance may always degrade due to the limited energy and computation capability of sensors. So, it is a crucial task to identify those humiliations of sensors in a network. Exposure path is a probabilistic concept and it determines the probability of detecting any object by the sensors. In this paper we proposed a new algorithm to find out the minimum exposure path in a particular region of the network. It is totally a graph-theory as well as a convex geometry based approach. In order to improve the network performance the minimum exposure path algorithm of this paper can perform an appreciable role. Moreover the use of closest sensor of a cluster makes the overall computation less expensive for the proposed algorithm. Finally, we analyzed the proposed algorithm with some numerical simulation in order to obtain an approximate minimum exposure path.