None-Distributed Mobility Assisted Sensor Deployment Algorithm in Wireless Sensor Networks

Abstract:

Sensor nodes are deployed in oreder to observe the surrounding environment for some phenomena of interest in wireless sensor networks. The problem with observing such environments is covering entire area which reflects how well a region is monitored. The random distribution of sensor nodes caused by none-uniform deployment leads to coverage holes in the network. In order to eliminate or reduce the coverage holes, mobile sensors are utilized to enhance the area coverage. The movement of a mobile sensor from one location to another is energy consuming. To address such problems, a none-distributed deployment algorithm is proposed. In current none-distributed or centralized movement algorithms, all the deployed sensor nodes are moved randomly to different unspecified locations within the monitoring field. This random movement leads to poor area coverage and higher energy consumption. A K–Mean Clustering (KMC) algorithm is used to enhance the area coverage with minimum mobility energy consumption in a none-distributed network is proposed. The KMC algorithm is based on K-Mean clustering and Voronoi Diagram for calculating area coverage. KMC has enhanced the area coverage and energy consumption by 10.29% and 15.99% respectively. Thus, the result shows that algorithm proposed has increased area coverage with quicker convergence rate and least mobility energy depletion.

Keyword: Wireless sensor networks, coverage, none-distributed, mobility, deployment, voronoi diagram