TY - JOUR
T1 - Synchronous Wireless Sensor and Sink Placement Method Using Dual-Population Co-evolutionary Constrained Multiobjective Optimization Algorithm
AU - Yu, Qianqian
AU - Yang, Chen
AU - Dai, Guangming
AU - Peng, Lei
AU - Chen, Xiaoyu
N1 - Publisher Copyright:
© 2005-2012 IEEE.
PY - 2023/6/1
Y1 - 2023/6/1
N2 - Optimal wireless sensor placement (OWSP) plays a pivotal role in structural health monitoring. This study proposes a method to determine the simultaneous placement of sensors and sinks that minimizes energy consumption and maximizes information effectiveness. Network connectivity and reliability are critical constraints that determine the lifetime of wireless sensor networks. In this study, OWSP was formulated as a constrained multi-objective optimization problem with mixed-integer programming. Accordingly, a dual-population constrained multiobjective optimization (DCCMO) algorithm, which includes new crossover and mutation operators, was developed. In DCCMO, weak cooperation between two offspring populations is exploited to improve the efficiency of the solution search. The performance of DCCMO was compared to that of five other state-of-the-art algorithms using numerical examples with varying network parameters. DCCMO not only successfully matches the constrained Pareto front but also balances energy consumption and information effectiveness while exhibiting greater diversity and faster convergence than all other tested algorithms.
AB - Optimal wireless sensor placement (OWSP) plays a pivotal role in structural health monitoring. This study proposes a method to determine the simultaneous placement of sensors and sinks that minimizes energy consumption and maximizes information effectiveness. Network connectivity and reliability are critical constraints that determine the lifetime of wireless sensor networks. In this study, OWSP was formulated as a constrained multi-objective optimization problem with mixed-integer programming. Accordingly, a dual-population constrained multiobjective optimization (DCCMO) algorithm, which includes new crossover and mutation operators, was developed. In DCCMO, weak cooperation between two offspring populations is exploited to improve the efficiency of the solution search. The performance of DCCMO was compared to that of five other state-of-the-art algorithms using numerical examples with varying network parameters. DCCMO not only successfully matches the constrained Pareto front but also balances energy consumption and information effectiveness while exhibiting greater diversity and faster convergence than all other tested algorithms.
KW - Constrained multiobjective optimization
KW - mixed-integer programming (MIP)
KW - optimal sensor and sink placement
KW - structural health monitoring
KW - wireless sensor networks (WSNs)
UR - https://www.scopus.com/pages/publications/85145645029
U2 - 10.1109/TII.2022.3211853
DO - 10.1109/TII.2022.3211853
M3 - 文章
AN - SCOPUS:85145645029
SN - 1551-3203
VL - 19
SP - 7561
EP - 7571
JO - IEEE Transactions on Industrial Informatics
JF - IEEE Transactions on Industrial Informatics
IS - 6
ER -