SC-PTM中一种高效的直播服务组播方案

Tsern-Huei Lee, Wei-Chieh Liu, A. Hsu
{"title":"SC-PTM中一种高效的直播服务组播方案","authors":"Tsern-Huei Lee, Wei-Chieh Liu, A. Hsu","doi":"10.1109/VTCFall.2019.8891159","DOIUrl":null,"url":null,"abstract":"Live streaming applications over wireless mobile networks have increased dramatically in recent years. In most current systems, the media center is capable of providing multiple streams of different qualities and each individual viewer selects its own stream based on channel condition and/or other considerations. This may result in inefficient use of radio resource. In this paper, we propose to let evolved node B, which has the channel conditions of all viewers, decide which streams should be delivered so that the total throughput is maximized, subject to the constraints that every viewer can successfully decode at least one stream and the radio resource consumed is under a pre-determined threshold. For a system that has many possible modulation and coding schemes, it requires huge computational complexity to obtain the optimum solution. We present a greedy algorithm which tends to find a solution that allows more viewers to decode higher quality streams. Simulation results show that the total throughputs achieved by the greedy algorithm for various scenarios are close to those of the optimum solutions.","PeriodicalId":6713,"journal":{"name":"2019 IEEE 90th Vehicular Technology Conference (VTC2019-Fall)","volume":"54 1","pages":"1-5"},"PeriodicalIF":0.0000,"publicationDate":"2019-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"An Efficient Multicast Scheme for Live Streaming Services in SC-PTM\",\"authors\":\"Tsern-Huei Lee, Wei-Chieh Liu, A. Hsu\",\"doi\":\"10.1109/VTCFall.2019.8891159\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Live streaming applications over wireless mobile networks have increased dramatically in recent years. In most current systems, the media center is capable of providing multiple streams of different qualities and each individual viewer selects its own stream based on channel condition and/or other considerations. This may result in inefficient use of radio resource. In this paper, we propose to let evolved node B, which has the channel conditions of all viewers, decide which streams should be delivered so that the total throughput is maximized, subject to the constraints that every viewer can successfully decode at least one stream and the radio resource consumed is under a pre-determined threshold. For a system that has many possible modulation and coding schemes, it requires huge computational complexity to obtain the optimum solution. We present a greedy algorithm which tends to find a solution that allows more viewers to decode higher quality streams. Simulation results show that the total throughputs achieved by the greedy algorithm for various scenarios are close to those of the optimum solutions.\",\"PeriodicalId\":6713,\"journal\":{\"name\":\"2019 IEEE 90th Vehicular Technology Conference (VTC2019-Fall)\",\"volume\":\"54 1\",\"pages\":\"1-5\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2019-09-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2019 IEEE 90th Vehicular Technology Conference (VTC2019-Fall)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/VTCFall.2019.8891159\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2019 IEEE 90th Vehicular Technology Conference (VTC2019-Fall)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/VTCFall.2019.8891159","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

近年来,无线移动网络上的直播应用急剧增加。在大多数当前的系统中,媒体中心能够提供不同质量的多个流,每个观众根据信道条件和/或其他考虑因素选择自己的流。这可能导致无线电资源的低效利用。在本文中,我们建议让进化节点B,它具有所有观察者的信道条件,决定应该发送哪些流,以使总吞吐量最大化,但要遵守每个观察者至少可以成功解码一个流并且消耗的无线电资源在预定阈值以下的约束。对于具有多种可能的调制和编码方案的系统,要获得最优解需要巨大的计算复杂度。我们提出了一个贪心算法,它倾向于找到一个解决方案,允许更多的观众解码更高质量的流。仿真结果表明,贪心算法在各种情况下的总吞吐量都接近于最优解。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
An Efficient Multicast Scheme for Live Streaming Services in SC-PTM
Live streaming applications over wireless mobile networks have increased dramatically in recent years. In most current systems, the media center is capable of providing multiple streams of different qualities and each individual viewer selects its own stream based on channel condition and/or other considerations. This may result in inefficient use of radio resource. In this paper, we propose to let evolved node B, which has the channel conditions of all viewers, decide which streams should be delivered so that the total throughput is maximized, subject to the constraints that every viewer can successfully decode at least one stream and the radio resource consumed is under a pre-determined threshold. For a system that has many possible modulation and coding schemes, it requires huge computational complexity to obtain the optimum solution. We present a greedy algorithm which tends to find a solution that allows more viewers to decode higher quality streams. Simulation results show that the total throughputs achieved by the greedy algorithm for various scenarios are close to those of the optimum solutions.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Towards Emergency Braking as a Fail-Safe State in Platooning: A Simulative Approach Online Task Offloading with Bandit Learning in Fog-Assisted IoT Systems Hybrid Localization: A Low Cost, Low Complexity Approach Based on Wi-Fi and Odometry Residual Energy Optimization for MIMO SWIPT Two-Way Relaying System Traffic Forecast in Mobile Networks: Classification System Using Machine Learning
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1