The presence of coverage holes in a wireless sensor network has severe consequences on the performance of the network, that affects coverage, connectivity and routing paths. A number of approaches had been proposed to heal coverage holes in WSN. However, these approaches had tried to reach a full coverage, but ignored the large overlapping coverage area created. This paper presents a Healing Algorithm of Coverage Hole (HACH) involving the existing nodes to cover the hole. Our algorithm satisfies a full coverage while minimizing the overlapped area of sensing disks and deploying a minimum number of nodes. Experimental results which confirm the effectiveness of our approach are presented.