Efficiency Resource Allocation for Device-to-Device Underlay Communication Systems: A Reverse Iterative Combinatorial Auction Based Approach

Abstract

Peer-to-peer communication has been recently considered as a popular issue for local areaservices. An innovative resource allocation scheme is proposed to improve the performance of mobile peer-to-peer, i.e., device-to-device (D2D), communications as an underlay in the downlink (DL) cellular networks. To optimize the system sum rate over the resource sharing of both D2D and cellular modes, we introduce a reverse iterative combinatorial auction as the allocation mechanism.In the auction, all the spectrum resources are considered as a set of resource units, which as bidders compete to obtain business while the packages of the D2D pairs are auctioned off as goods in each auction round. We first formulate the valuation of each resource unit, as a basis of the proposed auction. And then a detailed non-monotonic descending price auction algorithm is explained depending on the utility function that accounts for the channel gain from D2D and the costs for the system. Further, we prove that the proposed auction-based scheme is cheat-proof, and converges in a finite number of iteration rounds. We explain non-monotonicity in the price update process and show lower complexity compared to a traditional combinatorial allocation. The simulation results demonstrate that the algorithm efficiently leads to a good performance on the system sum rate.

Cooperative Game-based Cheating in Full-duplex Relaying-based D2D Communication Underlaying Heterogeneous Cellular Networks

“…First, we show how much the D2D users' throughput is improved by our algorithm compared to the GS algorithm [12], the existing Cheating algorithms [14,15] and the Hungarian algorithm [32], respectively. Then we show how individual D2D user is improved by our cheating algorithm.…”

“…Recently, most of the related research applied new mathematical tools such as game theory [22,26], graph theory [32,34] and matching theory [14,15] to solve the resource allocation problems in D2D communications. In [22], considering a small-cell scenario in which full-duplex base station communicates with half-duplex D2D users, an iterative algorithm is proposed based on game theory by modeling the problem as a non-cooperative game between the uplink and downlink channels.…”

“…In [26], the author apply the Stackerberg game framework in the resource allocation between D2D users and cellular users, which enhance the system throughput and user fairness. Previous works apply classic algorithm of graph theory such as the Hungarian (also refer to as Kuhn-Munkres, KM) algorithm [32,34] to pairing D2D users and CUs, which achieves the optimal solution of the system throughput. However, the Hungarian algorithm only considers the optimal welfare instead of the stability.…”

Opportunistic Spectrum Utilization in Vehicular Communication Networks

“…Based on these observations, in this paper, we only consider the large-scale fading effects. Following [135] and [139], we consider a general power-law path-loss model with the decay rate d −γ , where d is the distance between the transmitter and the receiver, and γ > 2 is the path-loss exponent. The cellular uplink and V-D2D links may have different path-loss exponents, denoted by γ C and γ D , respectively.…”

Simple network design and power allocation for 5G device-to-device communication

“…Due to the increasing number of autonomous heterogeneous devices in future mobile networks, an efficient resource allocation scheme is required to maximize network throughput and achieve higher spectral efficiency [8], [9]. Due to co-channel interference caused by spectrum reuse and limited battery life of user equipments, previous studies on heterogenous D2D communications into cellular networks mostly focused on how to maximize the spectral efficiency [10]- [13]. Only a few papers have considered power efficiency or energy efficiency for D2D communications.…”