Reliable Ant Colony Routing Algorithm for Dual-Channel Mobile Ad Hoc Networks

<table class="fixed-width table-group" id="tab4"><tr><td><table class="table"><colgroup><col style="width:3.24em"/><col style="width:6.11em"/><col style="width:3.53em"/><col style="width:3.25em"/><col style="width:2.92em"/></colgroup><tr><td class="thead-hr" colspan="5"><hr/></td></tr><tr><td class="align_left">Type</td><td class="align_center">Visitednode</td><td class="align_center"><svg height="8.68572pt" id="M147" style="vertical-align:-0.0498209pt" version="1.1" viewbox="-0.0498162 -8.6359 8.13765 8.68572" width="8.13765pt" 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="M593 650H142L136 622C219 616 224 611 209 531L130 120C114 39 108 34 23 28L17 0H501C518 32 557 130 568 158L540 169C519 132 495 93 469 70C439 43 409 35 332 35C272 35 241 37 225 50C211 61 211 89 222 149L253 320H350C441 320 443 312 441 239H471L510 434H481C455 366 448 358 360 358H260L303 572C311 613 312 615 348 615H431C509 615 522 603 532 581C544 555 546 531 545 491L574 493C583 555 592 631 593 650Z" id="g113-70"></path></g></svg>min</td><td class="align_center"><svg height="8.68572pt" id="M148" style="vertical-align:-0.0498209pt" version="1.1" viewbox="-0.0498162 -8.6359 8.13765 8.68572" width="8.13765pt" 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="M593 650H142L136 622C219 616 224 611 209 531L130 120C114 39 108 34 23 28L17 0H501C518 32 557 130 568 158L540 169C519 132 495 93 469 70C439 43 409 35 332 35C272 35 241 37 225 50C211 61 211 89 222 149L253 320H350C441 320 443 312 441 239H471L510 434H481C455 366 448 358 360 358H260L303 572C311 613 312 615 348 615H431C509 615 522 603 532 581C544 555 546 531 545 491L574 493C583 555 592 631 593 650Z" id="g113-70"></path></g></svg>avg</td><td class="align_center">Bd<svg height="9.49473pt" id="M149" style="vertical-align:-0.2063999pt" version="1.1" viewbox="-0.0498162 -9.28833 6.66314 9.49473" width="6.66314pt" 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="M480 416C480 431 465 448 438 448C388 448 312 383 252 330C217 299 188 273 155 237H153L257 680C262 700 263 712 253 712C240 712 183 684 97 674L92 648L126 647C166 646 172 645 163 606L23 -6L29 -12C51 -5 77 2 107 8C115 62 130 128 142 180C153 193 179 220 204 241C231 170 259 106 288 54C317 0 336 -12 358 -12C381 -12 423 2 477 80L460 100C434 74 408 54 398 54C385 54 374 65 351 107C326 154 282 241 263 299C296 332 351 377 403 377C424 377 436 372 445 368C449 366 456 368 462 375C472 386 480 402 480 416Z" id="g113-108"></path></g></svg></td></tr><tr class="table-tr"><td colspan="5"><hr class="tbody-hr"/></td></tr></table></td></tr></table>

<div>The format of backward ant message.</div>

Wireless Communications and Mobile Computing

tab4

Table 4

Table 4: Reliable Ant Colony Routing Algorithm for Dual-Channel Mobile Ad Hoc Networks 