基于云压缩的免下车车辆网络有效准入控制研究

Xiaonan Su, Changle Li, T. Luan, Zhifang Miao
{"title":"基于云压缩的免下车车辆网络有效准入控制研究","authors":"Xiaonan Su, Changle Li, T. Luan, Zhifang Miao","doi":"10.1109/ICCChina.2017.8330527","DOIUrl":null,"url":null,"abstract":"Providing vehicles with various services is an challenging issue for roadside units to support applications in future Intelligent Transportation System (ITS). Since each vehicle has only a limited period of time passing through a roadside unit, how to guarantee service data to be downloaded in time has been brought to the front. In this paper, we focus on the admission control problem, which is especially significant in overloaded conditions where tens of vehicles may share the resource of one roadside unit. To enhance downloading efficiency, we employ vehicular cloud which is extremely promising in future ITS to compute downloading time and compress contents. We propose an admission control scheme that calculates and increases the probability of successful downloads in a drive-thru system, which also promotes users' quality of experience. In addition, we formulate the admission control issue as a linear programming problem, and utilize a branch-and-bound algorithm to solve it. Simulations demonstrate that our proposed scheme reduces tasks failure notably and outperforms two regular downloading schemes in terms of throughput.","PeriodicalId":418396,"journal":{"name":"2017 IEEE/CIC International Conference on Communications in China (ICCC)","volume":"144 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2017-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"On efficient admission control utilizing cloud compression in drive-thru vehicular networks\",\"authors\":\"Xiaonan Su, Changle Li, T. Luan, Zhifang Miao\",\"doi\":\"10.1109/ICCChina.2017.8330527\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Providing vehicles with various services is an challenging issue for roadside units to support applications in future Intelligent Transportation System (ITS). Since each vehicle has only a limited period of time passing through a roadside unit, how to guarantee service data to be downloaded in time has been brought to the front. In this paper, we focus on the admission control problem, which is especially significant in overloaded conditions where tens of vehicles may share the resource of one roadside unit. To enhance downloading efficiency, we employ vehicular cloud which is extremely promising in future ITS to compute downloading time and compress contents. We propose an admission control scheme that calculates and increases the probability of successful downloads in a drive-thru system, which also promotes users' quality of experience. In addition, we formulate the admission control issue as a linear programming problem, and utilize a branch-and-bound algorithm to solve it. Simulations demonstrate that our proposed scheme reduces tasks failure notably and outperforms two regular downloading schemes in terms of throughput.\",\"PeriodicalId\":418396,\"journal\":{\"name\":\"2017 IEEE/CIC International Conference on Communications in China (ICCC)\",\"volume\":\"144 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2017-10-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2017 IEEE/CIC International Conference on Communications in China (ICCC)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICCChina.2017.8330527\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2017 IEEE/CIC International Conference on Communications in China (ICCC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCChina.2017.8330527","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

为车辆提供各种服务是路边单位支持未来智能交通系统应用的一个具有挑战性的问题。由于每辆车通过路边单元的时间是有限的,如何保证服务数据的及时下载就被提到了前台。在本文中,我们重点研究了接纳控制问题,这在超载情况下尤其重要,因为数十辆车可能共享一个路边单元的资源。为了提高下载效率,我们采用了在未来ITS中极具潜力的车载云计算下载时间和压缩内容。我们提出了一种准入控制方案,该方案计算并增加了驾车通道系统中成功下载的概率,这也提高了用户的体验质量。此外,我们将接纳控制问题表述为线性规划问题,并利用分支定界算法来求解。仿真结果表明,该方案显著减少了任务失败,并且在吞吐量方面优于两种常规下载方案。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
On efficient admission control utilizing cloud compression in drive-thru vehicular networks
Providing vehicles with various services is an challenging issue for roadside units to support applications in future Intelligent Transportation System (ITS). Since each vehicle has only a limited period of time passing through a roadside unit, how to guarantee service data to be downloaded in time has been brought to the front. In this paper, we focus on the admission control problem, which is especially significant in overloaded conditions where tens of vehicles may share the resource of one roadside unit. To enhance downloading efficiency, we employ vehicular cloud which is extremely promising in future ITS to compute downloading time and compress contents. We propose an admission control scheme that calculates and increases the probability of successful downloads in a drive-thru system, which also promotes users' quality of experience. In addition, we formulate the admission control issue as a linear programming problem, and utilize a branch-and-bound algorithm to solve it. Simulations demonstrate that our proposed scheme reduces tasks failure notably and outperforms two regular downloading schemes in terms of throughput.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术文献互助群
群 号:481959085
Book学术官方微信