In the heterogeneous network, energy exhausted sensor nodes may uncover some parts of the sensing field, resulting in the coverage hole. The substitution of energy exhausted sensors is complex and has a greater effect on coverage and path from source to sink node. Therefore, in order to provide the required coverage and path, Candidate Generation Algorithm is proposed using mobility management of sensors. A sensor with low energy sends a message requesting other sensors in the network to replace it before it gets energy exhausted entirely. The sensor of Null polygon goes to energy exhausted node in order to heal coverage hole. This is based on VorLag algorithm and considers Null Polygon sensors, along with sensors of Empty Polygon, to ensure maximum coverage over the network. Candidate Generation algorithm detects and repairs the coverage hole quickly and ensures continuous monitoring. Path is selected based on hop count and path length. Simulated results show that the work proposed gives greater coverage profit with minimum sensor’s movement
