Now 3955 visitors
Today:0 Yesterday:0
Total: 140569
215S 51P 5R
2026-10-21, Week 43 |
| Member Login |
| TACT Journal Homepage |
| Call for Paper |
| Committee |
| Find My Paper |
| Author Homepage |
| Statistics & History |
| Welcome Message |
| Paper Procedure |
| FAQ |
| Paper Archives |
| Outstanding Papers |
| Author Homepage |
| - Paper Procedure |
| - Journal Procedure |
| - Presentation Tips |
|
| Program & Proceedings |
| Program with Papers |
| Plenary Session |
| Tutorial Session |
|
| Presentation Platform |
| Hotel & Travel Info |
| About Korea |
| Accommodation |
| Transportation |
| VISA |
| Other Infomation |
|
| Photo Gallery |
| Scheduler Login |
| Seminar |
| Archives Login |
|
| Sponsors |

|
|
|
|
|
|
|
|
|
|
|
|
|
|
| Save Q&A |
|
* Edit or answer any Q&A by selecting Q&A number Hyper Link below + Write button (Save) |
ICACT20240426 Question.3 Questioner: hieu.nguyen@ucdenver.edu 2024-02-08 ¿ÀÈÄ 8:15:53 |
ICACT20240426 Answer.3 Answer by Auhor abdo_samy@mail.ustc.edu.cn 2024-02-08 ¿ÀÈÄ 8:15:53
Chrome Click!! |
| How does the performance of the proposed algorithm compare to existing localization algorithms? |
Thank you for your question. We understand the importance of comparing our proposed algorithm with existing localization algorithms to provide a broader perspective on its performance and capabilities. We expect that our proposed method will give good results in increasing the localization accuracy and reducing the localization error because our method performs the localization hierarchically by splitting the process into two steps: the first is the anchor node localization, and the second is the ordinary node localization. In future work, we plan to conduct thorough comparative studies with existing algorithms. |
| |