Opportunistic Scheduling of Randomly Coded Multicast Transmissions at Half-Duplex Relay Stations
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Chen, Chao | - |
dc.contributor.author | Baek, Seung Jun | - |
dc.contributor.author | de Veciana, Gustavo | - |
dc.date.accessioned | 2021-09-03T19:15:44Z | - |
dc.date.available | 2021-09-03T19:15:44Z | - |
dc.date.created | 2021-06-16 | - |
dc.date.issued | 2016-10 | - |
dc.identifier.issn | 0018-9448 | - |
dc.identifier.uri | https://scholar.korea.ac.kr/handle/2021.sw.korea/87318 | - |
dc.description.abstract | We consider the multicast scheduling problem for the block transmission of packets in a heterogeneous network using a half-duplex relay station (RS). The RS uses random linear coding to efficiently transmit packets over time-varying multicast channels. Our goal is to minimize the average decoding delay. Because of the half-duplex operation, at each time slot, the RS must decide to either: 1) fetch a new packet for encoding from the base station or 2) multicast a coded packet to wireless users. Thus, optimal scheduling hinges on exploiting multicast opportunities while persistently supplying the encoder (at the RS) with new packets. We formulate an associated fluid control problem and show that the optimal policy incorporates opportunism across multicast channels, i.e., the RS performs a multicast transmission only if the collection of channel conditions is favorable; otherwise, it performs a fetch. Based on the fluid policy, we propose an online algorithm. We prove that our algorithm asymptotically incurs no more than 4/3 and 2 times the optimal delay, for two-user and arbitrary number of user system, respectively. Simulation results show that, in fact, our algorithm's performance is very close to theoretical bounds. | - |
dc.language | English | - |
dc.language.iso | en | - |
dc.publisher | IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC | - |
dc.subject | NETWORKS | - |
dc.subject | THROUGHPUT | - |
dc.subject | TRACKING | - |
dc.subject | CHANNEL | - |
dc.subject | DELAY | - |
dc.subject | MODEL | - |
dc.title | Opportunistic Scheduling of Randomly Coded Multicast Transmissions at Half-Duplex Relay Stations | - |
dc.type | Article | - |
dc.contributor.affiliatedAuthor | Baek, Seung Jun | - |
dc.identifier.doi | 10.1109/TIT.2016.2537837 | - |
dc.identifier.scopusid | 2-s2.0-84988637618 | - |
dc.identifier.wosid | 000384304600017 | - |
dc.identifier.bibliographicCitation | IEEE TRANSACTIONS ON INFORMATION THEORY, v.62, no.10, pp.5538 - 5555 | - |
dc.relation.isPartOf | IEEE TRANSACTIONS ON INFORMATION THEORY | - |
dc.citation.title | IEEE TRANSACTIONS ON INFORMATION THEORY | - |
dc.citation.volume | 62 | - |
dc.citation.number | 10 | - |
dc.citation.startPage | 5538 | - |
dc.citation.endPage | 5555 | - |
dc.type.rims | ART | - |
dc.type.docType | Article | - |
dc.description.journalClass | 1 | - |
dc.description.journalRegisteredClass | scie | - |
dc.description.journalRegisteredClass | scopus | - |
dc.relation.journalResearchArea | Computer Science | - |
dc.relation.journalResearchArea | Engineering | - |
dc.relation.journalWebOfScienceCategory | Computer Science, Information Systems | - |
dc.relation.journalWebOfScienceCategory | Engineering, Electrical & Electronic | - |
dc.subject.keywordPlus | NETWORKS | - |
dc.subject.keywordPlus | THROUGHPUT | - |
dc.subject.keywordPlus | TRACKING | - |
dc.subject.keywordPlus | CHANNEL | - |
dc.subject.keywordPlus | DELAY | - |
dc.subject.keywordPlus | MODEL | - |
dc.subject.keywordAuthor | Heterogeneous networks | - |
dc.subject.keywordAuthor | network coding | - |
dc.subject.keywordAuthor | opportunistic scheduling | - |
dc.subject.keywordAuthor | fluid approximation | - |
dc.subject.keywordAuthor | asymptotic performance | - |
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.
(02841) 서울특별시 성북구 안암로 14502-3290-1114
COPYRIGHT © 2021 Korea University. All Rights Reserved.
Certain data included herein are derived from the © Web of Science of Clarivate Analytics. All rights reserved.
You may not copy or re-distribute this material in whole or in part without the prior written consent of Clarivate Analytics.