Cart (Loading....) | Create Account
Close category search window
 

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

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:

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

Date of Conference:

27-29 June 2011

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.