Greedy Data Transportation Scheme with Hard Packet Deadlines for Wireless Ad Hoc Networks

<table class="table-group" width="800px"><tr class="fig-image" id="a"><td><img alt="815123.fig.009a" src="https://static.hindawi.com/articles/tswj/volume-2014/815123/figures/815123.fig.009a.jpg"/></td></tr><tr class="fig-caption"><td align="center"><table><tr><td><b>(a) </b>Routing cost</td></tr></table></td></tr><tr class="fig-image" id="b"><td><img alt="815123.fig.009b" src="https://static.hindawi.com/articles/tswj/volume-2014/815123/figures/815123.fig.009b.jpg"/></td></tr><tr class="fig-caption"><td align="center"><table><tr><td><b>(b) </b>Total number of wireless hops</td></tr></table></td></tr></table>

<table>Network performance comparison for the shortest stationary routing versus proposed mixed routing (with the packet deadline of 250 s and the interarrival time of 5 s).</table>

The Scientific World Journal

fig9

Figure 9

Figure 9: Greedy Data Transportation Scheme with Hard Packet Deadlines for Wireless Ad Hoc Networks 