In Wireless Sensor Networks (WSN), sensors form the network dynamically without help of any infrastructure. The accidental death of the nodes due to technical failures or death due to power exhaustion may disturb the existing coverage and connectivity of the network. In this paper, distributed coverage hole recovery algorithms for the wireless sensor networks are designed that use the vector methods to decide the magnitude and direction of the mobile nodes. In the post deployment scenario, coverage holes of the network are repaired by moving the nodes in a self organized manner. To minimize the energy consumption of the nodes due to mobility, algorithms are designed in such a way that the mobility is limited within only one-hop of the nodes and highest coverage (k-coverage) of a node is not increased after its mobility. Performance evaluation of the proposed algorithms show that cent percent of coverage recovery could be possible by moving the nodes within their communication range. Besides, the average mobility distance of the nodes is very small to recover the coverage holes by our algorithms.