返回
An Efficient Genetic Algorithm for Maximum Coverage Deployment in Wireless Sensor Networks
DOI:10.1109/TCYB.2013.2250955.png)
摘要
En 中文
Sensor networks have a lot of applications such as battlefield surveillance, environmental monitoring, and industrial diagnostics. Coverage is one of the most important performance metrics for sensor networks since it reflects how well a sensor field is monitored. In this paper, we introduce the maximum coverage deployment problem in wireless sensor networks and analyze the properties of the problem and its solution space. Random deployment is the simplest way to deploy sensor nodes but may cause unbalanced deployment and therefore, we need a more intelligent way for sensor deployment. We found that the phenotype space of the problem is a quotient space of the genotype space in a mathematical view. Based on this property, we propose an efficient genetic algorithm using a novel normalization method. A Monte Carlo method is adopted to design an efficient evaluation function, and its computation time is decreased without loss of solution quality using a method that starts from a small number of random samples and gradually increases the number for subsequent generations. The proposed genetic algorithms could be further improved by combining with a well-designed local search. The performance of the proposed genetic algorithm is shown by a comparative experimental study. When compared with random deployment and existing methods, our genetic algorithm was not only about twice faster, but also showed significant performance improvement in quality.
Keyword:
Genetic algorithm
maximum coverage
sensor deployment
solution space
期刊
IF:
10.5
论文数:
1.1W
被引数:
5.0W
机构
引用论文
Role of Dexmedetomidine for the Prevention and Treatment of Delirium in Intensive Care Unit Patients
Stabilization of immiscible polymer blends using structure directing metal organic frameworks (MOFs)
Polymer
IF0
An incremental self-deployment algorithm for mobile sensor networks一种移动传感器网络增量式自部署算法
AUTONOMOUS ROBOTS
IF4.3

