Traffic and Energy Aware Optimization for Congestion Control in Next Generation Wireless Sensor Networks

<table class="algorithm-group"><tr><td><table class="algorithm" id="alg1"><tr><td colspan="2">1. If (<span class="nowrap"><svg height="8.95973pt" id="M110" style="vertical-align:-0.2063904pt" version="1.1" viewbox="-0.0498162 -8.75334 48.3625 8.95973" width="48.3625pt" 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="M592 498C586 556 582 629 581 675H560C545 656 537 650 510 650H115C87 650 74 652 60 675H40C38 620 33 555 28 495H57C69 539 77 568 89 585C102 607 122 616 205 616H267V123C267 44 259 34 168 28V0H454V28C360 34 352 44 352 123V616H422C498 616 514 608 531 584C542 568 552 543 562 495L592 498Z"></path></g><g transform="matrix(.013,0,0,-0.013,8.373,0)"><path d="M592 498C586 556 582 629 581 675H560C545 656 537 650 510 650H115C87 650 74 652 60 675H40C38 620 33 555 28 495H57C69 539 77 568 89 585C102 607 122 616 205 616H267V123C267 44 259 34 168 28V0H454V28C360 34 352 44 352 123V616H422C498 616 514 608 531 584C542 568 552 543 562 495L592 498Z"></path></g><g transform="matrix(.013,0,0,-0.013,16.394,0)"><path d="M495 163C480 117 462 85 444 65C421 39 387 34 332 34C290 34 256 36 236 47C218 57 213 77 213 131V526C213 612 222 616 301 622V650H40V622C122 616 128 611 128 526V126C128 41 120 34 36 28V0H489C498 31 519 126 525 157L495 163Z"></path></g><g transform="matrix(.013,0,0,-0.013,23.475,0)"><path d="M137 665C100 665 82 657 82 635C82 619 85 596 90 556C103 441 109 325 119 197C123 190 148 190 153 197C162 325 169 441 182 556C187 596 189 619 189 635C189 657 172 665 137 665ZM136 -12C170 -12 194 11 194 47C194 80 170 105 137 105C105 105 81 80 81 47C81 11 105 -12 136 -12Z"></path></g><g transform="matrix(.013,0,0,-0.013,30.695,0)"><path d="M535 323V373H52V323H535ZM535 138V188H52V138H535Z"></path></g><g transform="matrix(.013,0,0,-0.013,41.957,0)"><path d="M241 635C89 635 35 457 35 312C35 153 89 -12 240 -12C390 -12 443 166 443 312C443 466 390 635 241 635ZM238 602C329 602 354 454 354 312C354 172 330 22 240 22C152 22 124 173 124 313S148 602 238 602Z"></path></g></svg>)</span></td></tr><tr><td colspan="2">2. If (F-ANT is at sink node)</td></tr><tr><td colspan="2">3. Initialize B-ANT</td></tr><tr><td colspan="2">4. Else</td></tr><tr><td colspan="2">5. If Random<svg height="12.7178pt" id="M111" style="vertical-align:-3.42947pt" version="1.1" viewbox="-0.0498162 -9.28833 59.6366 12.7178" width="59.6366pt" 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="M300 -147C201 -63 143 98 143 270S200 602 300 686L282 710C136 610 70 450 70 271V270C70 89 136 -72 282 -170L300 -147Z"></path></g><g transform="matrix(.013,0,0,-0.013,4.498,0)"><path d="M556 393C556 426 537 448 514 448C496 448 478 435 471 420C468 414 462 401 466 394C473 382 480 368 480 346C480 268 392 143 338 67H336C329 163 319 253 309 330S286 448 254 448C215 448 160 383 127 337L143 311C167 344 200 373 208 373S222 365 229 320C246 214 264 66 268 -20C219 -83 131 -171 17 -239L25 -261L137 -235C248 -110 273 -79 335 8C384 77 481 215 520 287C544 332 556 363 556 393Z"></path></g><g transform="matrix(.013,0,0,-0.013,12.027,0)"><path d="M275 270C275 450 212 609 64 710L45 686C145 604 203 442 203 270S147 -63 45 -147L64 -170C213 -68 275 89 275 270Z"></path></g><g transform="matrix(.013,0,0,-0.013,20.157,0)"><path d="M512 -3V55L134 254V256L512 456V514L75 281V230L512 -3Z"></path></g><g transform="matrix(.013,0,0,-0.013,31.42,0)"><path d="M241 635C89 635 35 457 35 312C35 153 89 -12 240 -12C390 -12 443 166 443 312C443 466 390 635 241 635ZM238 602C329 602 354 454 354 312C354 172 330 22 240 22C152 22 124 173 124 313S148 602 238 602Z"></path></g><g transform="matrix(.013,0,0,-0.013,37.66,0)"><path d="M113 -12C146 -12 170 11 170 46C170 78 146 103 114 103S58 78 58 46C58 11 82 -12 113 -12Z"></path></g><g transform="matrix(.013,0,0,-0.013,40.624,0)"><path d="M241 635C89 635 35 457 35 312C35 153 89 -12 240 -12C390 -12 443 166 443 312C443 466 390 635 241 635ZM238 602C329 602 354 454 354 312C354 172 330 22 240 22C152 22 124 173 124 313S148 602 238 602Z"></path></g><g transform="matrix(.013,0,0,-0.013,46.864,0)"><path d="M241 635C89 635 35 457 35 312C35 153 89 -12 240 -12C390 -12 443 166 443 312C443 466 390 635 241 635ZM238 602C329 602 354 454 354 312C354 172 330 22 240 22C152 22 124 173 124 313S148 602 238 602Z"></path></g><g transform="matrix(.013,0,0,-0.013,53.104,0)"><path d="M384 0V27C293 34 287 42 287 114V635C232 613 172 594 109 583V559L157 557C201 555 205 550 205 499V114C205 42 199 34 109 27V0H384Z"></path></g></svg> then</td></tr><tr><td colspan="2">6. Initialize F-ANT</td></tr><tr><td colspan="2">7. Go to next hop randomly</td></tr><tr><td colspan="2">8. Else</td></tr><tr><td colspan="2">9. Nodes as current and next node are updated here</td></tr><tr><td colspan="2">10. If node already visited</td></tr><tr><td colspan="2">11. Go to other next neighbor node</td></tr><tr><td colspan="2">12. Update heuristic value by step 11</td></tr><tr><td colspan="2">13. END</td></tr></table></td></tr></table>

Journal of Sensors

alg1

Algorithm 1

Algorithm 1: Traffic and Energy Aware Optimization for Congestion Control in Next Generation Wireless Sensor Networks 