IEEE/ICACT20240287 Slide.15
[Big Slide]
Oral Presentation 
| Virual Oral Presentation Slide by Slide |
|
IEEE/ICACT20240287 Slide.15
[Big Slide]
| Oral Presentation |
|
|
|
For the contact plan in Table, we run CGR to find the shortest path from source node A to destination node MB by implementing the algorithm. The shortest path is found as through contacts #1, #4 and #6, A¡æB, B¡æMA and MA¡æMB. In this route, the longest path in terms of propagation delay is contact #9 with 0.15 sec | |
| [Go to Next Slide] |