...
首页> 外文期刊>IEEE transactions on mobile computing >Rate Aware Network Codes for Cloud Radio Access Networks
【24h】

Rate Aware Network Codes for Cloud Radio Access Networks

机译:对云无线电接入网的感知网络代码进行评分

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

获取外文期刊封面封底 >>

       

摘要

Cloud radio access networks (C-RAN) gained much attention thanks to their abilities in mitigating interference and providing high data rates by coordinating multiple Remote Radio Heads (RRHs). This paper considers the use of rate aware instantly decodable network coding (RA-IDNC) as a mean to accelerate the broadcast of a set of messages to a set of users in a C-RAN setting. While previous works focus either on rate-unaware IDNC or rate adaptation for traditional single transmitter systems, this paper extends the results to C-RANs. The various ergodic capacities of the different users to the different RRHs bring a new trade-off between the number of scheduled users and the transmission rates. The proposed framework incorporates such information in the network coding decisions, so as the scheduled users, coded messages, and transmission rates reduce the overall completion time. Given the intractability of the problem, the paper proposes relaxing the optimization by an online approach involving an anticipated version of the completion time which allows mapping the possible associations between users, RRHs, coded packets, and transmission rates to vertices in a newly designed graph. Afterward, the online completion time reduction problem is shown to be equivalent to a maximum weight independent set problem over the proposed graph. Simulation results reveal that the proposed scheme achieves substantial performance gain over uncoded and NC rate-unaware algorithms.
机译:云无线电接入网(C-RAN)由于能够通过协调多个远程无线电头(RRH)来减轻干扰并提供高数据速率,因此备受关注。本文考虑使用速率感知即时可解码网络编码(RA-IDNC)作为在C-RAN设置中加速向一组用户广播一组消息的手段。尽管先前的工作要么专注于速率未知的IDNC,要么专注于传统单发射机系统的速率适配,但本文将结果扩展到了C-RAN。不同用户对不同RRH的各种遍历能力在预定用户数和传输速率之间带来了新的权衡。所提出的框架在网络编码决策中纳入了此类信息,因此调度的用户,编码的消息和传输速率减少了总体完成时间。考虑到问题的棘手性,本文建议通过在线方法放松优化,该方法涉及完成时间的预期版本,该方法允许将用户,RRH,编码数据包和传输速率之间的可能关联映射到新设计图形中的顶点。此后,在线完成时间减少问题显示为等效于建议图的最大权重独立设置问题。仿真结果表明,与未编码和不知道NC速率的算法相比,该方案可显着提高性能。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号