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

<table class="table-group" id="tab2"><tr><td><table class="table"><tr><td class="thead-hr" colspan="2"><hr/></td></tr><tr class="thead"><td align="left">  Strategies </td><td align="left"> Cases </td></tr><tr><td class="thead-hr" colspan="2"><hr/></td></tr><tr><td align="left"><svg height="7.9124999" id="M176" style="vertical-align:-0.11285pt" version="1.1" viewbox="0 0 7.4875002 7.9124999" width="7.4875002" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<g transform="matrix(.017,-0,0,-.017,.062,7.638)"><path d="M457 332q0 -81 -41 -161.5t-105.5 -131.5t-129.5 -51q-46 0 -79 30.5t-33 86.5q0 18 7 51q18 95 46 187q6 19 6 33q0 7 -7 7q-24 0 -78 -64l-20 23q32 48 73 77t78 29q33 0 33 -46q0 -38 -10 -70q-28 -92 -39 -152q-7 -38 -7 -57q0 -78 69 -78q68 0 118 75.5t50 194.5
q0 43 -12 57q-11 12 -11 24q0 19 15 35.5t34 16.5q18 0 30.5 -34.5t12.5 -81.5z" id="x1D463"></path></g>
</svg> and <svg height="7.9499998" id="M177" style="vertical-align:-0.11285pt" version="1.1" viewbox="0 0 9.2749996 7.9499998" width="9.2749996" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<g transform="matrix(.017,-0,0,-.017,.062,7.675)"><path d="M515 96q-37 -44 -84.5 -76t-71.5 -32q-12 0 -18 7t-6 34t10 75l19 89h-2q-87 -113 -181 -176q-43 -29 -83 -29q-46 0 -46 63q0 31 9 67l52 222q7 36 -1 36q-10 0 -76 -50l-13 24q47 45 92 71.5t67 26.5q18 0 21 -16.5t-8 -65.5l-56 -242q-16 -67 13 -67q41 0 114 74
t114 146l32 145l74 26h11q-52 -199 -80 -347q-8 -39 6 -39q7 0 32 17.5t47 39.5z" id="x1D462"></path></g>
</svg></td><td align="left"> Add an extra message replica in the network </td></tr><tr><td align="left"><span style="width: 7.4875002px;"><svg height="7.9124999" id="M178" style="vertical-align:-0.11285pt" version="1.1" viewbox="0 0 7.4875002 7.9124999" width="7.4875002" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<g transform="matrix(.017,-0,0,-.017,.062,7.638)"><path d="M457 332q0 -81 -41 -161.5t-105.5 -131.5t-129.5 -51q-46 0 -79 30.5t-33 86.5q0 18 7 51q18 95 46 187q6 19 6 33q0 7 -7 7q-24 0 -78 -64l-20 23q32 48 73 77t78 29q33 0 33 -46q0 -38 -10 -70q-28 -92 -39 -152q-7 -38 -7 -57q0 -78 69 -78q68 0 118 75.5t50 194.5
q0 43 -12 57q-11 12 -11 24q0 19 15 35.5t34 16.5q18 0 30.5 -34.5t12.5 -81.5z" id="x1D463"></path></g>
</svg></span></td><td align="left"><svg height="7.9499998" id="M179" style="vertical-align:-0.11285pt" version="1.1" viewbox="0 0 9.2749996 7.9499998" width="9.2749996" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<g transform="matrix(.017,-0,0,-.017,.062,7.675)"><path d="M515 96q-37 -44 -84.5 -76t-71.5 -32q-12 0 -18 7t-6 34t10 75l19 89h-2q-87 -113 -181 -176q-43 -29 -83 -29q-46 0 -46 63q0 31 9 67l52 222q7 36 -1 36q-10 0 -76 -50l-13 24q47 45 92 71.5t67 26.5q18 0 21 -16.5t-8 -65.5l-56 -242q-16 -67 13 -67q41 0 114 74
t114 146l32 145l74 26h11q-52 -199 -80 -347q-8 -39 6 -39q7 0 32 17.5t47 39.5z" id="x1D462"></path></g>
</svg> is not a better choice than <svg height="7.9124999" id="M180" style="vertical-align:-0.11285pt" version="1.1" viewbox="0 0 7.4875002 7.9124999" width="7.4875002" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<g transform="matrix(.017,-0,0,-.017,.062,7.638)"><path d="M457 332q0 -81 -41 -161.5t-105.5 -131.5t-129.5 -51q-46 0 -79 30.5t-33 86.5q0 18 7 51q18 95 46 187q6 19 6 33q0 7 -7 7q-24 0 -78 -64l-20 23q32 48 73 77t78 29q33 0 33 -46q0 -38 -10 -70q-28 -92 -39 -152q-7 -38 -7 -57q0 -78 69 -78q68 0 118 75.5t50 194.5
q0 43 -12 57q-11 12 -11 24q0 19 15 35.5t34 16.5q18 0 30.5 -34.5t12.5 -81.5z" id="x1D463"></path></g>
</svg></td></tr><tr><td align="left"><span style="width: 9.2749996px;"><svg height="7.9499998" id="M181" style="vertical-align:-0.11285pt" version="1.1" viewbox="0 0 9.2749996 7.9499998" width="9.2749996" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<g transform="matrix(.017,-0,0,-.017,.062,7.675)"><path d="M515 96q-37 -44 -84.5 -76t-71.5 -32q-12 0 -18 7t-6 34t10 75l19 89h-2q-87 -113 -181 -176q-43 -29 -83 -29q-46 0 -46 63q0 31 9 67l52 222q7 36 -1 36q-10 0 -76 -50l-13 24q47 45 92 71.5t67 26.5q18 0 21 -16.5t-8 -65.5l-56 -242q-16 -67 13 -67q41 0 114 74
t114 146l32 145l74 26h11q-52 -199 -80 -347q-8 -39 6 -39q7 0 32 17.5t47 39.5z" id="x1D462"></path></g>
</svg></span></td><td align="left"><svg height="7.9499998" id="M182" style="vertical-align:-0.11285pt" version="1.1" viewbox="0 0 9.2749996 7.9499998" width="9.2749996" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<g transform="matrix(.017,-0,0,-.017,.062,7.675)"><path d="M515 96q-37 -44 -84.5 -76t-71.5 -32q-12 0 -18 7t-6 34t10 75l19 89h-2q-87 -113 -181 -176q-43 -29 -83 -29q-46 0 -46 63q0 31 9 67l52 222q7 36 -1 36q-10 0 -76 -50l-13 24q47 45 92 71.5t67 26.5q18 0 21 -16.5t-8 -65.5l-56 -242q-16 -67 13 -67q41 0 114 74
t114 146l32 145l74 26h11q-52 -199 -80 -347q-8 -39 6 -39q7 0 32 17.5t47 39.5z" id="x1D462"></path></g>
</svg> is a better choice than <svg height="7.9124999" id="M183" style="vertical-align:-0.11285pt" version="1.1" viewbox="0 0 7.4875002 7.9124999" width="7.4875002" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<g transform="matrix(.017,-0,0,-.017,.062,7.638)"><path d="M457 332q0 -81 -41 -161.5t-105.5 -131.5t-129.5 -51q-46 0 -79 30.5t-33 86.5q0 18 7 51q18 95 46 187q6 19 6 33q0 7 -7 7q-24 0 -78 -64l-20 23q32 48 73 77t78 29q33 0 33 -46q0 -38 -10 -70q-28 -92 -39 -152q-7 -38 -7 -57q0 -78 69 -78q68 0 118 75.5t50 194.5
q0 43 -12 57q-11 12 -11 24q0 19 15 35.5t34 16.5q18 0 30.5 -34.5t12.5 -81.5z" id="x1D463"></path></g>
</svg></td></tr><tr class="table-tr"><td colspan="2"><hr class="tbody-hr"/></td></tr></table></td></tr></table>

Optional opportunistic routing decisions.

The Scientific World Journal

tab2

Table 2

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