Node placement optimization for distributed sensor network using adaptive genetic algorithm

Sensor placement is an important issue for distributed sensor network design, especially when it is used for collaborative tasks (e.g., source localization and tracking). In this paper, the averaged Cramer-Rao Lower Bound (CRLB) of TDOA-based sensor network localization system is derived at first in...

Full description

Saved in:
Bibliographic Details
Published in:2016 IEEE International Conference on Signal Processing, Communications and Computing (ICSPCC) pp. 1 - 4
Main Authors: Yan Qingli, Chen Jianfeng
Format: Conference Proceeding
Language:English
Published: IEEE 01.08.2016
Subjects:
adaptive genetic algorithm
Convergence
CRLB
Genetic algorithms
Optimization
sensor placement
Signal processing
Simulation
Sociology
source localization
Statistics
Time of Arrival
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Sensor placement is an important issue for distributed sensor network design, especially when it is used for collaborative tasks (e.g., source localization and tracking). In this paper, the averaged Cramer-Rao Lower Bound (CRLB) of TDOA-based sensor network localization system is derived at first in a more practical scenario where the variance of the Time Of Arrival (TOA) estimate error of each sensor node is proportional to the square of its distance from the source. An adaptive genetic algorithm is then designed and applied to the optimal sensor placement process. A series of simulations are carried out to verify and demonstrate the performance of the proposed method when there is a sound source and 5, 10, 18 and 45 sensor nodes in a square test region, respectively. The simulation results show that the proposed adaptive genetic algorithm works successfully and the obtained optimal sensor placement emerges as an even distribution.
DOI:10.1109/ICSPCC.2016.7753692