Name
Title | ||
|---|---|---|
Trajectory estimation algorithm for mobile nodes using encounter information and geographical information |
Abstract | ||
|---|---|---|
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. |
Year | DOI | Venue |
|---|---|---|
2012 | 10.1016/j.pmcj.2011.11.002 | Pervasive and Mobile Computing |
Keywords | Field | DocType |
encounter information,centralized algorithm,mobile nodes move,mobile node,average estimation error,shortest path,nodes move,trajectory estimation algorithm,geographical information,wireless range,communication facility,shortest time,ad hoc network,localization | Wireless,Computer science,Computer network,Algorithm,Optimized Link State Routing Protocol,Wireless ad hoc network,Trajectory,Distributed computing | Journal |
Volume | Issue | ISSN |
8 | 2 | 1574-1192 |
Citations | PageRank | References |
2 | 0.46 | 29 |
Authors | ||
5 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Sae Fujii | 1 | 44 | 4.07 |
| Akira Uchiyama | 2 | 78 | 14.48 |
| Takaaki Umedu | 3 | 129 | 17.84 |
| Hirozumi Yamaguchi | 4 | 371 | 60.93 |
| Teruo Higashino | 5 | 1086 | 119.60 |