V2V网络中的高效消息传播:基于局部中心性的方法

Moyukh Laha, R. Datta
{"title":"V2V网络中的高效消息传播:基于局部中心性的方法","authors":"Moyukh Laha, R. Datta","doi":"10.1109/NCC52529.2021.9530108","DOIUrl":null,"url":null,"abstract":"Many vehicular applications require data dissemination where all the vehicles in a specific region of concern are the intended receivers of particular messages. Such dissemination is challenging due to vehicular networks' distinct properties, such as high mobility, low communication range, intermittent connectivity, and diverse variations in their topology. In this work, we propose a Local Centrality-based Dissemination scheme for vehicular networks based on V2V communication. To this end, each vehicle node gathers their two-hop neighborhood information to identify the super-spreader nodes that continue the dissemination by rebroadcasting the receiving messages. In contrast, the rest of the nodes remain quiet. We validate the performance of our proposed scheme with real vehicular data. Extensive simulation results reveal the superior performance of our proposed scheme in terms of higher and quicker coverage with fewer redundant transmissions than the state-of-the-art data dissemination protocols.","PeriodicalId":414087,"journal":{"name":"2021 National Conference on Communications (NCC)","volume":"51 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2021-07-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Efficient Message Dissemination in V2V Network: A Local Centrality-based Approach\",\"authors\":\"Moyukh Laha, R. Datta\",\"doi\":\"10.1109/NCC52529.2021.9530108\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Many vehicular applications require data dissemination where all the vehicles in a specific region of concern are the intended receivers of particular messages. Such dissemination is challenging due to vehicular networks' distinct properties, such as high mobility, low communication range, intermittent connectivity, and diverse variations in their topology. In this work, we propose a Local Centrality-based Dissemination scheme for vehicular networks based on V2V communication. To this end, each vehicle node gathers their two-hop neighborhood information to identify the super-spreader nodes that continue the dissemination by rebroadcasting the receiving messages. In contrast, the rest of the nodes remain quiet. We validate the performance of our proposed scheme with real vehicular data. Extensive simulation results reveal the superior performance of our proposed scheme in terms of higher and quicker coverage with fewer redundant transmissions than the state-of-the-art data dissemination protocols.\",\"PeriodicalId\":414087,\"journal\":{\"name\":\"2021 National Conference on Communications (NCC)\",\"volume\":\"51 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2021-07-27\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2021 National Conference on Communications (NCC)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/NCC52529.2021.9530108\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2021 National Conference on Communications (NCC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/NCC52529.2021.9530108","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

许多车辆应用程序需要数据传播,其中特定区域内的所有车辆都是特定信息的预期接收者。由于车辆网络的独特特性,如高移动性、低通信范围、间歇性连接和拓扑结构的多样化,这种传播具有挑战性。在这项工作中,我们提出了一种基于V2V通信的车载网络的基于局部中心性的传播方案。为此,每个车辆节点收集其两跳邻域信息,以识别通过转发接收消息继续传播的超级传播者节点。相比之下,其余节点保持安静。我们用实际车辆数据验证了所提方案的性能。大量的仿真结果表明,我们提出的方案在更高更快的覆盖范围和更少的冗余传输方面比最先进的数据传播协议具有优越的性能。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Efficient Message Dissemination in V2V Network: A Local Centrality-based Approach
Many vehicular applications require data dissemination where all the vehicles in a specific region of concern are the intended receivers of particular messages. Such dissemination is challenging due to vehicular networks' distinct properties, such as high mobility, low communication range, intermittent connectivity, and diverse variations in their topology. In this work, we propose a Local Centrality-based Dissemination scheme for vehicular networks based on V2V communication. To this end, each vehicle node gathers their two-hop neighborhood information to identify the super-spreader nodes that continue the dissemination by rebroadcasting the receiving messages. In contrast, the rest of the nodes remain quiet. We validate the performance of our proposed scheme with real vehicular data. Extensive simulation results reveal the superior performance of our proposed scheme in terms of higher and quicker coverage with fewer redundant transmissions than the state-of-the-art data dissemination protocols.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Biomedical Image Retrieval using Muti-Scale Local Bit-plane Arbitrary Shaped Patterns Forensics of Decompressed JPEG Color Images Based on Chroma Subsampling Optimized Bio-inspired Spiking Neural Models based Anatomical and Functional Neurological Image Fusion in NSST Domain Improved Hankel Norm Criterion for Interfered Nonlinear Digital Filters Subjected to Hardware Constraints The Capacity of Photonic Erasure Channels with Detector Dead Times
×
引用
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