Upper-Bounded Price of Anarchy in D2D Communications Over 5G Edge-Computing Mobile Wireless Networks

Device to Device (D2D) communications provide a means of boosting communication capacity. As there is a gap between the D2D requests and the available spectrum resource, it is critical to design an allocation rule for user equipment and payment. We design two mechanisms from a linear programming perspective and the maximum in range perspective, respectively. Both mechanisms can achieve the upper-bounded approximation ratios in terms of price of anarchy for D2D communications over 5G edge-computing mobile networks. These two mechanisms have found various applications in other disciplines as well. We conduct numerical studies and compare our work with a greedy method. We show that the proposed algorithm outperforms the greedy method.