首页> 外文会议>2013 Information Theory and Applications Workshop >A scaling law approach to wireless relay networks
【24h】

A scaling law approach to wireless relay networks

机译:无线中继网络的缩放定律方法

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

摘要

There has been significant recent progress in understanding approximately optimal relaying strategies for wireless networks, such as quantize-map-and-forward, noisy network coding, amplify-and-forward, etc. While one can construct specific instances of networks, with specific topology and channel configurations, where each one of these strategies can provide significant gains over simple strategies such as routing and direct transmission, it is not clear how much gain these more sophisticated strategies can provide in generic setups. In this paper, we follow a scaling law approach and assume that nodes are randomly distributed over the network area and the channels between them are governed by a path-loss model. This approach has been used to demonstrate the benefits of sophisticated cooperation in networks with multiple unicast flows both in the high and the low SNR regimes. However, for a single unicast flow, we show that more sophisticated relaying can not provide significant gain over simple multi-hop or direct transmission both in the high and the low-SNR regimes, if the nodes are uniformly distributed over the network area. More sophisticated relaying is needed in networks where nodes are clustered in the low to moderate SNR regimes. We propose a cluster decode-and-forward strategy that is scaling optimal.
机译:最近在理解无线网络的最佳中继策略方面取得了重大进展,例如量化映射转发,有噪声的网络编码,放大转发等。虽然可以构造具有特定拓扑的特定网络实例在信道配置方面,这些策略中的每一种都可以比简单的策略(例如路由和直接传输)提供更大的收益,但不清楚这些更复杂的策略在通用设置中可以提供多少收益。在本文中,我们遵循缩放定律方法,并假定节点随机分布在网络区域上,并且它们之间的通道由路径损耗模型控制。此方法已被用来证明在高和低SNR体制中具有多个单播流的网络中进行复杂协作的好处。但是,对于单个单播流,我们表明,如果节点均匀分布在网络区域中,则无论是在高信噪比还是在低信噪比情况下,更复杂的中继都无法通过简单的多跳或直接传输提供显着的收益。在节点以低到中等的SNR方式群集的网络中,需要更复杂的中继。我们提出了一种扩展最佳的集群解码和转发策略。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号