By Topic

Maximization for wireless sensor network lifetime with power efficient cover set alternation

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)
Jie Jia ; School of Information Science and Engineering, Northeastern University, Shenyang, China, 110004 ; Jian Chen ; Guiran Chang ; Cuihua Tian
more authors

One of the most critical issues in wireless sensor network is represented by the limited availability of energy on sensor nodes. In this paper, we propose the power efficient organization of k-separate cover sets as a backbone to maximum network lifetime. All the sensors are divided into K-separate sets on the basis of multi-objective genetic algorithm, guaranteeing each cover set is pareto optimal. By alternating subsets of sensor nodes and using only one at each round, redundancy elimination can contribute to reduce energy consumption. The algorithm is evaluated via a simulation study. Clearly, by solving the optimization model, a network designer can gain useful insights into the possible gains in term of network lifetime.

Published in:

Communications, Circuits and Systems, 2008. ICCCAS 2008. International Conference on

Date of Conference:

25-27 May 2008