Sleep scheduling towards geographic routing in duty-cycled sensor networks with a mobile sink

Abstract

Focusing on achieving better geographic routing performance of the two-phase geographic greedy forwarding (TPGF) in duty-cycled wireless sensor networks (WSNs) when there is a mobile sink, this paper proposes a geographic distance based connected-k neighborhood (GCKN) algorithm. The algorithm analysis and simulation results show that GCKN can obtain shorter length of the transmission paths explored by TPGF in duty-cycled mobile sink WSNs, compared with the original connected-k neighborhood (CKN).