摘要
Localization is one of the key technologies in wireless sensor network. In order to improve the localization accuracy, Convex - PIT algorithm which is based on Convex algorithm is proposed for wireless sensor network. As an improvement to Convex, it can improve localization accuracy effectively. Convex - PIT uses the triangular areas enclosed by anchors to exclude areas in which nodes do not exist , it will narrow the range to some extend and then improve the localization accuracy. The Convex-PIT algorithm will bring some computing increases that which judge whether the nodes are in the triangles consisting of anchors. However, it do not need additional improvement in hardware or functions of nodes. Simulation experiments prove that Convex-PIT algorithm can obviously improve the localization accuracy compared to Convex. If the proportion of anchors increases from 10 % to 30%, the improvement in localization accuracy is about 15%.
| 源语言 | 英语 |
|---|---|
| 页(从-至) | 1129-1133 |
| 页数 | 5 |
| 期刊 | Chinese Journal of Sensors and Actuators |
| 卷 | 20 |
| 期 | 5 |
| 出版状态 | 已出版 - 5月 2007 |
指纹
探究 'Optimized localization algorithm for wireless sensor network based on convex algorithm: Convex-PIT' 的科研主题。它们共同构成独一无二的指纹。引用此
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver