• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文期刊>Vehicular Technology, IEEE Transactions on >Opportunistic Relaying in Wireless Ad Hoc Networks With Controllable Delay–Throughput Tradeoffs
【24h】

Opportunistic Relaying in Wireless Ad Hoc Networks With Controllable Delay–Throughput Tradeoffs

机译：具有可控制的时延-吞吐量折衷的无线自组织网络中的机会中继

获取原文
获取原文并翻译 | 示例
           
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

Driven by the fact that communication devices have become increasingly pervasive and have grown much faster than the infrastructure relay support, a specific wireless setup, which consists of a large number of source and destination nodes and a relatively small number of relays, has drawn significant attention recently. One of the notable works concentrating on this setup is the two-hop opportunistic relaying (THOR) scheme proposed by Cui By connecting the receivers to the best transmitters for each hop individually, THOR maintains a linearly scalable network with affordable overhead. Notwithstanding the appealing implementation simplicity, THOR can suffer from communication and decoding delay, rendering it difficult to support delay-sensitive applications. The objective of this paper is to explore the possibility of achieving a controllable elay–throughput tradeoff without sacrificing linear throughput scaling. We begin with an opportunistic pair scheduling (OPS) scheme by restricting the relays to schedule only matched source–destination (S–D) pairs. This scheme is found to maintain throughput linearity and to reduce the end-to-end delay to the minimum as well. In particular, it is shown that OPS achieves a throughput scaling of for Nakagami fading with the corresponding fading parameter , taking integer values and a throughput of under Rayleigh fading. To achieve a different throughput–delay tradeoff in a controlled manner, we then develop this scheme further into a general -scheduling scheme, which captures THOR and OPS as two extreme cases. By- adjusting design parameter , the desired tradeoff can be achieved, catering to applications with diverse delay and throughput requirements. Simulation results validate our theoretic findings and demonstrate the flexibility of the proposed schemes.
机译：由于通信设备变得越来越普及，并且其增长速度远远超过了基础结构中继支持，因此由大量源节点和目标节点以及相对较少的中继组成的特定无线设置引起了广泛关注。最近。集中于此设置的一项著名工作是Cui提出的两跳机会中继（THOR）方案。通过将接收器分别连接到每个跳的最佳发送器，THOR维护了线性可扩展网络，负担得起的开销。尽管实现起来很简单，但是THOR可能会遭受通信和解码延迟的困扰，这使得难以支持对延迟敏感的应用程序。本文的目的是探索在不牺牲线性吞吐量缩放的情况下实现可控的elay-throughput权衡的可能性。我们从机会对调度（OPS）方案开始，将中继限制为仅调度匹配的源－目标（SD）对。发现该方案可保持吞吐量线性，并将端到端延迟也减小到最小。特别地，示出了OPS利用相应的衰落参数，采用整数值和在瑞利衰落下的吞吐量来实现针对中上衰落的吞吐量缩放。为了以受控的方式实现不同的吞吐量-延迟权衡，我们随后将该方案进一步发展为通用调度方案，该方案将THOR和OPS捕获为两种极端情况。通过调整设计参数，可以实现所需的折衷，从而满足具有各种延迟和吞吐量要求的应用。仿真结果验证了我们的理论发现，并证明了所提出方案的灵活性。

著录项

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号