By Topic

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

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

5 Author(s)
Chunsheng Zhu ; Dept. of Comput. Sci., St. Francis Xavier Univ., Antigonish, NS, Canada ; Yang, L.T. ; Lei Shu ; Lei Wang
more authors

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

Published in:

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

Date of Conference:

27-30 June 2011