在无线D2D网络上具有保证QoS的实时流

Navid Abedini, Swetha Sampath, Rajarshi Bhattacharyya, Suman Paul, S. Shakkottai
{"title":"在无线D2D网络上具有保证QoS的实时流","authors":"Navid Abedini, Swetha Sampath, Rajarshi Bhattacharyya, Suman Paul, S. Shakkottai","doi":"10.1145/2491288.2491308","DOIUrl":null,"url":null,"abstract":"We consider a group of co-located wireless peer devices that desire to synchronously receive a live content stream. The devices are each equipped with an expensive unicast base-station-to-device (B2D) interface, as well as a broadcast device-to-device (D2D) interface over a shared medium. The stream is divided into blocks, which must be played out soon after their initial creation. If a block is not received within a specific time after its creation, it is rendered useless and dropped. The blocks in turn are divided into random linear coded chunks to facilitate sharing across the devices. We transform the problem into the two questions of (i) deciding which peer should broadcast a chunk on the D2D channel at each time, and (ii) how long B2D transmissions should take place for each block. We analytically develop a provably-minimum-cost algorithm that can ensure that QoS targets can be met for each device. We study its performance via simulations, and present an overview of our implementation on Android phones using the algorithm as a basis.","PeriodicalId":234414,"journal":{"name":"Proceedings of the fourteenth ACM international symposium on Mobile ad hoc networking and computing","volume":"291 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2013-07-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"26","resultStr":"{\"title\":\"Realtime streaming with guaranteed QoS over wireless D2D networks\",\"authors\":\"Navid Abedini, Swetha Sampath, Rajarshi Bhattacharyya, Suman Paul, S. Shakkottai\",\"doi\":\"10.1145/2491288.2491308\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We consider a group of co-located wireless peer devices that desire to synchronously receive a live content stream. The devices are each equipped with an expensive unicast base-station-to-device (B2D) interface, as well as a broadcast device-to-device (D2D) interface over a shared medium. The stream is divided into blocks, which must be played out soon after their initial creation. If a block is not received within a specific time after its creation, it is rendered useless and dropped. The blocks in turn are divided into random linear coded chunks to facilitate sharing across the devices. We transform the problem into the two questions of (i) deciding which peer should broadcast a chunk on the D2D channel at each time, and (ii) how long B2D transmissions should take place for each block. We analytically develop a provably-minimum-cost algorithm that can ensure that QoS targets can be met for each device. We study its performance via simulations, and present an overview of our implementation on Android phones using the algorithm as a basis.\",\"PeriodicalId\":234414,\"journal\":{\"name\":\"Proceedings of the fourteenth ACM international symposium on Mobile ad hoc networking and computing\",\"volume\":\"291 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2013-07-29\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"26\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of the fourteenth ACM international symposium on Mobile ad hoc networking and computing\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/2491288.2491308\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the fourteenth ACM international symposium on Mobile ad hoc networking and computing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/2491288.2491308","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 26

摘要

我们考虑一组位于同一位置的无线对等设备,它们希望同步接收实时内容流。每个设备都配备了昂贵的单播基站到设备(B2D)接口,以及共享介质上的广播设备到设备(D2D)接口。流被分成几个块,这些块必须在它们最初创建后很快被播放出来。如果一个块在创建后的特定时间内没有被接收,那么它将被视为无用并丢弃。这些块依次被分成随机的线性编码块,以便于在设备之间共享。我们将这个问题转化为两个问题:(i)决定哪一个对等点每次应该在D2D通道上广播一个块,以及(ii)每个块应该进行多长时间的B2D传输。我们分析地开发了一种可证明的最小代价算法,可以确保每个设备都能满足QoS目标。我们通过模拟研究了它的性能,并以该算法为基础,概述了我们在Android手机上的实现。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Realtime streaming with guaranteed QoS over wireless D2D networks
We consider a group of co-located wireless peer devices that desire to synchronously receive a live content stream. The devices are each equipped with an expensive unicast base-station-to-device (B2D) interface, as well as a broadcast device-to-device (D2D) interface over a shared medium. The stream is divided into blocks, which must be played out soon after their initial creation. If a block is not received within a specific time after its creation, it is rendered useless and dropped. The blocks in turn are divided into random linear coded chunks to facilitate sharing across the devices. We transform the problem into the two questions of (i) deciding which peer should broadcast a chunk on the D2D channel at each time, and (ii) how long B2D transmissions should take place for each block. We analytically develop a provably-minimum-cost algorithm that can ensure that QoS targets can be met for each device. We study its performance via simulations, and present an overview of our implementation on Android phones using the algorithm as a basis.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术文献互助群
群 号:604180095
Book学术官方微信