基础设施辅助云网络导航系统的压缩传输

SangYeob Oh, Soon-Ki Jo, Jongsoo Seo
{"title":"基础设施辅助云网络导航系统的压缩传输","authors":"SangYeob Oh, Soon-Ki Jo, Jongsoo Seo","doi":"10.1109/ICACT.2016.7423496","DOIUrl":null,"url":null,"abstract":"The usual built-in navigation in a car needs to be upgraded periodically due to the update and change of road conditions. To solve those problems, a cloud network navigation system has been launched which can automatically request the information of roads needed. However sending the information to each user in a specific area individually is very inefficient in the radio resource utilization aspect. In this paper, we model the transmission architecture that can send geographical information to the vehicle using RSUs, and propose a new method called Zipping algorithm. Our proposed algorithm groups the car in efficient way and due to our scheme; the total transmission time will be minimized. To make this possible, we use N times M/M/N which is an extension of M/M/1 model of queueing theory. We show the different traffic congestion of the road depends on the weekdays and weekends. Then, we show the case of car groupings depending on the various Zipping time given. We analyze the above result by simulating the transmission efficiency and compare with the performance of unicast system and that of our proposed algorithm.","PeriodicalId":125854,"journal":{"name":"2016 18th International Conference on Advanced Communication Technology (ICACT)","volume":"136 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Zipping transmission for infrastructure-assisted cloud network navigation system\",\"authors\":\"SangYeob Oh, Soon-Ki Jo, Jongsoo Seo\",\"doi\":\"10.1109/ICACT.2016.7423496\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The usual built-in navigation in a car needs to be upgraded periodically due to the update and change of road conditions. To solve those problems, a cloud network navigation system has been launched which can automatically request the information of roads needed. However sending the information to each user in a specific area individually is very inefficient in the radio resource utilization aspect. In this paper, we model the transmission architecture that can send geographical information to the vehicle using RSUs, and propose a new method called Zipping algorithm. Our proposed algorithm groups the car in efficient way and due to our scheme; the total transmission time will be minimized. To make this possible, we use N times M/M/N which is an extension of M/M/1 model of queueing theory. We show the different traffic congestion of the road depends on the weekdays and weekends. Then, we show the case of car groupings depending on the various Zipping time given. We analyze the above result by simulating the transmission efficiency and compare with the performance of unicast system and that of our proposed algorithm.\",\"PeriodicalId\":125854,\"journal\":{\"name\":\"2016 18th International Conference on Advanced Communication Technology (ICACT)\",\"volume\":\"136 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1900-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2016 18th International Conference on Advanced Communication Technology (ICACT)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICACT.2016.7423496\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2016 18th International Conference on Advanced Communication Technology (ICACT)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICACT.2016.7423496","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

由于道路状况的更新和变化,汽车中通常的内置导航需要定期升级。为了解决这些问题,云网络导航系统已经启动,可以自动请求所需的道路信息。然而,将信息单独发送到特定区域的每个用户在无线电资源利用方面效率非常低。本文建立了利用rsu向车辆发送地理信息的传输体系结构模型,并提出了一种称为压缩算法的新方法。我们提出的算法以有效的方式对汽车进行分组,并且由于我们的方案;总传输时间将被最小化。为了实现这一点,我们使用N乘以M/M/N,这是排队理论的M/M/1模型的扩展。我们展示了工作日和周末道路交通拥堵情况的不同。然后,我们将展示根据给定的各种压缩时间对汽车进行分组的情况。我们通过模拟传输效率来分析上述结果,并与单播系统和我们提出的算法的性能进行了比较。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Zipping transmission for infrastructure-assisted cloud network navigation system
The usual built-in navigation in a car needs to be upgraded periodically due to the update and change of road conditions. To solve those problems, a cloud network navigation system has been launched which can automatically request the information of roads needed. However sending the information to each user in a specific area individually is very inefficient in the radio resource utilization aspect. In this paper, we model the transmission architecture that can send geographical information to the vehicle using RSUs, and propose a new method called Zipping algorithm. Our proposed algorithm groups the car in efficient way and due to our scheme; the total transmission time will be minimized. To make this possible, we use N times M/M/N which is an extension of M/M/1 model of queueing theory. We show the different traffic congestion of the road depends on the weekdays and weekends. Then, we show the case of car groupings depending on the various Zipping time given. We analyze the above result by simulating the transmission efficiency and compare with the performance of unicast system and that of our proposed algorithm.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信