...
首页> 外文期刊>IEEE Transactions on Information Theory >On the Complexity of Scheduling in Half-Duplex Diamond Networks
【24h】

On the Complexity of Scheduling in Half-Duplex Diamond Networks

机译:半双工菱形网络中调度的复杂性

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

摘要

We consider an -relay Gaussian diamond network where a source communicates to a destination with the help of half-duplex relays. Achieving rates close to the capacity of this network requires to employ all the relays under an optimal transmit/receive schedule. Even for the moderate values of , this can have significant operational complexity as the optimal schedule may possibly have different states for the network (since each of the relays can be in either transmitting or receiving mode). In this paper, we investigate whether a significant fraction of the network capacity can be achieved by using transmit/receive schedules that have only few active states and by using only few relays. First, we conjecture that the approximately optimal schedule has at most states instead of the possible states. We prove this conjecture for networks of size by developing a proof strategy and implementing it computationally. Second, we show that routing strategies that only employ the point-to-point communication and two of the relays with a half-duplex schedule that has only two active states can achieve at least half the capacity (approximately) of the network. Techniques from linear programming and submodular functions are used to derive the results.
机译:我们考虑一个中继高斯菱形网络,其中源借助半双工中继与目的地进行通信。为了达到接近该网络容量的速率,需要在最佳发送/接收时间表下使用所有中继。即使对于的中等值,这也会具有很大的操作复杂性,因为最佳调度可能对网络具有不同的状态(因为每个中继都可以处于发送或接收模式)。在本文中,我们研究了通过使用仅具有少量活动状态的发送/接收计划以及仅使用少量中继器是否可以实现很大一部分网络容量。首先,我们推测近似最优进度表最多包含状态,而不是可能的状态。通过制定证明策略并通过计算实现,我们证明了对规模网络的这种猜想。其次,我们表明仅采用点对点通信的路由策略和具有半双工调度的两个中继(仅具有两个活动状态)可以实现网络容量的至少一半(大约)。使用线性编程和子模函数的技术来得出结果。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号