Coverage maximization in mobile Wireless Sensor Networks utilizing immune node deployment algorithm

A Wireless Sensor Network (WSN) consists of spatially distributed autonomous sensors with sensing, computation and wireless communication capabilities. Each sensor generally has the task to monitor, measure ambient conditions, and disseminate the collected data towards a base station. One of the key points in the design stage of a WSN that is related to the sensing attribute is the coverage of the sensing field. The coverage issue in WSNs depends on many factors, such as the network topology, sensor sensing model, and the most important one is the deployment strategy. The sensor nodes can be deployed either deterministically or randomly. Random deployment of the sensor nodes can cause coverage holes formulation; therefore, in most cases, random deployment is not guaranteed to be efficient for achieving the required coverage. In this case, the mobility feature of the nodes can be utilized in order to maximize the coverage. This is Non-deterministic Polynomial-time hard (NP-hard) problem. So in this paper, the Immune Algorithm (IA) is used to relocate the mobile sensor nodes after the initial configuration to maximize the coverage area with the moving dissipated energy minimized. The performance of the proposed algorithm is compared with the previous algorithms using Matlab simulation. Simulation results show that the proposed algorithm improves the network coverage and the redundant covered area with minimum moving consumption energy.