Interference-Aware and Spectral-Efficient Resource Allocation Using Complete Graphs for the D2D Communication

<table class="figure-group"><tr class="fig-image" id="a"><td><object data="https://static.hindawi.com/articles/wcmc/volume-2022/3264412/figures/3264412.fig.008a.svgz" name="3264412.fig.008a" type="image/svg+xml"></object></td></tr><tr class="fig-caption"><td><b>(a) </b>Hotspot topology</td></tr><tr class="fig-image" id="b"><td><object data="https://static.hindawi.com/articles/wcmc/volume-2022/3264412/figures/3264412.fig.008b.svgz" name="3264412.fig.008b" type="image/svg+xml"></object></td></tr><tr class="fig-caption"><td><b>(b) </b>Random topology</td></tr></table>

<div>Two network topologies of D2D communication.</div>

Wireless Communications and Mobile Computing

fig8

Figure 8

Figure 8: Interference-Aware and Spectral-Efficient Resource Allocation Using Complete Graphs for the D2D Communication 