首页> 外文期刊>IEEE transactions on mobile computing >Cellular Fronthaul Offloading Using Device Fogs, Caching, and Network Coding
【24h】

Cellular Fronthaul Offloading Using Device Fogs, Caching, and Network Coding

机译:使用设备雾,缓存和网络编码的蜂窝前传卸载

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

摘要

This paper considers a device-based Fog Radio Access Network (F-RAN), where users' smart devices (denoted by F-UEs) can be exploited to cache popular files so as to communicate them when requested by other F-UEs among them. This architecture restricts the involvement of the central baseband processing unit (BBU) to serving those F-UEs not immediately served by their peers, thus offloading the BBU's fronthaul spectrum and increasing the overall capacity of the network. This paper aims to further maximize fronthaul offloading in this architecture using network coding (NC). The latter exploits both the cached and previously received files by different F-UEs as side information to serve more requesting F-UEs in each transmission from their peers or the BBU so as to maximize fronthaul offloading. Being half-duplex devices (they can only either send or receive in any given time), the problem of BBU fronthaul offloading in this setting is formulated over two transmission phases on an NC graph. After showing that this problem is NP-hard, the paper proposes two novel heuristic algorithms to solve it in real-time. In addition, a lower-bound on the offloading gain of these algorithms is derived for a special file placement case, their asymptotic optimality is proven, and their complexities are analyzed. Simulation results both show that these proposed algorithms perform closely to the optimal solution and quantify the significant offloading gains achieved by them.
机译:本文考虑了一种基于设备的雾无线电接入网(F-RAN),在该设备中,用户的智能设备(由F-UE表示)可以被用来缓存流行的文件,以便在其中的其他F-UE请求时进行通信。 。这种体系结构将中央基带处理单元(BBU)的使用范围限制为为那些未立即由其对等方服务的F-UE提供服务,从而减轻了BBU的前传频谱的负担,并增加了网络的整体容量。本文旨在使用网络编码(NC)进一步最大化此体系结构中的前传卸载。后者利用由不同的F-UE缓存和先前接收的文件作为辅助信息,以在它们的对等方或BBU的每次传输中为更多的请求F-UE提供服务,从而最大程度地提高前传卸载。作为半双工设备(它们只能在任何给定时间内发送或接收),这种设置下的BBU前传卸载问题是在NC图上的两个传输阶段上提出的。在证明该问题是NP难的之后,本文提出了两种新颖的启发式算法来实时解决它。此外,针对特殊的文件放置情况,得出了这些算法的卸载增益的下限,证明了它们的渐近最优性,并分析了它们的复杂性。仿真结果均表明,这些提出的算法与最佳解决方案性能相近,并且量化了它们所实现的显着卸载收益。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号