Analysis of probabilistic flooding in VANETs for optimal rebroadcast probabilities

Taqwa Saeed, M. Lestas, Y. Mylonas, A. Pitsillides, V. P. Lesta
{"title":"Analysis of probabilistic flooding in VANETs for optimal rebroadcast probabilities","authors":"Taqwa Saeed, M. Lestas, Y. Mylonas, A. Pitsillides, V. P. Lesta","doi":"10.1109/NOMS.2016.7502984","DOIUrl":null,"url":null,"abstract":"A number of probabilistic flooding schemes have been recently considered in VANETs to address problems of information dissemination in safety applications. The design approach has so far been simulative, a method which does not guarantee that the derived protocols will work when the simulation settings are violated in practice. In this paper, motivated by the need to design information dissemination protocols with verifiable properties prior to implementation, we employ mathematical models of single and multiple lane roads to investigate probabilistic flooding in VANETs using mathematical analysis. We demonstrate that the system can be described by linear difference equations the solutions of which yield the probability of all vehicles receiving the critical message as a function of the rebroadcast probability, the number of neighbors of each vehicle and the number of vehicles. We utilize the obtained solutions to derive the desired rebroadcast probabilities as a function of the transmission range, the vehicle density and the dissemination distance. The obtained results are in line with results obtained using extensive simulations and can be used as a baseline to develop information dissemination protocols with verifiable properties.","PeriodicalId":344879,"journal":{"name":"NOMS 2016 - 2016 IEEE/IFIP Network Operations and Management Symposium","volume":"62 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2016-04-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"NOMS 2016 - 2016 IEEE/IFIP Network Operations and Management Symposium","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/NOMS.2016.7502984","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 5

Abstract

A number of probabilistic flooding schemes have been recently considered in VANETs to address problems of information dissemination in safety applications. The design approach has so far been simulative, a method which does not guarantee that the derived protocols will work when the simulation settings are violated in practice. In this paper, motivated by the need to design information dissemination protocols with verifiable properties prior to implementation, we employ mathematical models of single and multiple lane roads to investigate probabilistic flooding in VANETs using mathematical analysis. We demonstrate that the system can be described by linear difference equations the solutions of which yield the probability of all vehicles receiving the critical message as a function of the rebroadcast probability, the number of neighbors of each vehicle and the number of vehicles. We utilize the obtained solutions to derive the desired rebroadcast probabilities as a function of the transmission range, the vehicle density and the dissemination distance. The obtained results are in line with results obtained using extensive simulations and can be used as a baseline to develop information dissemination protocols with verifiable properties.
VANETs中最优重播概率的概率泛洪分析
最近在VANETs中考虑了一些概率泛洪方案,以解决安全应用中的信息传播问题。目前的设计方法是模拟的,这种方法不能保证在实际中违反模拟设置时所导出的协议能够正常工作。在本文中,由于需要在实现之前设计具有可验证属性的信息传播协议,我们采用单车道和多车道道路的数学模型,使用数学分析来研究vanet中的概率洪水。我们证明了该系统可以用线性差分方程来描述,该方程的解产生了所有车辆接收到关键信息的概率作为重播概率、每辆车的邻居数量和车辆数量的函数。我们利用得到的解推导出期望的重播概率作为传输距离、车辆密度和传播距离的函数。所得结果与大量仿真结果一致,可作为开发具有可验证特性的信息传播协议的基准。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信