Open AccessA Discrete Imperialist Competitive Algorithm for WSN Deployment
Author(s) -
Kamal Jadidy Aval,
Masumeh Damrudi
Publication year - 2018
Publication title -
international journal of engineering and technology
Language(s) - English
Resource type - Journals
ISSN - 2227-524X
DOI - 10.14419/ijet.v7i4.1.19481
Subject(s) - software deployment , computer science , scalability , imperialist competitive algorithm , event (particle physics) , mathematical optimization , point (geometry) , distributed computing , optimization problem , algorithm , mathematics , physics , geometry , quantum mechanics , database , operating system , multi swarm optimization
The WSN deployment problem is addressed in this paper. The problem applies to the monitored areas with different detection needs at different points. In this problem, every point of the terrain is assigned with a predefined minimum probability of event detection. The objective is providing the best position for the network nodes and at the same time assuring event detection, detection message delivery, and reducing deployment cost. We have formulated the problem as an optimization problem with three objectives, which is NP-complete. Because of the huge solution space for the problem and the exponential computational complexity, none of the exact methods known yet can solve the problem unless for a pretty small scaled case. To battle the complexity of the solution, a new scalable solution is proposed based on imperialist competitive algorithm namely imperialist competitive deployment algorithm (ICDA). We compare the proposal to the related deployment strategies, and the results show that ICDA outperforms them.