By Topic

A balanced energy consumption sleep scheduling algorithm in 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

5 Author(s)
Zhuxiu Yuan ; Sch. of Software, Dalian Univ. of Technol., Dalian, China ; Lei Wang ; Lei Shu ; Hara, T.
more authors

Network lifetime is one of the most critical issues for wireless sensor networks (WSNs) since most sensors are equipped with non-rechargeable batteries with limited energy. To prolong the lifetime of a WSN, one common approach is to dynamically schedule sensors' active/sleep cycles (i.e., duty cycles) with sleep scheduling algorithm. In this paper, we propose a new sleep scheduling algorithm, named EC-CKN (Energy Consumed uniformly-Connected K-Neighborhood) algorithm, to prolong the network lifetime. The algorithm EC-CKN, which takes the nodes' residual energy information as the parameter to decide whether a node to be active or sleep, not only can achieve the k-connected neighborhoods problem, but also can assure the k awake neighbor nodes have more residual energy than other neighbor nodes at the current epoch. Based on the algorithm EC-CKN, we can obtain the state transition probability at the n'th epoch, and upper bound and lower bound of the network lifetime by Markov chain and Markov decision chain.

Published in:

Wireless Communications and Mobile Computing Conference (IWCMC), 2011 7th International

Date of Conference:

4-8 July 2011