Opportunistic scheduling in a bidirectional communication link with relaying

H. Meshgi, Dongmei Zhao
{"title":"Opportunistic scheduling in a bidirectional communication link with relaying","authors":"H. Meshgi, Dongmei Zhao","doi":"10.1109/ICC.2012.6364366","DOIUrl":null,"url":null,"abstract":"In this paper we study transmission scheduling in a bidirectional communication link, where two end nodes are communicating with each other through a relay node. Each of the two end nodes injects data into a separate buffer at the relay node, which can either forward the data from one end node to the other at a given time (referred to as one-way relay), or simultaneously forwarding the data to both the end nodes by using network coding (referred to as two-way relay). An optimization problem is formulated to find the optimum scheduling in order to maximize the total transmission throughput in both communication directions, and a heuristic scheduling scheme is proposed to opportunistically take advantages of both the channel conditions between the two end nodes and the one-way and two-way relays. Numerical results show that the proposed scheme achieves high and close-to-optimum throughput.","PeriodicalId":331080,"journal":{"name":"2012 IEEE International Conference on Communications (ICC)","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2012-06-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"9","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2012 IEEE International Conference on Communications (ICC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICC.2012.6364366","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 9

Abstract

In this paper we study transmission scheduling in a bidirectional communication link, where two end nodes are communicating with each other through a relay node. Each of the two end nodes injects data into a separate buffer at the relay node, which can either forward the data from one end node to the other at a given time (referred to as one-way relay), or simultaneously forwarding the data to both the end nodes by using network coding (referred to as two-way relay). An optimization problem is formulated to find the optimum scheduling in order to maximize the total transmission throughput in both communication directions, and a heuristic scheduling scheme is proposed to opportunistically take advantages of both the channel conditions between the two end nodes and the one-way and two-way relays. Numerical results show that the proposed scheme achieves high and close-to-optimum throughput.
带中继的双向通信链路中的机会调度
本文研究了双向通信链路中两端节点通过中继节点相互通信的传输调度问题。两个端节点中的每一个都将数据注入中继节点上的一个单独的缓冲区,该缓冲区可以在给定的时间将数据从一个端节点转发到另一个端节点(称为单向中继),也可以通过使用网络编码将数据同时转发到两个端节点(称为双向中继)。为了使两个通信方向上的总传输吞吐量最大化,提出了一个优化问题,并提出了一种启发式调度方案,以机会地利用两端节点之间的信道条件和单向和双向中继。数值结果表明,该方案达到了较高且接近最优的吞吐量。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信