Area Coverage Optimization in Wireless Sensor Network by Semi-random Deployment

Abstract

Area Coverage is a difficult problem to solve with a minimum number of sensor nodes for maximum time duration, especially in wide areas. Among the solutions proposed for this problem there is the deployment with its two types random and deterministic. The disadvantages of deterministic deployment are configured in the Area of Interest (AoI) limitation, and random deployment is configured in the non-equitable distribution of sensor nodes on AoI. This problem affects power consumption and connectivity; as a result, it affects the coverage of the area of interest. In this paper we have proposed a third type of hybrid deployment that gathers the advantages and minimizes the disadvantage of the application of the random deployment and deterministic deployment. This type has two steps; the anticipate configuration step and the scheduling process step. A comparative study was done to show the effectiveness of this type to optimize coverage in the vast area of interest less danger and more interests.