Volume 6, Issue 3 (9-2014)                   2014, 6(3): 7-13 | Back to browse issues page

XML Print


Download citation:
BibTeX | RIS | EndNote | Medlars | ProCite | Reference Manager | RefWorks
Send citation to:

Kolangari S, Teshnehlab M. An Improved Parallel Genetic Algorithm for Optimal Sensor Placement of Wireless Sensor Networks . International Journal of Information and Communication Technology Research 2014; 6 (3) :7-13
URL: http://ijict.itrc.ac.ir/article-1-119-en.html
Abstract:   (2554 Views)
The wireless sensor network has recently become an intensive research focus due to its potential applications many years. Sensor placement is one of the most important issues in wireless sensor networks. An efficient placement scheme can enhance the quality of monitoring in wireless sensor networks by increasing the coverage rate of interested area. This paper presents an efficient method based on parallel genetic algorithms to solve a sensor placement optimization problem. We modify the general master-slave parallel genetic algorithm to improve the convergence rate of this optimization method. The results indicate the effectiveness of the proposed method in comparison with genetic algorithm, general parallel genetic algorithm, and some well-known evolutionary algorithms.
Full-Text [PDF 1232 kb]   (1012 Downloads)    
Type of Study: Research | Subject: Information Technology

Add your comments about this article : Your username or Email:
CAPTCHA

Rights and permissions
Creative Commons License This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.