A Hop Count Based Heuristic Routing Protocol for Mobile Delay Tolerant Networks

<table class="table-group" width="800px"><tr class="fig-image" id="a"><td><img alt="603547.fig.005a" src="https://static.hindawi.com/articles/tswj/volume-2014/603547/figures/603547.fig.005a.jpg"/></td></tr><tr class="fig-caption"><td align="center"><table><tr><td><b>(a) </b>Buffer size versus delivery</td></tr></table></td></tr><tr class="fig-image" id="b"><td><img alt="603547.fig.005b" src="https://static.hindawi.com/articles/tswj/volume-2014/603547/figures/603547.fig.005b.jpg"/></td></tr><tr class="fig-caption"><td align="center"><table><tr><td><b>(b) </b>Buffer size versus latency</td></tr></table></td></tr><tr class="fig-image" id="c"><td><img alt="603547.fig.005c" src="https://static.hindawi.com/articles/tswj/volume-2014/603547/figures/603547.fig.005c.jpg"/></td></tr><tr class="fig-caption"><td align="center"><table><tr><td><b>(c) </b>Buffer size versus overhead</td></tr></table></td></tr></table>

<table>[Helsinki City Scenario] Buffer size versus delivery ratio, average latency, and overhead ratio.</table>

The Scientific World Journal

fig5

Figure 5

Figure 5: A Hop Count Based Heuristic Routing Protocol for Mobile Delay Tolerant Networks 