首页> 外文期刊>Computer networks >Opportunistic network coding based cooperative retransmissions in D2D communications
【24h】

Opportunistic network coding based cooperative retransmissions in D2D communications

机译:D2D通信中基于机会网络编码的协作重传

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

摘要

Device-to-Device (D2D) communications can improve the performance of the next generation cellular networks by facilitating the transmission of cellular traffic without additional infrastructure. In D2D communications, cooperative retransmission can be employed to assist the recovery of lost packets at proximity devices by sending coded packets. However, most existing work did not consider the issue of how the transmissions among neighbor devices can be well scheduled to support efficient network coding based retransmissions. Decoupling transmission scheduling from coding decision making can lead to inefficient D2D packet retransmissions and thus reduced overall network performance. In this paper, we study how to use opportunistic network coding based transmission scheduling to assist the cooperative packet recovery in D2D environment. For this purpose, we first formulate the problem of jointly optimization of transmitting device selection and also their coding patterns as minimum latency scheduling problem, which is known to be NP-hard. We further present a low complexity centralized algorithm and a distributed mechanism that does not require synchronization (either global or local) among devices. We derive the complexity of the proposed algorithms. Simulation results show that the performance of centralized algorithm is very close to the theoretical lower bounds and the distributed mechanism can achieve high performance in accelerating packet recovery. (C) 2016 Elsevier B.V. All rights reserved.
机译:设备到设备(D2D)通信可通过促进蜂窝流量的传输而无需其他基础架构来提高下一代蜂窝网络的性能。在D2D通信中,协作重传可用于通过发送编码数据包来协助在邻近设备处恢复丢失的数据包。但是,大多数现有工作并未考虑如何很好地安排相邻设备之间的传输以支持基于有效网络编码的重传的问题。将传输调度与编码决策脱钩会导致低效率的D2D数据包重传,从而降低整体网络性能。在本文中,我们研究了如何使用基于机会网络编码的传输调度来协助D2D环境中的协作包恢复。为此,我们首先将共同优化发送设备选择及其编码模式的问题表述为最小等待时间调度问题,这被认为是NP难的。我们进一步提出了一种低复杂度的集中式算法和一种分布式机制,该机制不需要设备之间的同步(全局或本地)。我们推导了所提出算法的复杂性。仿真结果表明,集中式算法的性能非常接近理论下限,分布式机制在加速数据包恢复方面可以达到较高的性能。 (C)2016 Elsevier B.V.保留所有权利。

著录项

  • 来源
    《Computer networks》 |2017年第11期|72-83|共12页
  • 作者

    Yan Yan; Zhang Baoxian; Li Cheng;

  • 作者单位

    Univ Chinese Acad Sci, Res Ctr Ubiquitous Sensor Networks, Beijing, Peoples R China;

    Univ Chinese Acad Sci, Res Ctr Ubiquitous Sensor Networks, Beijing, Peoples R China;

    Mem Univ, Fac Engn & Appl Sci, St John, NF A1B 3X5, Canada;

  • 收录信息
  • 原文格式 PDF
  • 正文语种 eng
  • 中图分类
  • 关键词

    Network coding; D2D; Cooperative communications;

    机译:网络编码;D2D;合作通信;

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号