首页> 外文会议>IEEE Wireless Communications and Networking Conference >End-to-end Throughput Optimization in Multi-hop Wireless Networks with Cut-through Capability
【24h】

End-to-end Throughput Optimization in Multi-hop Wireless Networks with Cut-through Capability

机译:具有直通能力的多跳无线网络中的端到端吞吐量优化

获取原文

摘要

In-band full-duplex (FD) technique can efficiently improve the end-to-end throughput of a multi-hop network via enabling multi-hop FD amplify-and-forward relaying (cut-through) transmission. This paper investigates the optimal hop size of a cut-through transmission and spatial reuse to achieve the maximum achievable end-to-end throughput of a multi-hop network. In particular, we consider spatial reuse and establish an interference model for a string-topology multi-hop network with x-hop cut-through transmission, and show that the maximum achievable end-to-end throughput is a function of x and the spatial separation between two concurrently active cut-through transmissions. Through extensive numerical studies, we show that the achievable date rate of a cut-through transmission drastically decreases along with the increase of the hop size x. Furthermore, we find that the 2-hop cut-through transmission mode can always achieve the maximum end-to-end throughput using Shannon Capacity formula if the spatial reuse is properly addressed. On the other hand, the results show that the 5-hop cut-through transmission mode can obtain the maximum end-to-end throughput with discrete channel rates when the self-interference cancellation is perfect and the hop distance is small.
机译:带内全双工(FD)技术可以通过启用多跳FD放大转发中继(直通)传输来有效地提高多跳网络的端到端吞吐量。本文研究了直通传输和空间复用的最佳跳跃大小,以实现多跳网络的最大可实现端到端吞吐量。特别是,我们考虑了空间重用,并为具有x跳直通传输的字符串拓扑多跳网络建立了干扰模型,并表明最大可实现的端到端吞吐量是x和空间的函数。两个同时激活的直通传输之间的分隔。通过大量的数值研究,我们表明直通传输的可实现日期率随着跳数x的增加而急剧下降。此外,我们发现,如果正确解决了空间复用问题,那么使用香农容量公式,2跳直通式传输模式始终可以实现最大的端到端吞吐量。另一方面,结果表明,当自干扰消除效果理想且跳距较小时,五跳直通传输模式可以在信道速率离散的情况下获得最大的端到端吞吐量。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号