Differential Evolution for Lifetime Maximization of Heterogeneous Wireless Sensor NetworksReport as inadecuate




Differential Evolution for Lifetime Maximization of Heterogeneous Wireless Sensor Networks - Download this document for free, or read online. Document in PDF available to download.

Mathematical Problems in EngineeringVolume 2013 2013, Article ID 172783, 12 pages

Research Article

College of Information and Technology, DongHua University, Shanghai 201620, China

Institute of Information and Technology, Henan University of Traditional Chinese Medicine, Zhengzhou 450003, China

Office of Putuo District, Ganquan Road Subdistrict, Shanghai 200065, China

Received 9 January 2013; Revised 1 February 2013; Accepted 12 February 2013

Academic Editor: Yang Tang

Copyright © 2013 Yulong Xu et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Abstract

Maximizing the lifetime of wireless sensor networks WSNs is a hot and significant issue. However, using differential evolution DE to research this problem has not appeared so far. This paper proposes a DE-based approach that can maximize the lifetime of WSN through finding the largest number of disjoint sets of sensors, with every set being able to completely cover the target. Different from other methods in the literature, firstly we introduce a common method to generate test data set and then propose an algorithm using differential evolution to solve disjoint set covers DEDSC problems. The proposed algorithm includes a recombining operation, which performs after initialization and guarantees at least one critical target’s sensor is divided into different disjoint sets. Moreover, the fitness computation in DEDSC contains both the number of complete cover subsets and the coverage percent of incomplete cover subsets. Applications for sensing a number of target points, named point-coverage, have been used for evaluating the effectiveness of algorithm. Results show that the proposed algorithm DEDSC is promising and simple; its performance outperforms or is similar to other existing excellent approaches in both optimization speed and solution quality.





Author: Yulong Xu, Jian’an Fang, Wu Zhu, and Wenxia Cui

Source: https://www.hindawi.com/



DOWNLOAD PDF




Related documents