A Geographic Routing Oriented Sleep Scheduling Algorithm in Duty-Cycled Mobile Sensor Networks

Abstract

Newly, the research center on geographic routing, a capable routing scheme in wireless (Mobile) sensor networks (WSNs), is changing in the direction of duty-cycled WSNs in which sensors are sleep scheduled to reduce energy consumption. However, distant from the connected-k neighborhood (CKN) sleep scheduling algorithm and the geographic routing slanting sleep scheduling (GSS) algorithm, nearly all study work about geographic routing in dutycycled WSNs has alert on the geographic forwarding mechanism; further, most of the nearby work has unnoticed the fact that sensors can be mobile. In this paper, we spotlight on sleep scheduling for geographic routing in duty-cycled WSNs with mobile sensors and recommend two geographic-distance-based related-k neighborhood (GCKN) sleep scheduling algorithms. The first one is the geographic-distance-based connected-k-neighborhood for first path (GCKNF) sleep scheduling algorithm. The second one is the geographic-distance-based connected-k-neighborhood for all paths (GCKNA) sleep scheduling algorithm. By abstract analysis and simulations, we express that when there are mobile sensors, geographic routing can realize shorter average lengths for the first transmission path explored in WSNs employing GCKNF sleep scheduling and all transmission paths searched in WSNs employing GCKNA sleep scheduling compared with those in WSNs employing CKN and GSS sleep scheduling. finally we evaluate different routing protocol with accessible scenario.