Improved discrete particle swarm optimization for solving the practical sensors deployment
- 65 Downloads
Sensors deployment has played an important role in many engineering applications, and the key goal is aimed at achieving an optimal surveillance region with a set of sensors. In this paper, a probabilistic strategy was chosen as the sensing model and a Gaussian probability distribution was employed, furthermore an accumulative probability for all the utilized sensors was presented and an optimal deployment on meshed planar grid was proposed. It was proved that the deployment problem was NP-complete, and an approach for approximating this solution should be resorted to intelligent methods. Particle swarm optimization (PSO) was a widely used artificial intelligent tool, and hereby an improved discrete PSO (DPSO) was proposed for solving the deployment problem, and which was based on integer coding, and the initialization, positions and velocities updating were distinct with the traditional PSO. In final, the deployment was investigated respectively by using uniform sensors (binary coding problem) and combinational sensors (multivariate integer coding problem), which were indicated to the core structure of proposed DPSO.
KeywordsSensors deployment Probabilistic sensing model Discrete particle swarm optimization
This research is completely supported by National Key Research and Development Program “Research on Vibration Control Technology for Established Industrial Building Structures”, which is sponsored by Ministry of Science and Technology of the P. R. China and the Grant No. is 2016YFC0701302; and it is also launched as preparation for the revising work of ‘Code for design of vibration isolation’ (national code of P. R. China). Team colleagues in China National Machinery Industry Corporation (SINOMACH) and Technology Research Center of Engineering Vibration Control (EVCC) in China IPPR International Engineering Co., Ltd (IPPR) are gratefully acknowledged.
- Ahmed N, Kanhere SS, Jha S (2005) Probabilistic coverage in wireless sensor networks [C] Local Comput Netw 8:681Google Scholar
- Carter B, Ragade R (2009) A probabilistic model for the deployment of sensors [C]. In: IEEE sensors applications symposium, IEEE, pp 7–12Google Scholar
- Dingxing Z, Ming X, Yingwen C et al (2006) Probabilistic coverage configuration for wireless sensor networks [C]. In: Wireless communications, networking and mobile computing (WiCOM 2006), International conference on IEEE, pp 1–4Google Scholar
- Du H, Ni Q, Pan Q et al (2014) An improved particle swarm optimization-based coverage control method for wireless sensor network [M]. In: Advances in swarm intelligence. Springer International Publishing, Berlin, pp 114–124Google Scholar
- Eberhart RC, Kennedy J (1995) A new optimizer using particle swarm theory [C]. In: Proceedings of the sixth international symposium on micro machine and human science, vol 1, pp 39–43Google Scholar
- Garey MR, Johnson DS (2002) Computers and intractability [M]. WH Freeman, New YorkGoogle Scholar
- Hefeeda M, Ahmadi H (2007) A probabilistic coverage protocol for wireless sensor networks [C]. In: IEEE international conference network protocols (ICNP), pp 41–50Google Scholar
- Ke WC, Liu BH, Tsai MJ (2007) Constructing a wireless sensor network to fully cover critical grids by deploying minimum sensors on grid points is NP-complete [J]. IEEE Trans Comput (5):710–715Google Scholar
- Kennedy J, Kennedy JF, Eberhart RC et al (2001) Swarm intelligence [M]. Morgan Kaufmann, BurlingtonGoogle Scholar
- Liu B, Towsley D (2004) A study of the coverage of large-scale sensor networks [C]. In: IEEE international conference on mobile ad-hoc and sensor systems, pp 475–483Google Scholar
- Zhou Z, Das S, Gupta H (2004) Connected k-coverage problem in sensor networks [C]. In: Proceedings of the 13th international conference on computer communications and networks, IEEE, pp 373–378Google Scholar