Can Beacons be Compressed to Reduce the Channel Load in Vehicular Networks?

M. Sepulcre, Pedro Tercero, J. Gozálvez
{"title":"Can Beacons be Compressed to Reduce the Channel Load in Vehicular Networks?","authors":"M. Sepulcre, Pedro Tercero, J. Gozálvez","doi":"10.1109/VNC.2018.8628386","DOIUrl":null,"url":null,"abstract":"Significant efforts have been devoted to date to the congestion control problem in vehicular networks. The solutions proposed so far have been designed to adapt the communication parameters to reduce and control the channel load. A totally different approach would be the compression of the data generated by each vehicle. This paper proposes and explores for the first time the use of data compression to reduce the channel load in vehicular networks. By compressing and decompressing V2X messages, the channel load generated could be reduced, thereby decreasing the interference and packet loses due to collisions. We apply this idea in this study to CAMs using existing data compression tools to have a first estimate of the compression gain that could be achieved, and the time needed to compress and decompress. The results obtained show that the CAM length could be reduced by up to around 14%, which is a non-negligible percentage given the relevance of the congestion control problem. The data compression and decompression times obtained demonstrate its potential for its integration in V2X devices. The results obtained motivate to more deeply investigate the compression of V2X messages in vehicular networks.","PeriodicalId":335017,"journal":{"name":"2018 IEEE Vehicular Networking Conference (VNC)","volume":"28 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2018 IEEE Vehicular Networking Conference (VNC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/VNC.2018.8628386","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3

Abstract

Significant efforts have been devoted to date to the congestion control problem in vehicular networks. The solutions proposed so far have been designed to adapt the communication parameters to reduce and control the channel load. A totally different approach would be the compression of the data generated by each vehicle. This paper proposes and explores for the first time the use of data compression to reduce the channel load in vehicular networks. By compressing and decompressing V2X messages, the channel load generated could be reduced, thereby decreasing the interference and packet loses due to collisions. We apply this idea in this study to CAMs using existing data compression tools to have a first estimate of the compression gain that could be achieved, and the time needed to compress and decompress. The results obtained show that the CAM length could be reduced by up to around 14%, which is a non-negligible percentage given the relevance of the congestion control problem. The data compression and decompression times obtained demonstrate its potential for its integration in V2X devices. The results obtained motivate to more deeply investigate the compression of V2X messages in vehicular networks.
能否压缩信标以减少车载网络中的信道负载?
迄今为止,人们对车辆网络中的拥塞控制问题进行了大量的研究。目前提出的解决方案都是通过调整通信参数来减少和控制信道负载。另一种完全不同的方法是压缩每辆车产生的数据。本文首次提出并探索了在车载网络中使用数据压缩来减少信道负荷的方法。通过压缩和解压缩V2X消息,可以减少产生的信道负载,从而减少由于碰撞造成的干扰和包丢失。在本研究中,我们将这一想法应用于使用现有数据压缩工具的cam,以初步估计可以实现的压缩增益,以及压缩和解压缩所需的时间。得到的结果表明,凸轮长度可以减少约14%,这是一个不可忽略的百分比,考虑到拥塞控制问题的相关性。获得的数据压缩和解压缩时间证明了其在V2X设备集成中的潜力。研究结果为进一步深入研究车用网络中V2X信息的压缩提供了动力。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
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学术官方微信