Movement minimization of randomly deployed mobile nodes for complete coverage and connectivity

Technological advancement in sensors, communication, processing and associated circuitry made wireless sensor network (WSN) a reality. The performance of WSN is driven by two important parameters, coverage and connectivity. The sensing range of sensor defines coverage where as the communication range defines the connectivity. The random deployment of sensors as in most of the applications like military, hostile environment etc., made coverage a prime area for research. In most of the WSN applications, communication range is taken as greater than or equal to twice of the sensing radius. This ensures connectivity once coverage is achieved. Static node deployment for coverage demands high node density of the order NlogN for large networks. In this paper a study of mobile node deployment and three algorithms viz., Grid point based minimization, sensor location based minimization and hybrid minimization were proposed for movement minimization, and their performance is compared.