Optimized placement of nodes for target detection in sensor networks

Front. Electr. Electron. Eng. ›› 2007, Vol. 2 ›› Issue (2) : 167 -171.

PDF (362KB)
Front. Electr. Electron. Eng. ›› 2007, Vol. 2 ›› Issue (2) : 167 -171. DOI: 10.1007/s11460-007-0031-x

Optimized placement of nodes for target detection in sensor networks

Author information +
History +
PDF (362KB)

Abstract

In order to improve the precision of the target detection in wireless sensor networks, a new approach based on genetic algorithm (GA) was proposed to optimize the placement of the sensor. The target location problem was transformed into locating a target at a grid point through modeling the sensor field as a grid of points. Moreover, the sensor placement problem was formulated as a combinatorial optimization problem, which is aimed at minimizing the maximum discrimination error under the restraints of limited cost and complete coverage. The GA approach uses binary coding to represent the location, and both single parent crossover operator and single parent mutation operator are used to improve its speed and efficiency. Experimental results have shown that a global optimal solution can be quickly obtained using the proposed method and the precision requirement for target location is satisfied.

Keywords

wireless sensor network, sensor placement, target location, genetic algorithm

Cite this article

Download citation ▾
null. Optimized placement of nodes for target detection in sensor networks. Front. Electr. Electron. Eng., 2007, 2(2): 167-171 DOI:10.1007/s11460-007-0031-x

登录浏览全文

4963

注册一个新账户 忘记密码

References

AI Summary AI Mindmap
PDF (362KB)

719

Accesses

0

Citation

Detail

Sections
Recommended

AI思维导图

/