论文标题

多个运营商之间的策略范围分配,以不同的无线网络变化

Strategy-Proof Spectrum Allocation among Multiple Operators for Demand Varying Wireless Networks

论文作者

Yadav, Indu, Kulkarni, Ankur A., Karandikar, Abhay

论文摘要

为了满足最终用户的数据速率需求的指数增长,需要在许可和无执照的频谱频段中共存运营商之间有效分配,以迎合无线网络中流量的时间和空间变化。在本文中,我们通过拍卖解决了非合件运营商之间的频谱分配问题。经典的Vickrey-Clarke-Groves(VCG)方法为防止策略和社会福利最大化的拍卖提供了一个框架,这使得它不可避免地用于实际实施。我们提出了有关频谱分配的密封竞标拍卖机制,该机制在计算上是可触犯的,因此适用于根据网络的动态载荷变化在短持续时间内进行拍卖来分配频谱。我们确定所提出的算法是统一需求的策略范围。此外,对于不均匀的需求,我们提出了一种满足较弱策略的算法。我们还考虑随着需求的边际估值的非线性增加。提出了仿真结果,以表现出具有VCG和其他现有机制的算法的性能比较。

To address the exponentially increasing data rate demands of end users, necessitates efficient spectrum allocation among co-existing operators in licensed and unlicensed spectrum bands to cater to the temporal and spatial variations of traffic in the wireless network. In this paper, we address the spectrum allocation problem among non-cooperative operators via auctions. The classical Vickrey-Clarke-Groves (VCG) approach provides the framework for a strategy-proof and social welfare maximizing auction at high computational complexity, which makes it infeasible for practical implementation. We propose sealed bid auction mechanisms for spectrum allocation which are computationally tractable and hence applicable for allocating spectrum by performing auctions in short durations as per the dynamic load variations of the network. We establish that the proposed algorithm is strategy-proof for uniform demand. Furthermore, for non-uniform demand we propose an algorithm that satisfies weak strategy-proofness. We also consider non-linear increase in the marginal valuations with demand. Simulation results are presented to exhibit the performance comparison of the proposed algorithms with VCG and other existing mechanisms.

扫码加入交流群

加入微信交流群

微信交流群二维码

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