By Topic

Hybrid Genetic Algorithm Using a Forward Encoding Scheme for Lifetime Maximization 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
$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

7 Author(s)
Xiao-Min Hu ; Department of Computer Science, Sun Yat-Sen University, Guangzhou, China ; Jun Zhang ; Yan Yu ; Henry Shu-Hung Chung
more authors

Maximizing the lifetime of a sensor network by scheduling operations of sensors is an effective way to construct energy efficient wireless sensor networks. After the random deployment of sensors in the target area, the problem of finding the largest number of disjoint sets of sensors, with every set being able to completely cover the target area, is nondeterministic polynomial-complete. This paper proposes a hybrid approach of combining a genetic algorithm with schedule transition operations, termed STHGA, to address this problem. Different from other methods in the literature, STHGA adopts a forward encoding scheme for chromosomes in the population and uses some effective genetic and sensor schedule transition operations. The novelty of the forward encoding scheme is that the maximum gene value of each chromosome is increased consistently with the solution quality, which relates to the number of disjoint complete cover sets. By exerting the restriction on chromosomes, the forward encoding scheme reflects the structural features of feasible schedules of sensors and provides guidance for further advancement. Complying with the encoding requirements, genetic operations and schedule transition operations in STHGA cooperate to change the incomplete cover set into a complete one, while the other sets still maintain complete coverage through the schedule of redundant sensors in the sets. Applications for sensing a number of target points, termed point-coverage, and for the whole area, termed area-coverage, have been used for evaluating the effectiveness of STHGA. Besides the number of sensors and sensors' sensing ranges, the influence of sensors' redundancy on the performance of STHGA has also been analyzed. Results show that the proposed algorithm is promising and outperforms the other existing approaches by both optimization speed and solution quality.

Published in:

IEEE Transactions on Evolutionary Computation  (Volume:14 ,  Issue: 5 )