Harmony Search Algorithm for Solving m Connected Coverage Problem in WSN
Sudesh Sharma1, Sarvesh Kumar2, Chandra Prakash Verma3, Hemat Gaur4
1Sudesh Sharma, Assistant Professor, Poddar International College, Jaipur (Rajasthan), India.
2Sarvesh Kumar, Assistant Professor, Jayoti Vidyapeeth Women’s University, Jaipur (Rajasthan), India.
3Chandra Prakash Verma, Assistant Professor, Jayoti Vidyapeeth Women’s University, Jaipur (Rajasthan), India.
4Hemant Gaur, Assistant Professor, Jayoti Vidyapeeth Women’s University, Jaipur (Rajasthan), India.
Manuscript received on 08 February 2019 | Revised Manuscript received on 21 February 2019 | Manuscript Published on 04 March 2019 | PP: 393-396 | Volume-7 Issue-5S2 January 2019 | Retrieval Number: ES2071017519/19©BEIESP
Open Access | Editorial and Publishing Policies | Cite | Mendeley | Indexing and Abstracting
© The Authors. Blue Eyes Intelligence Engineering and Sciences Publication (BEIESP). This is an open access article under the CC-BY-NC-ND license (http://creativecommons.org/licenses/by-nc-nd/4.0/)
Abstract: Addressing the coverage problem is not a complete set of tasks for solving data aggregation in Wireless Sensor Networks. Since the collected information of each sensor node to reach the base station the deployment of sensors plays a critical role in WSN. This paper addresses m connected coverage problem which covers all the given targets and provide a complete connectivity between the sensors for effective data aggregation of data to the base station. A widespread Harmony Search Algorithm which is a metaheuristic algorithm for solving optimization problems is imposed in this sensor deployment concept. The results of the proposed algorithm have been compared with other existing techniques and the results shows that proposed algorithm outperforms existing algorithms.
Keywords: Wireless Sensor Network, Harmony Search, m Connected Coverage.
Scope of the Article: WSN