摘要
A Limit DV-Hop (LDV-Hop) algorithm is put forward based on comprehensive analysis of DV-Hop localization algorithms, in order to satisfy the characters of low cost and low power in WSNs. The least hop number between nodes and landmarks is counted firstly and the distance in hops is then computed. Finally the coordinates of nodes are determined. LDVHop algorithm is simulated in network simulator (Ns-2) and the experimental results are presented. Comparison shows LDV-Hop algorithm is useful to improve the accuracy of localization and reduce the number of communication messages. Different node distributions are discussed to give the result that the algorithm is adaptive to irregular distribution shape of sensor nodes.
| 源语言 | 英语 |
|---|---|
| 页 | 638-643 |
| 页数 | 6 |
| DOI | |
| 出版状态 | 已出版 - 2006 |
| 已对外发布 | 是 |
| 活动 | 2006 IEEE International Conference on Information Acquisition, ICIA 2006 - Weihai, Shandong, 中国 期限: 20 8月 2006 → 23 8月 2006 |
会议
| 会议 | 2006 IEEE International Conference on Information Acquisition, ICIA 2006 |
|---|---|
| 国家/地区 | 中国 |
| 市 | Weihai, Shandong |
| 时期 | 20/08/06 → 23/08/06 |
指纹
探究 'An improved DV-Hop localization algorithm in wireless sensor networks' 的科研主题。它们共同构成独一无二的指纹。引用此
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver