By Topic

Hops-based Sleep Scheduling Algorithm for Enhancing Lifetime of 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

4 Author(s)
Yun Wang ; Dept. of Electr. & Comput. Eng. & Comput. Sci., Cincinnati Univ., OH ; Demin Wang ; Weihuang Fu ; Agrawal, D.P.

In this paper, we study the node sleep scheduling scheme in the commonly used static disk model for sensor networks, where homogenous sensors are uniformly distributed in a circular area with a stationary sink located at the center. Then, we introduce and analyze a hops-based sleeping scheduling algorithm (HSS) for enhancing the lifetime and energy efficiency of the sensor networks. The HSS divides the circular sensor network into several levels according to the average hop distance based on certain network parameters. By assigning hops-based sleeping probabilities to each sensor, and the network lifetime as well as energy efficiency can be greatly improved. Simulations are performed to compare our proposed HSS scheme with the traditional randomized sleeping scheduling (RSS) scheme, where all the nodes have the uniform sleeping probability. The results demonstrate that our HSS scheme can enhance network lifetime greatly, provide desired QoS requirement effectively, and drastically outperform the RSS scheme

Published in:

Mobile Adhoc and Sensor Systems (MASS), 2006 IEEE International Conference on

Date of Conference:

Oct. 2006