Optimal Multicommodity Spectrum-Efficient Routing in Multihop Wireless Networks

<div>Minimum spectral efficiency among all <svg height="6.1673pt" id="M408" style="vertical-align:-0.2063904pt" version="1.1" viewbox="-0.0498162 -5.96091 4.9929 6.1673" width="4.9929pt" 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="M352 391C352 416 319 448 267 448C236 448 173 423 147 400C107 364 96 332 96 304C96 248 143 210 193 181C241 153 258 124 258 100C258 72 232 38 184 38C151 38 107 66 81 108C77 114 64 116 55 111C34 99 23 84 23 65C23 29 81 -12 134 -12C220 -12 325 61 325 141C325 184 297 215 234 256C194 282 161 309 161 346C161 380 188 401 217 401C255 401 279 380 301 353C308 344 313 341 325 347C341 355 352 371 352 391Z" id="g113-116"></path></g></svg>-<svg height="9.49473pt" id="M409" style="vertical-align:-0.2063999pt" version="1.1" viewbox="-0.0498162 -9.28833 7.34169 9.49473" width="7.34169pt" 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="M530 686C535 705 530 712 521 712C504 712 448 684 359 674L358 648H393C437 648 439 646 429 593L400 435C372 447 345 448 332 448C286 448 194 414 144 373C68 311 23 203 23 111C23 26 57 -12 91 -12C120 -12 147 3 188 29C227 54 290 102 341 170H343L322 71C308 6 320 -12 341 -12C373 -12 442 27 501 96L485 120C455 91 422 67 408 67C401 67 401 76 404 91C440 294 479 473 530 686ZM387 375L355 241C326 187 200 53 142 53C126 53 109 73 109 130C109 217 154 337 218 381C240 396 265 404 297 404S372 390 387 375Z" id="g113-101"></path></g></svg> routes obtained using algorithms<i> Equal-Time-Slots</i> and<i> Variable-Time-Slots</i>, respectively, versus the number of network nodes.</div>

Wireless Communications and Mobile Computing

fig1

Figure 1

Figure 1: Optimal Multicommodity Spectrum-Efficient Routing in Multihop Wireless Networks 