A Game Theory Based Congestion Control Protocol for Wireless Personal Area Networks

<div>An example of one-hop and two-hop communications from node <svg height="8.85534pt" id="M64" style="vertical-align:-0.04981041pt" version="1.1" viewbox="-0.0498162 -8.80553 9.37728 8.85534" width="9.37728pt" 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="M722 32C646 41 636 48 622 116L544 496L509 667L472 658L153 123C106 45 93 42 27 32L18 0H259L268 32C178 40 172 48 204 107L272 233H509C523 180 533 137 540 96C548 50 546 39 466 32L457 0H714L722 32ZM502 283H299L448 547H450L502 283Z" id="g50-66"></path><glyph.data ascent="3443" descent="-2856" horiz-adv-x="740" vert-adv-y="740"></glyph.data></g></svg> to node <svg height="9.01192pt" id="M65" style="vertical-align:-0.2063904pt" version="1.1" viewbox="-0.0498162 -8.80553 8.93363 9.01192" width="8.93363pt" 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="M690 629C653 643 577 667 483 667C225 667 24 528 24 292C24 92 174 -17 367 -17C448 -17 534 1 570 10C592 34 642 131 658 174C648 180 639 186 629 192C562 89 499 21 382 21C223 21 130 138 130 298C130 467 255 627 462 627C582 627 643 589 650 462L686 466C689 517 688 580 690 629Z" id="g50-68"></path><glyph.data ascent="3443" descent="-2856" horiz-adv-x="714" vert-adv-y="714"></glyph.data></g></svg>.</div>

Journal of Sensors

fig2

Figure 2

Figure 2: A Game Theory Based Congestion Control Protocol for Wireless Personal Area Networks 