...
首页> 外文期刊>IEEE Transactions on Communications >Low-Latency Data Sharing in Erasure Multi-Way Relay Channels
【24h】

Low-Latency Data Sharing in Erasure Multi-Way Relay Channels

机译:擦除多路中继通道中的低延迟数据共享

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

摘要

We consider an erasure multi-way relay channel (EMWRC) in which several users share their data through a relay over erasure links. Assuming no feedback channel between the users and the relay, we first identify the challenges for designing a data sharing scheme over an EMWRC. Then, to overcome these challenges, we propose practical low-latency and low-complexity data sharing schemes based on fountain coding. Later, we introduce the notion of end-to-end erasure rate (EEER) and analytically derive it for the proposed schemes. EEER is then used to calculate the achievable rate and transmission overhead of the proposed schemes. Using EEER and computer simulations, the achievable rates and transmission overhead of our proposed schemes are compared with the ones of one-way relaying. This comparison implies that when the number of users and the channel erasure rates are not large, our proposed schemes outperform one-way relaying. We also find an upper bound on the achievable rates of EMWRC and observe that depending on the number of users and channel erasure rates, our proposed solutions can perform very close to this bound.
机译:我们考虑一个擦除多路中继通道(EMWRC),其中多个用户通过擦除链路上的中继共享数据。假设用户和中继之间没有反馈通道,我们首先确定在EMWRC上设计数据共享方案的挑战。然后,为了克服这些挑战,我们提出了基于喷泉编码的实用的低延迟和低复杂度数据共享方案。随后,我们介绍了端到端擦除率(EEER)的概念,并从分析上推导了所提出的方案。然后使用EEER来计算所提出方案的可实现速率和传输开销。使用EEER和计算机模拟,将我们提出的方案的可实现速率和传输开销与单向中继的方案进行了比较。这种比较表明,当用户数和信道擦除率不大时,我们提出的方案要优于单向中继。我们还找到了可实现的EMWRC速率的上限,并观察到,根据用户数量和信道擦除率,我们提出的解决方案可以非常接近此上限。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号