.png){kind=icon}
Return
A Self-Adaptive Particle Swarm Optimization Based Multiple Source Localization Algorithm in Binary Sensor Networks
.png){kind=icon}
OA
AI
DOI：10.1155/2015/487978.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
With the development of wireless communication and sensor techniques, source localization based on sensor network is getting more attention. However, fewer works investigate the multiple source localization for binary sensor network. In this paper, a self-adaptive particle swarm optimization based multiple source localization method is proposed. A detection model based on Neyman-Pearson criterion is introduced. Then the maximum likelihood estimator is employed to establish the objective function which is used to estimate the location of sources. Therefore, the multiple-source localization problem is transformed into optimization problem. In order to improve the ability of global search of particle swarm optimization, the self-adaptive particle swarm optimization is used to solve this problem. Various simulations have been conducted, and the results show that the proposed method owns higher localization accuracy in comparison with other methods.
Journal
No journal information available
Organization
No organization information available
Cited Papers
No cited papers available