Efficient Network Coding with Interference-Awareness and Neighbor States Updating in Wireless Networks

<table class="figure-group"><tr class="fig-image" id="a"><td><object data="https://static.hindawi.com/articles/wcmc/volume-2017/4974165/figures/4974165.fig.003a.svgz" name="4974165.fig.003a" type="image/svg+xml"></object></td></tr><tr class="fig-caption"><td><b>(a) </b><svg height="6.1673pt" id="M65" style="vertical-align:-0.2063904pt" version="1.1" viewbox="-0.0498162 -5.96091 8.42472 6.1673" width="8.42472pt" 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="M615 290C615 392 563 448 529 448C511 448 491 441 484 434L483 425C518 400 546 349 546 273C546 158 504 46 417 46C381 46 356 77 356 142C356 184 380 293 392 334L387 340L307 323C305 288 296 228 287 188C265 94 221 52 180 52C144 52 112 89 112 171C112 278 164 372 241 430L226 454C106 394 23 288 23 155C23 40 79 -12 139 -12C184 -12 245 32 285 85C292 31 322 -12 376 -12C423 -12 470 18 501 45C570 104 615 184 615 290Z" id="g113-246"></path></g></svg></td></tr><tr class="fig-image" id="b"><td><object data="https://static.hindawi.com/articles/wcmc/volume-2017/4974165/figures/4974165.fig.003b.svgz" name="4974165.fig.003b" type="image/svg+xml"></object></td></tr><tr class="fig-caption"><td><b>(b) </b>Waiting time slot <svg height="9.49473pt" id="M66" style="vertical-align:-0.2063999pt" version="1.1" viewbox="-0.0498162 -9.28833 6.59789 9.49473" width="6.59789pt" 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="M475 507C475 612 440 712 326 712C139 712 23 420 23 215C23 96 58 -12 180 -12C369 -12 475 293 475 507ZM391 522C391 486 387 448 379 394H126C155 538 222 677 310 677C386 677 391 571 391 522ZM373 346C344 193 283 22 189 22C126 22 106 114 106 196C106 243 111 293 118 346H373Z" id="g113-230"></path></g></svg></td></tr></table>

<div>The number of sending packets <svg height="6.1673pt" id="M63" style="vertical-align:-0.2063904pt" version="1.1" viewbox="-0.0498162 -5.96091 8.42472 6.1673" width="8.42472pt" 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="M615 290C615 392 563 448 529 448C511 448 491 441 484 434L483 425C518 400 546 349 546 273C546 158 504 46 417 46C381 46 356 77 356 142C356 184 380 293 392 334L387 340L307 323C305 288 296 228 287 188C265 94 221 52 180 52C144 52 112 89 112 171C112 278 164 372 241 430L226 454C106 394 23 288 23 155C23 40 79 -12 139 -12C184 -12 245 32 285 85C292 31 322 -12 376 -12C423 -12 470 18 501 45C570 104 615 184 615 290Z" id="g113-246"></path></g></svg> and waiting time slot <svg height="9.49473pt" id="M64" style="vertical-align:-0.2063999pt" version="1.1" viewbox="-0.0498162 -9.28833 6.59789 9.49473" width="6.59789pt" 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="M475 507C475 612 440 712 326 712C139 712 23 420 23 215C23 96 58 -12 180 -12C369 -12 475 293 475 507ZM391 522C391 486 387 448 379 394H126C155 538 222 677 310 677C386 677 391 571 391 522ZM373 346C344 193 283 22 189 22C126 22 106 114 106 196C106 243 111 293 118 346H373Z" id="g113-230"></path></g></svg> versus DFC.</div>

Wireless Communications and Mobile Computing

fig3

Figure 3

Figure 3: Efficient Network Coding with Interference-Awareness and Neighbor States Updating in Wireless Networks 