论文标题

大规模设备到设备资源交易的分布式双拍卖

Distributed Double Auctions for Large-Scale Device-to-Device Resource Trading

论文作者

Gao, Shuqin, Courcoubetis, Costas, Duan, Lingjie

论文摘要

将来的无线网络中的移动用户面临有限的无线资源,例如数据计划,计算能力和能源存储。鉴于这些用户中的一些可能无法充分利用其无线资源,因此设备对设备(D2D)资源共享是一种有前途的方法,可以利用用户在资源使用方面的多样性并在本地汇集资源。在本文中,我们提出了一种新颖的双面D2D交易市场模型,该模型使许多本地连接的用户能够交易资源。传统的资源分配解决方案大多是集中式的,而无需考虑用户的本地D2D连接限制,这对于大规模交易而言是不可计入的。此外,可能会出现市场故障,因为自私的用户不会如实地报告其实际估值和购买或出售资源的数量。为了应对这两个主要挑战,我们首先使用D2D分配约束研究分布式资源分配问题。根据最大加权匹配的贪婪思想,我们提出了一种快速算法,以达到接近最佳的平均分配效率。然后,我们将其与一种新的定价机制相结合,该机制可以调整买卖资源的最终交易价格,以一种吸引买卖双方的方式,以真实地报告其估值和可用资源数量。与带有中央控制器的传统双重拍卖不同,这种定价机制是完全分布的,即每对匹配的用户之间的最终交易价格仅取决于他们自己的声明,因此可以在本地计算。最后,我们分析了在多个回合中重复执行提出的D2D交易机制,并确定最佳交易频率。

Mobile users in future wireless networks face limited wireless resources such as data plan, computation capacity and energy storage. Given that some of these users may not be utilizing fully their wireless resources, device-to-device (D2D) resource sharing is a promising approach to exploit users' diversity in resource use and for pooling their resources locally. In this paper, we propose a novel two-sided D2D trading market model that enables a large number of locally connected users to trade resources. Traditional resource allocation solutions are mostly centralized without considering users' local D2D connectivity constraints, becoming unscalable for large-scale trading. In addition, there may be market failure since selfish users will not truthfully report their actual valuations and quantities for buying or selling resources. To address these two key challenges, we first investigate the distributed resource allocation problem with D2D assignment constraints. Based on the greedy idea of maximum weighted matching, we propose a fast algorithm to achieve near-optimal average allocative efficiency. Then, we combine it with a new pricing mechanism that adjusts the final trading prices for buying and selling resources in a way that buyers and sellers are incentivized to truthfully report their valuations and available resource quantities. Unlike traditional double auctions with a central controller, this pricing mechanism is fully distributed in the sense that the final trading prices between each matched pair of users only depend on their own declarations and hence can be calculated locally. Finally, we analyze the repeated execution of the proposed D2D trading mechanism in multiple rounds and determine the best trading frequency.

扫码加入交流群

加入微信交流群

微信交流群二维码

扫码加入学术交流群,获取更多资源