By Topic

Sleep scheduling towards geographic routing in duty-cycled sensor networks

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
$33 $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 ; Department of Computer Science, St. Francis Xavier University, Canada ; Laurence T. Yang ; Lei Shut ; Joel J. P. C. Rodrigues
more authors

This paper focuses on improving the geographic routing performance of the two-phase geographic greedy forwarding (TPGF) in duty-cycled wireless sensor networks (WSNs) and proposes a geographic routing oriented sleep scheduling (GSS) algorithm. The algorithm analysis and simulation results show that GSS can shorten the length of the first explored transmission path of TPGF, compared with the connected-k neighborhood (CKN) algorithm.

Published in:

2011 International Conference on Distributed Computing in Sensor Systems and Workshops (DCOSS)

Date of Conference:

27-29 June 2011