首页> 外文期刊>IEEE Journal on Selected Areas in Communications >DRAIM: A Novel Delay-Constraint and Reverse Auction-Based Incentive Mechanism for WiFi Offloading
【24h】

DRAIM: A Novel Delay-Constraint and Reverse Auction-Based Incentive Mechanism for WiFi Offloading

机译:Dreaim:基于新的延迟约束和反向拍卖的WiFi卸载激励机制

获取原文
获取原文并翻译 | 示例
           

摘要

Offloading cellular traffic through WiFi Access Points (APs) has been a promising way to relieve the overload of cellular networks. However, data offloading process consumes a lot of resources (e.g., energy, bandwidth, etc.). Given that the owners of APs are rational and selfish, they will not participate in the data offloading process without receiving the proper reward. Hence, there is an urgent need to develop an effective incentive mechanism to stimulate APs to take part in the data offloading process. This paper proposes a novel Delay-constraint and Reverse Auction-based Incentive Mechanism, named DRAIM. In DRAIM, we model the reverse auction-based incentive problem as a nonlinear integer problem from the business perspective, aiming to maximize the revenue of the Mobile Network Operator (MNO), and jointly consider the delay constraint of different applications in the optimization problem. Then, two low-complexity methods: Greedy Winner Selection Method (GWSM), and Dynamic Programming Winner Selection Method (DPWSM) are proposed to solve the optimization problem. Furthermore, an innovative standard Vickrey-Clarke-Groves scheme-based payment rule is proposed to guarantee the individual rationality and truthfulness properties of DPWSM. At last, extensive simulation results show that the proposed DPWSM is superior to the proposed GWSM and the Random Winner Selection Method in terms of the MNO's utility and traffic load under different scenarios.
机译:通过WiFi接入点(AP)卸载蜂窝流量是一种有希望的方法来缓解蜂窝网络的过载。然而,数据卸载过程消耗大量资源(例如,能量,带宽等)。鉴于APS的所有者是理性和自私的,他们将不会参加数据卸载过程,而不获得适当的奖励。因此,迫切需要开发一种有效的激励机制,以刺激APS参加数据卸载过程。本文提出了一种新的延迟约束和反向拍卖的激励机制,名为Dreaim。在Dreaim中,我们将反向拍卖的激励问题模拟为来自业务角度的非线性整数问题,旨在最大限度地提高移动网络运营商(MNO)的收入,并共同考虑不同应用在优化问题中的延迟约束。然后,两个低复杂性方法:贪婪赢家选择方法(GWSM),以及动态编程获奖者选择方法(DPWSM)都是解决优化问题。此外,提出了一种创新的标准Vickrey-Clarke-Groves计划的支付规则,以保证DPWSM的个性合理性和真实性。最后,广泛的仿真结果表明,所提出的DPWSM优于所提出的GWSM和随机获奖者选择方法,而在不同场景下的效用和交通负荷方面。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号