Abstract

Pollution source parameter identification (PSPI) is significant for pollution control, since it can provide important information and save a lot of time for subsequent pollution elimination works. For solving the PSPI problem, a large number of pollution sensor nodes can be rapidly deployed to cover a large area and form a wireless sensor network (WSN). Based on the measurements of WSN, least-squares estimation methods can solve the PSPI problem by searching for the solution that minimize the sum of squared measurement noises. They are independent of the measurement noise distribution, i.e., robust to the noise distribution. To search for the least-squares solution, population-based parallel search techniques usually can overcome the premature convergence problem, which can stagnate the single-point search algorithm. In this paper, we adapt the relatively newly presented artificial bee colony (ABC) algorithm to solve the WSN-based PSPI problem and verifies its feasibility and robustness. Extensive simulation results show that the ABC and the particle swarm optimization (PSO) algorithm obtained similar identification results in the same simulation scenario. Moreover, the ABC and the PSO achieved much better performance than a traditionally used single-point search algorithm, i.e., the trust-region reflective algorithm.

Highlights

  • Hazardous pollution can be released to the atmosphere and cause severe disease to human beings [1]

  • When used for solving the nonlinear least-squares (NLS) formulation of the wireless sensor network (WSN)-based Pollution source parameter identification (PSPI) problem, traditional single-point search methods are prone to be stagnated by the premature convergence problem, i.e., converge prematurely at solutions far from the true-values of the parameters

  • The particle swarm optimization (PSO), LM, and trust-region-reflective [9] (TRR) algorithms are selected as the counterpart algorithms, which can be used to solve the WSN-based PSPI problem concerned in this paper, to be compared with the artificial bee colony (ABC)

Read more

Summary

Introduction

Hazardous pollution can be released to the atmosphere and cause severe disease to human beings [1]. When used for solving the NLS formulation of the WSN-based PSPI problem, traditional single-point search methods are prone to be stagnated by the premature convergence problem, i.e., converge prematurely at solutions far from the true-values of the parameters. This problem can be avoided by using the population-based parallel search approaches, e.g., the particle swarm optimization (PSO) algorithm [13]. This paper includes at least three contributions: (1) presents a method for adapting the ABC to solve the WSN-based PSPI problem, and verifies its feasibility and robustness; (2) verifies that the ABC outperforms the traditionally used single-point search methods; (3) reveals the influence of algorithm parameters on the identification performance of all tested algorithms.

Pollution distribution and measurement
Simulation scheme
Artificial bee colony
Particle swarm optimization
Single-point search algorithms
Control parameter selection
Performance comparison
Conclusions
Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call