Scholarlink

In this paper, we propose an effective ray tracing method based on Dynamic Dijkstra Algorithm (DDA) to simulate radio wave propagation in complicated structures. The computational spaces are discretized in terms of regularly arrayed nodes in Cartesian coordinate system and are classified into free-space, surface and inner nodes. The inner type has no links and others have at most six links to adjacent nodes. The proposed theory is considered to be a digital version of the Fermat’s principle, since it employs the path cost and proximity node which are dynamically changed after checking Line of Sight (LoS) or Not LoS (NLOS). We show some numerical examples to examine the accuracy and effectiveness of the proposed DDA-based ray tracing method.

错误：搜索内容不能为空，请输入英文关键词
错误：关键词超出字数限制，请精简
高级检索

Ray Tracing in Complicated Structures Based on Dynamic Dijkstra Algorithm

  • 会议论文

  • 发表日期：

    2025年

查看全文
  • Kazunori Uchida,
  • Leonard Barolli

摘要

In this paper, we propose an effective ray tracing method based on Dynamic Dijkstra Algorithm (DDA) to simulate radio wave propagation in complicated structures. The computational spaces are discretized in terms of regularly arrayed nodes in Cartesian coordinate system and are classified into free-space, surface and inner nodes. The inner type has no links and others have at most six links to adjacent nodes. The proposed theory is considered to be a digital version of the Fermat’s principle, since it employs the path cost and proximity node which are dynamically changed after checking Line of Sight (LoS) or Not LoS (NLOS). We show some numerical examples to examine the accuracy and effectiveness of the proposed DDA-based ray tracing method.