Increasing the Coverage of Homogeneous Wireless Sensor Network by Genetic Algorithm Based Deployment

As a consequence of advances in wireless communication, digital systems and micro-electronic-mechanical system technologies, wireless sensor networks (WSNs) have been developed and applied in lots of different real-world applications. Especially; military, industrial, environmental and health WSN applications have critical roles in daily life. WSNs consist of small and resource limited sensor nodes. Due to their limited resources and constraints, developers of WSNs face with several problems. Such as energy consumption, node deployment, data aggregation and data transmission. Node deployment affects other problem domains directly or indirectly. Therefore, in this study, node deployment problem is dealt with. Also, coverage area of WSN system with an organized deployment approach is tried to be increased. This problem is known as maximum coverage sensor deployment problem (MCSDP) and NP-hard. As a result of this, a genetic algorithm proposed for increasing the coverage of given WSN topology with homogeneous sensors in a 2-D Euclidean area. The paper organized as follow: firstly, related works in literature are explained briefly. Then, node deployment problem formulated, proposed algorithm described, deeply. Finally, results of conducted experiments with the proposed genetic algorithm are represented and discussed. The results explicitly showed that the proposed approach produces better coverage than initial deployment.