dc.contributor.author | Konstantinidis, Andreas | en |
dc.contributor.author | Yang, K. | en |
dc.contributor.author | Zhang, Q. | en |
dc.contributor.author | Zeinalipour-Yazdi, Constantinos D. | en |
dc.creator | Konstantinidis, Andreas | en |
dc.creator | Yang, K. | en |
dc.creator | Zhang, Q. | en |
dc.creator | Zeinalipour-Yazdi, Constantinos D. | en |
dc.date.accessioned | 2019-11-13T10:40:45Z | |
dc.date.available | 2019-11-13T10:40:45Z | |
dc.date.issued | 2010 | |
dc.identifier.issn | 1389-1286 | |
dc.identifier.uri | http://gnosis.library.ucy.ac.cy/handle/7/54284 | |
dc.description.abstract | A Wireless Sensor Network (WSN) design often requires the decision of optimal locations (deployment) and transmit power levels (power assignment) of the sensors to be deployed in an area of interest. Few attempts have been made on optimizing both decision variables for maximizing the network coverage and lifetime objectives, even though, most of the latter studies consider the two objectives individually. This paper defines the multiobjective Deployment and Power Assignment Problem (DPAP). Using the Multi-Objective Evolutionary Algorithm based on Decomposition (MOEA/D), the DPAP is decomposed into a set of scalar subproblems that are classified based on their objective preference and tackled in parallel by using neighborhood information and problem-specific evolutionary operators, in a single run. The proposed operators adapt to the requirements and objective preferences of each subproblem dynamically during the evolution, resulting in significant improvements on the overall performance of MOEA/D. Simulation results have shown the superiority of the problem-specific MOEA/D against the NSGA-II in several network instances, providing a diverse set of high quality network designs to facilitate the decision maker's choice. Crown Copyright © 2009. | en |
dc.source | Computer Networks | en |
dc.source.uri | https://www.scopus.com/inward/record.uri?eid=2-s2.0-77949652725&doi=10.1016%2fj.comnet.2009.08.010&partnerID=40&md5=fba185dfcb3091a0d97a6a3949a8eb2b | |
dc.subject | Computer simulation | en |
dc.subject | Multiobjective optimization | en |
dc.subject | Sensor networks | en |
dc.subject | Wireless sensor networks | en |
dc.subject | Mathematical operators | en |
dc.subject | Multi objective | en |
dc.subject | Decision makers | en |
dc.subject | Evolutionary algorithms | en |
dc.subject | High quality | en |
dc.subject | Traveling salesman problem | en |
dc.subject | Simulation result | en |
dc.subject | Multi objective evolutionary algorithms | en |
dc.subject | Area of interest | en |
dc.subject | Decision variables | en |
dc.subject | Deployment | en |
dc.subject | Evolutionary operators | en |
dc.subject | Neighborhood information | en |
dc.subject | Network coverage | en |
dc.subject | Network design | en |
dc.subject | NSGA-II | en |
dc.subject | Optimal locations | en |
dc.subject | Power assignment | en |
dc.subject | Sub-problems | en |
dc.subject | Transmit power | en |
dc.title | A multi-objective evolutionary algorithm for the deployment and power assignment problem in wireless sensor networks | en |
dc.type | info:eu-repo/semantics/article | |
dc.identifier.doi | 10.1016/j.comnet.2009.08.010 | |
dc.description.volume | 54 | |
dc.description.issue | 6 | |
dc.description.startingpage | 960 | |
dc.description.endingpage | 976 | |
dc.author.faculty | 002 Σχολή Θετικών και Εφαρμοσμένων Επιστημών / Faculty of Pure and Applied Sciences | |
dc.author.department | Τμήμα Πληροφορικής / Department of Computer Science | |
dc.type.uhtype | Article | en |
dc.description.notes | <p>Cited By :58</p> | en |
dc.source.abbreviation | Comput.Networks | en |
dc.contributor.orcid | Zeinalipour-Yazdi, Constantinos D. [0000-0002-8388-1549] | |
dc.gnosis.orcid | 0000-0002-8388-1549 | |