Wireless sensor networks have wide range of applications. The major constraint in such application lies in the limitation of energy resource. The sensors are often equipped with tiny and irreplaceable batteries. It arise the need of energy efficient routing algorithms to prolong the network lifetime. This project mainly focuses on sleep scheduling for geographic routing in duty-cycled WSNs with mobile sensors by using geographic-distance-based connected-k neighborhood (GCKN) sleep scheduling algorithms. It ensures that coverage rotates such every purpose within the surroundings is perceived at intervals some default interval of your time, referred to as the detection delay. The structure is optimized for rare event detection and permits favorable compromises to be achieved between event detection delays and eventual coverage for every purpose. The cluster activation protocol makes sure that the foremost potential clusters activated to perform target pursuit, reducing consumed energy throughout the hand-off operation. The experimental results show that when there are mobile sensors, geographic routing can achieve much shorter average lengths for all paths using GCKN sleep scheduling compared with those in WSNs employing CKN and GSS sleep scheduling.