{"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.