Improving coverage and connectivity in mobile sensor networks using harmony search

Dynamic deployment aims at enhancing coverage in wireless sensor networks by redistributing sensor nodes after initial random deployment. In this paper, a harmony search based dynamic deployment (HS-DD) technique is proposed that aims at maximizing both network coverage and connectivity. Furthermore, the performance of the proposed algorithm and a number of the HS-variants in dynamic deployment is studied; namely: Harmony Search-Dynamic Deployment (HS-DD), Improved HS-Dynamic Deployment (IHS-DD), Global HS-Dynamic Deployment (GHS-DD), Differential HS-Dynamic Deployment (DHS-DD) and Self adaptive HS-Dynamic Deployment (SaHS-DH). Simulation results show that GHS-DD achieves the best coverage improvement with the minimum moving distance, while SaHS-DD provides better connectivity with reasonable coverage improvement for dense networks.