.png){kind=icon}
返回
Trajectory estimation algorithm for mobile nodes using encounter information and geographical information
.png){kind=icon}
PRE
AI
DOI：10.1016/j.pmcj.2011.11.002.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
In this paper, we propose a centralized algorithm to estimate trajectories of mobile nodes using a reasonable number of landmarks, ad hoc wireless communication facility and geographical information. The method identifies such trajectories where nodes move between two landmarks with the shortest time, which may be the shortest paths with high possibility, and uses their intermediate positions as quasi-landmarks to localize the others. The method can deal with a realistic case where mobile nodes move along pathways among obstacles. From simulation results, we show that the average estimation error is less than 40% of the wireless range under various scenarios. (C) 2011 Elsevier B.V. All rights reserved.
Keyword:
Trajectory estimation algorithm
Encounter information
Geographical information
Ad hoc network
Localization
期刊
IF:
3.5
论文数:
1.5K
被引数:
2.2K
机构
引用论文
分享收藏Winnowing Out High-psm Candidates: The Adverse Selection Effect of Competitive Public Service Exams
OAAI
OAAI分享收藏分享收藏Photochromic Dithienylethene- Phenanthroline Ligands and their Corresponding Ru(II) Complexes.png)
CHIMIA
OAAI
CHIMIAIF0
OAAI分享收藏分享收藏
查看更多内容