Dynamic Routing Strategy for Directed Transmissions of High-Valued Contents in NGSO Satellite-Based Internet

<table class="figure-group"><tr class="fig-image" id="a"><td><object data="https://static.hindawi.com/articles/wcmc/volume-2022/6214080/figures/6214080.fig.003a.svgz" name="6214080.fig.003a" type="image/svg+xml"></object></td></tr><tr class="fig-caption"><td><b>(a) </b>1 time</td></tr><tr class="fig-image" id="b"><td><object data="https://static.hindawi.com/articles/wcmc/volume-2022/6214080/figures/6214080.fig.003b.svgz" name="6214080.fig.003b" type="image/svg+xml"></object></td></tr><tr class="fig-caption"><td><b>(b) </b>10 times</td></tr><tr class="fig-image" id="c"><td><object data="https://static.hindawi.com/articles/wcmc/volume-2022/6214080/figures/6214080.fig.003c.svgz" name="6214080.fig.003c" type="image/svg+xml"></object></td></tr><tr class="fig-caption"><td><b>(c) </b>100 times</td></tr></table>

<div>Three heuristic algorithms were applied to solve the routing problem, and the comparison results showed that the <span class="nowrap"><svg height="10.7866pt" id="M107" style="vertical-align:-2.150701pt" version="1.1" viewbox="-0.0498162 -8.6359 9.52083 10.7866" width="9.52083pt" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"><g transform="matrix(.013,0,0,-0.013,0,0)"><path d="M699 368C699 549 574 666 407 666C186 666 23 488 23 277C23 113 129 -3 288 -13L307 -26C431 -111 501 -139 533 -147C559 -154 613 -163 658 -164L666 -141C597 -111 507 -66 430 -11L416 -1C580 42 699 190 699 368ZM601 371C601 227 518 54 381 22L354 40L278 24C175 47 120 145 120 269C120 451 235 631 398 631C540 631 601 521 601 371Z"></path></g></svg>-</span>learning algorithm was better than the genetic algorithm and the ant colony algorithm for the optimization effect.</div>

Wireless Communications and Mobile Computing

fig3

Figure 3

Figure 3: Dynamic Routing Strategy for Directed Transmissions of High-Valued Contents in NGSO Satellite-Based Internet 