Bounding box based distributed search localization algorithm for WSN
A bounding box based distributed full search localization algorithm for WSN(wireless sensor networks)was proposed.Firstly,the coordinates and distances of neighbor nodes were obtained by ranging.Secondly,the possible node position area was determined based on bounding box method.Finally,the area was...
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | zho |
| Published: |
Editorial Department of Journal on Communications
2012-11-01
|
| Series: | Tongxin xuebao |
| Subjects: | |
| Online Access: | http://www.joconline.com.cn/zh/article/doi/10.3969/j.issn.1000-436x.2012.z2.017/ |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | A bounding box based distributed full search localization algorithm for WSN(wireless sensor networks)was proposed.Firstly,the coordinates and distances of neighbor nodes were obtained by ranging.Secondly,the possible node position area was determined based on bounding box method.Finally,the area was meshed and the full search method was employed to search the best estimation point,whose coordinates are the node’s localization coordinates.In real WSN,the algorithm need run several rounds to obtain node’s localization coordinates by stepwise refinement.Simulation results show that the proposed algorithm achieves the comparable performance with other up-to-date complex localization algorithms. |
|---|---|
| ISSN: | 1000-436X |