2017 IEEE 19th International Conference on High Performance Computing and Communications; IEEE 15th International Conference On 2017
DOI: 10.1109/hpcc-smartcity-dss.2017.77
|View full text |Cite
|
Sign up to set email alerts
|

A Cost Efficient Design of a Multi-sink Multi-controller WSN in a Smart Factory

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
19
0

Year Published

2018
2018
2022
2022

Publication Types

Select...
3
2

Relationship

2
3

Authors

Journals

citations
Cited by 20 publications
(19 citation statements)
references
References 16 publications
0
19
0
Order By: Relevance
“…In this paper, the proposed placement algorithm is based on a powerful metaheuristic evolutionary algorithm originally proposed in the work of Faragardi et al It is based on a parallel version of a Max‐Min Ant System being leveraged by a memory‐based SA algorithm, which is called PACSA (Parallel Ant Colony leveraged by Simulated Annealing). The experimental results for two other combinatorial optimization problems, including task allocation on multicores and sink placement problem in IoT systems, demonstrated its strength to find high‐quality solutions (ie, optimal or very close to optimal) in a reasonable computation time. Moreover, as is shown by Faragardi et al, PACSA surpasses multiple well‐known heuristic‐based algorithms such as some variations of bin‐packing algorithms.…”
Section: Solution Approachmentioning
confidence: 99%
See 1 more Smart Citation
“…In this paper, the proposed placement algorithm is based on a powerful metaheuristic evolutionary algorithm originally proposed in the work of Faragardi et al It is based on a parallel version of a Max‐Min Ant System being leveraged by a memory‐based SA algorithm, which is called PACSA (Parallel Ant Colony leveraged by Simulated Annealing). The experimental results for two other combinatorial optimization problems, including task allocation on multicores and sink placement problem in IoT systems, demonstrated its strength to find high‐quality solutions (ie, optimal or very close to optimal) in a reasonable computation time. Moreover, as is shown by Faragardi et al, PACSA surpasses multiple well‐known heuristic‐based algorithms such as some variations of bin‐packing algorithms.…”
Section: Solution Approachmentioning
confidence: 99%
“…The experimental results for two other combinatorial optimization problems, including task allocation on multicores and sink placement problem in IoT systems, demonstrated its strength to find high‐quality solutions (ie, optimal or very close to optimal) in a reasonable computation time. Moreover, as is shown by Faragardi et al, PACSA surpasses multiple well‐known heuristic‐based algorithms such as some variations of bin‐packing algorithms.…”
Section: Solution Approachmentioning
confidence: 99%
“…For example, as shown in Figure A, the set of candidate sinks A S is equal to {1,2,3,4,5,6}, and as shown in Figure B, the set of selected sinks S is equal to {2,4,5}. In this paper, we assume that the sets A S and A C are known in advance, similar to the works of Faragardi et al and Poe and Schmitt; however, there are multiple methods in the literature discussing the number of candidate locations to place sink nodes, such as those by Safa et al In Section 5, we further investigate the effect of the size of A S and A C on the chance of finding an optimal sink/controller placement. Figure A illustrates an example of our network assumption with six candidate sinks and three candidate controllers.…”
Section: Problem Descriptionmentioning
confidence: 99%
“…The proposed method is a powerful metaheuristic evolutionary algorithm, originally proposed in the work of Faragardi et al, which was then extended in another preliminary work . It is based on a parallel version of a max‐min ant system being leveraged by an SA algorithm using limited memory.…”
Section: Solution Frameworkmentioning
confidence: 99%
See 1 more Smart Citation