Maximizing D2D-Based Offloading Efficiency With Throughput Guarantee and Buffer Constraint
Maximizing D2D-Based Offloading Efficiency With Throughput Guarantee and Buffer Constraint
复制标题
通过吞吐量保证和缓冲区约束最大化基于 D2D 的卸载效率
DOI：
10.1109/tvt.2018.2880327
复制
发表时间：
2019
影响因子：
6.8
通讯作者：
Wu Qihui
中科院分区：
文献类型：
--
作者：
Qu Yuben;Dong Chao;Dai Haipeng;Wei Zhenhua;Wu Qihui
基于设备到设备（D2D）的卸载作为减轻蜂窝网络上的压力的有前途的方法而脱颖而出。从运营商和用户的角度来看，理想的解决方案是在保证用户服务质量（QoS）的同时最大限度地提高卸载效率（比率）。然而，现有的方法很少联合考虑卸载效率优化和QoS保证。在本文中，我们研究如何最大化的百分比总卸载流量的移动的内容下载通过D2D，同时保证用户最小吞吐量下有限的缓冲区大小。主要的挑战是如何整合所有潜在的D2D机会以最大化卸载性能。我们提出了一个时空动态图（STDG），以捕捉所有可能的D2D的机会，基于D2D的流量卸载。基于STDG，我们数学上制定了最大化卸载效率的优化问题，受吞吐量要求和缓冲区大小的约束。制定的问题是一个线性分数问题，并可以转化为一个等价的线性规划，其解决方案揭示了最大的卸载能力，D2D实现QoS的满意度。基于轨迹的仿真验证了我们的方法优于三个基准方法。
Device-to-device (D2D) based offloading stands out as a promising approach to mitigate the pressure over cellular networks. From the perspectives of both operators and users, an ideal solution is expected to maximize the offloading efficiency (ratio) while guaranteeing the quality-of-service (QoS) of users. However, existing approaches seldom jointly take into consideration offloading efficiency optimization and QoS guarantee. In this paper, we study how to maximize the percentage of total offloaded traffic of mobile content downloading via D2D, while guaranteeing the user minimum throughput under limited buffer size. The major challenge is how to incorporate all potential D2D opportunities to maximize the offloading performance. We propose a spatial–temporal dynamic graph (STDG) to capture all possible D2D opportunities in D2D-based traffic offloading. Based on STDG, we mathematically formulate an optimization problem of maximizing the offloading efficiency, subject to throughput requirement and buffer size constraint. The formulated problem is a linear-fractional problem and can be transformed into an equivalent linear program, whose solution reveals the maximum offloading ability that D2D achieves under QoS satisfaction. Trace-based simulations validate the superiority of our approach over three benchmark approaches.