A Fair Resource Allocation Algorithm for Data and Energy Integrated Communication Networks

<div>Maximum-minimum throughput between two MUs versus <svg height="11.9316pt" id="M302" style="vertical-align:-3.2957pt" version="1.1" viewbox="-0.0498162 -8.6359 26.048 11.9316" width="26.048pt" 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="M699 368C699 549 574 666 407 666C186 666 23 488 23 277C23 113 129 -3 288 -13L307 -26C431 -111 501 -139 533 -147C559 -154 613 -163 658 -164L666 -141C597 -111 507 -66 430 -11L416 -1C580 42 699 190 699 368ZM601 371C601 227 518 54 381 22L354 40L278 24C175 47 120 145 120 269C120 451 235 631 398 631C540 631 601 521 601 371Z" id="g113-82"></path><glyph.data ascent="3473" descent="-2876" horiz-adv-x="722" vert-adv-y="722"></glyph.data></g><g transform="matrix(.0091,0,0,-0.0091,9.321,3.132)"><path d="M810 0V30C751 35 744 40 744 106V296C744 396 694 451 614 451C583 451 558 438 537 425C512 409 485 391 454 368C434 420 390 451 342 451C309 451 285 439 260 424C228 405 206 387 185 372V453C141 434 90 421 43 413V386C102 378 105 373 105 309V106C105 41 96 35 29 30V0H243V30C194 35 185 41 185 106V335C216 360 256 389 297 389C357 389 384 348 384 275V106C384 41 374 35 312 30V0H530V30C475 35 465 41 465 104V294C465 313 464 324 463 336C502 367 539 389 576 389C637 389 663 346 663 274V109C663 41 653 35 593 30V0H810Z" id="g58-107"></path><glyph.data ascent="1007" descent="-369" horiz-adv-x="834" vert-adv-y="834"></glyph.data></g><g transform="matrix(.0091,0,0,-0.0091,16.883,3.132)"><path d="M442 39L431 68C420 63 406 57 394 57C377 57 359 71 359 118V301C359 353 349 393 314 424C291 443 261 451 230 451C171 438 107 401 79 381C59 366 46 355 46 340C46 316 72 295 91 295C106 295 117 303 122 319C131 350 139 371 152 384C163 397 178 404 197 404C246 404 281 365 281 293V278C260 262 186 232 124 213C69 194 41 161 41 112C41 47 92 -12 163 -12C195 -12 243 25 283 51C288 35 293 22 308 7C319 -4 339 -12 354 -12L442 39ZM281 87C262 68 226 51 199 51C169 51 129 74 129 126C129 162 151 181 190 198C211 208 259 229 281 240V87Z" id="g58-95"></path><glyph.data ascent="1007" descent="-369" horiz-adv-x="449" vert-adv-y="449"></glyph.data></g><g transform="matrix(.0091,0,0,-0.0091,20.969,3.132)"><path d="M482 0V30C420 38 407 48 370 103L273 248C308 299 331 332 352 357C387 397 401 404 463 409V439H277V409C318 405 324 400 307 369C290 337 270 307 251 279L194 367C175 396 180 402 220 409V439H18V409C74 401 87 395 117 349L204 213C173 168 147 130 119 95C78 46 67 38 5 30V0H195V30C144 38 143 47 162 79C181 112 202 149 225 181L297 70C314 43 307 35 264 30V0H482Z" id="g58-118"></path><glyph.data ascent="1007" descent="-369" horiz-adv-x="481" vert-adv-y="481"></glyph.data></g></svg>.</div>

Mobile Information Systems

fig7

Figure 7

Figure 7: A Fair Resource Allocation Algorithm for Data and Energy Integrated Communication Networks 