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

Author

Zhu, Chunsheng ; Yang, Laurence T. ; Shu, Lei ; Wang, Lei ; Hara, Takahiro

Author_Institution

Dept. of Comput. Sci., St. Francis Xavier Univ., Antigonish, NS, Canada

fYear

2011

fDate

27-30 June 2011

Firstpage

158

Lastpage

160

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).

Keywords

scheduling; telecommunication network routing; wireless sensor networks; duty-cycled sensor networks; geographic distance based connected-k neighborhood algorithm; geographic routing; mobile sink; sleep scheduling; transmission paths; two-phase geographic greedy forwarding; Ad hoc networks; Algorithm design and analysis; Copper; Mobile communication; Mobile computing; Routing; Wireless sensor networks; CKN; Duty-Cycle; Geographic Routing; Mobile Sink; TPGF; WSNs;

fLanguage

English

Publisher

ieee

Conference_Titel

Sensor, Mesh and Ad Hoc Communications and Networks (SECON), 2011 8th Annual IEEE Communications Society Conference on

Conference_Location

Salt Lake City, UT

ISSN

2155-5486

Print_ISBN

978-1-4577-0094-1

Type

conf

DOI

10.1109/SAHCN.2011.5984890

Filename

5984890