title: An efficient genetic algorithm for maximum coverage deployment in wireless sensor networks.
abstract: 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.
authors.forename: Yourim
authors.initials: Y
authors.lastname: Yoon
authors.forename: Yong-Hyuk
authors.initials: YH
authors.lastname: Kim
mesh_terms: D000465:Algorithms; D003195:Computer Communication Networks; D003198:Computer Simulation; D015233:Models, Statistical; D012815:Signal Processing, Computer-Assisted; D013686:Telemetry / Q000295:instrumentation / Q000379:methods*; D014159:Transducers; D059015:Wireless Technology