论文标题

在雾无线电访问网络中的千古率和交付潜伏期之间的权衡

Tradeoff between Ergodic Rate and Delivery Latency in Fog Radio Access Networks

论文作者

Yin, Bonan, Peng, Mugen, Yan, Shi, Hu, Chunjing

论文摘要

无线内容缓存最近被认为是雾无线电访问网络(FRAN)的一种有效方法,可减轻容量有限的Fronthaul链接的重担并减少交付延迟。在本文中,提出了一项高级最小延迟关联政策,以最大程度地减少潜伏期,同时保证F-RAN的光谱效率。通过利用随机几何学和排队理论,得出了成功交付概率,平均ergodic率和平均交付潜伏期的封闭形式表达式,其中涉及基于最大接收力的基地的传统关联政策以及所提出的最小延迟关联政策。利用了关键操作参数对上述性能指标的影响。结果表明,拟议的协会政策的交付延迟比传统的协会政策更好。与增加F-APS的密度相比,增加基于雾化的访问点(F-AP)的高速缓存大小可以更大程度地降低平均输送延迟。同时,后者是以降低平均阵尾率的代价。这意味着在F-APS而不是高密度的F-aps在F-RAN中的部署大小的缓存大小可以在F-RAN中有效地促进性能。

Wireless content caching has recently been considered as an efficient way in fog radio access networks (FRANs) to alleviate the heavy burden on capacity-limited fronthaul links and reduce delivery latency. In this paper, an advanced minimal delay association policy is proposed to minimize latency while guaranteeing spectral efficiency in F-RANs. By utilizing stochastic geometry and queueing theory, closed-form expressions of successful delivery probability, average ergodic rate, and average delivery latency are derived, where both the traditional association policy based on accessing the base station with maximal received power and the proposed minimal delay association policy are concerned. Impacts of key operating parameters on the aforementioned performance metrics are exploited. It is shown that the proposed association policy has a better delivery latency than the traditional association policy. Increasing the cache size of fog-computing based access points (F-APs) can more significantly reduce average delivery latency, compared with increasing the density of F-APs. Meanwhile, the latter comes at the expense of decreasing average ergodic rate. This implies the deployment of large cache size at F-APs rather than high density of F-APs can promote performance effectively in F-RANs.

扫码加入交流群

加入微信交流群

微信交流群二维码

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