2019
DOI: 10.1007/s13369-018-03712-7
|View full text |Cite
|
Sign up to set email alerts
|

Improved Many-Objective Optimization Algorithms for the 3D Indoor Deployment Problem

Abstract: Compared with the two-dimensional deployment, the three-dimensional deployment of sensor networks is more challenging. We studied the problem of 3D repositioning of sensor nodes in wireless sensor networks. We aim essentially to add a set of nodes to the initial architecture. The positions of the added nodes are determined by the proposed algorithms while optimizing a set of objectives. In this paper, we suggest two main contributions. The first one is an analysis contribution where the modelling of the proble… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
8
0

Year Published

2019
2019
2023
2023

Publication Types

Select...
7
1
1

Relationship

2
7

Authors

Journals

citations
Cited by 21 publications
(8 citation statements)
references
References 33 publications
0
8
0
Order By: Relevance
“…Ayinde and Hashim [15] employed two evolutionary techniques, gravitational search algorithm (GSA) and differential evolution (DE), as a hybrid single-objective optimisation algorithm to maximise the lifetime. Mnasri et al [16] proposed a many-objective optimisation algorithm for the 3D indoor deployment problem. They attempted to minimise the number of deployed nodes and energy consumption, and maximise the localisation rate, coverage and network lifetime.…”
Section: Literature Reviewmentioning
confidence: 99%
“…Ayinde and Hashim [15] employed two evolutionary techniques, gravitational search algorithm (GSA) and differential evolution (DE), as a hybrid single-objective optimisation algorithm to maximise the lifetime. Mnasri et al [16] proposed a many-objective optimisation algorithm for the 3D indoor deployment problem. They attempted to minimise the number of deployed nodes and energy consumption, and maximise the localisation rate, coverage and network lifetime.…”
Section: Literature Reviewmentioning
confidence: 99%
“…A. "Non-Dominated Genetic Sort Algorithm II" (NSGA-II) NSGA-II is a genetic algorithm where it is considered in the literature as one of the most efficient algorithms for solving a multi-objective optimization problem using the Pareto approach [12]. The NSGA-II consists of the following steps:…”
Section: Proposed Approachmentioning
confidence: 99%
“…Qasim et al [24] used ant colony optimization (ACO) to deploy a WSN in a 3D grid with the objective of minimizing cost. Mnasri et al [25] used a multiobjective optimization algorithm based on dominance and decomposition (MOEA/DD) to solve problems regarding the deployment of WSNs in indoor 3D virtual spaces.…”
Section: B Three-dimensional Deployment Problemsmentioning
confidence: 99%