TY  - JOUR
AU  - Li, Yujiang
AU  - Cao, Jinghua
PY  - 2023
DA  - 2023/04/17
TI  - Adaptive Binary Particle Swarm Optimization for WSN Node Optimal Deployment Algorithm
JO  - ICCK Transactions on Internet of Things
T2  - ICCK Transactions on Internet of Things
JF  - ICCK Transactions on Internet of Things
VL  - 1
IS  - 1
SP  - 1
EP  - 8
DO  - 10.62762/TIOT.2023.564457
UR  - https://www.icck.org/article/abs/TIOT.2023.564457
KW  - Uniform coverage
KW  - discrete binary particle swarm optimization algorithm
KW  - wireless sensor network
KW  - optimal deployment
AB  - In order to optimize the deployment of wireless sensor network nodes, and avoid network energy consumption increase due to node redundancy and uneven coverage, the multi-objective mathematical optimization problem of area coverage is transformed into a function problem. Aiming at network coverage rate, node dormancy rate and network coverage uniformity, the idea of genetic algorithm mutation is introduced based on the discrete binary particle swarm optimization and the global optimal speed is mutated to avoid the algorithm falling into the local optimal solution. In order to further improve the optimization ability of the algorithm, the adaptive learning factor and inertia weight are introduced to obtain the optimal deployment algorithm of wireless sensor network nodes. The experimental results show that the algorithm can reduce the number of active nodes efficiently, improve coverage uniformity, reduce network energy consumption and prolong network lifetime under the premise that the coverage rate is greater than 90%, and compared with an algorithm called coverage configuration protocol, an algorithm called finding the minimum working sets in wireless sensor networks, and an algorithm called binary particle swarm optimization-g in literature, the number of active nodes in this algorithm is reduced by about 36%, 30% and 23% respectively.
SN  - pending
PB  - Institute of Central Computation and Knowledge
LA  - English
ER  - 

@article{Li2023Adaptive,
  author = {Yujiang Li and Jinghua Cao},
  title = {Adaptive Binary Particle Swarm Optimization for WSN Node Optimal Deployment Algorithm},
  journal = {ICCK Transactions on Internet of Things},
  year = {2023},
  volume = {1},
  number = {1},
  pages = {1-8},
  doi = {10.62762/TIOT.2023.564457},
  url = {https://www.icck.org/article/abs/TIOT.2023.564457},
  abstract = {In order to optimize the deployment of wireless sensor network nodes, and avoid network energy consumption increase due to node redundancy and uneven coverage, the multi-objective mathematical optimization problem of area coverage is transformed into a function problem. Aiming at network coverage rate, node dormancy rate and network coverage uniformity, the idea of genetic algorithm mutation is introduced based on the discrete binary particle swarm optimization and the global optimal speed is mutated to avoid the algorithm falling into the local optimal solution. In order to further improve the optimization ability of the algorithm, the adaptive learning factor and inertia weight are introduced to obtain the optimal deployment algorithm of wireless sensor network nodes. The experimental results show that the algorithm can reduce the number of active nodes efficiently, improve coverage uniformity, reduce network energy consumption and prolong network lifetime under the premise that the coverage rate is greater than 90\%, and compared with an algorithm called coverage configuration protocol, an algorithm called finding the minimum working sets in wireless sensor networks, and an algorithm called binary particle swarm optimization-g in literature, the number of active nodes in this algorithm is reduced by about 36\%, 30\% and 23\% respectively.},
  keywords = {Uniform coverage, discrete binary particle swarm optimization algorithm, wireless sensor network, optimal deployment},
  issn = {pending},
  publisher = {Institute of Central Computation and Knowledge}
}