Efficiency Resource Allocation for Device-to-Device Underlay Communication Systems: A Reverse Iterative Combinatorial Auction Based Approach
Chen Xu, Lingyang Song, Zhu Han, Qun Zhao, Xiaoli Wang, Xiang Cheng,, and Bingli Jiao

TL;DR
This paper proposes a reverse iterative combinatorial auction mechanism to optimize resource allocation in device-to-device underlay communication systems, significantly improving system sum rate and ensuring cheat-proof convergence.
Contribution
It introduces a novel auction-based resource allocation scheme for D2D communications, with a detailed valuation model and proven cheat-proof, convergent algorithm.
Findings
Achieves higher system sum rate in simulations.
Ensures cheat-proof and finite convergence of the auction process.
Lower complexity compared to traditional methods.
Abstract
Peer-to-peer communication has been recently considered as a popular issue for local area services. 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…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
