Multicast Scheduling for Relay-Based Heterogeneous Networks Using Rateless Codes
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Chen, Chao | - |
dc.contributor.author | Baek, Seung Jun | - |
dc.date.accessioned | 2021-09-02T23:11:13Z | - |
dc.date.available | 2021-09-02T23:11:13Z | - |
dc.date.created | 2021-06-19 | - |
dc.date.issued | 2017-11-01 | - |
dc.identifier.issn | 1536-1233 | - |
dc.identifier.uri | https://scholar.korea.ac.kr/handle/2021.sw.korea/81594 | - |
dc.description.abstract | We consider the multicast scheduling problem in the heterogeneous network using a half-duplex relay station (RS). Our goal is to minimize the delay of transmitting a block of packets to users over time-varying channels using rateless codes. Due to half-duplex operation, at each time slot, the RS can choose to either multicast a packet to the users, or fetch a packet from the macro base station. We formulate a fluid relaxation for the optimal decision problem, and reveal that the optimal policy has a threshold-based structure so as to exploit the opportunism of multicast channel: the RS should multicast only when the channel quality is sufficiently "high". We propose an online policy based on the relaxation which does not require the knowledge of channel distribution. When the channel distribution is symmetric across users, we provide a closed-form expression of the asymptotic performance of our policy. For two-user systems, we prove that our scheme is asymptotically optimal. When the users' channels are independent, we derive a performance bound based on water-filling rate allocation which approximates the optimal policy well. Simulation results show that our scheme performs close to theoretical bounds, under correlated as well as independent fading channels. | - |
dc.language | English | - |
dc.language.iso | en | - |
dc.publisher | IEEE COMPUTER SOC | - |
dc.subject | TRACKING | - |
dc.subject | POLICIES | - |
dc.title | Multicast Scheduling for Relay-Based Heterogeneous Networks Using Rateless Codes | - |
dc.type | Article | - |
dc.contributor.affiliatedAuthor | Baek, Seung Jun | - |
dc.identifier.doi | 10.1109/TMC.2017.2687928 | - |
dc.identifier.scopusid | 2-s2.0-85032294068 | - |
dc.identifier.wosid | 000412231100012 | - |
dc.identifier.bibliographicCitation | IEEE TRANSACTIONS ON MOBILE COMPUTING, v.16, no.11, pp.3142 - 3155 | - |
dc.relation.isPartOf | IEEE TRANSACTIONS ON MOBILE COMPUTING | - |
dc.citation.title | IEEE TRANSACTIONS ON MOBILE COMPUTING | - |
dc.citation.volume | 16 | - |
dc.citation.number | 11 | - |
dc.citation.startPage | 3142 | - |
dc.citation.endPage | 3155 | - |
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 | Telecommunications | - |
dc.relation.journalWebOfScienceCategory | Computer Science, Information Systems | - |
dc.relation.journalWebOfScienceCategory | Telecommunications | - |
dc.subject.keywordPlus | TRACKING | - |
dc.subject.keywordPlus | POLICIES | - |
dc.subject.keywordAuthor | Relay networks | - |
dc.subject.keywordAuthor | rateless codes | - |
dc.subject.keywordAuthor | opportunistic scheduling | - |
dc.subject.keywordAuthor | fluid approximation | - |
dc.subject.keywordAuthor | asymptotic optimality | - |
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.