By Topic

A Distributed Coverage-Aware Sleep Scheduling Algorithm for Wireless 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

3 Author(s)
Fangyang Shen ; Dept. of CET, Northern New Mexico Coll., Espanola, NM ; Chunlei Liu ; Jun Zhang

While wireless sensor networks have important applications in many fields, the limited battery life and high deployment cost pose serious challenges. One way to maintain good coverage and extend the network lifetime is to deploy sensors in high density and schedule them to sleep between active cycles. In this paper, we propose an algorithm to schedule the sensors to sleep based on the area of overlapped coverage by neighboring sensors. We study the performance of this algorithm with a heuristic test point method, then present a distributed method that can be used in actual implementation. Simulations results show that this algorithm achieves better performance in lifetime and coverage than other algorithms.

Published in:

Information Technology: New Generations, 2009. ITNG '09. Sixth International Conference on

Date of Conference:

27-29 April 2009