A Lightweight and Efficient Approach (LEA) for Hovering Information protocols

Tomo Nikolovski, R. Pazzi
{"title":"A Lightweight and Efficient Approach (LEA) for Hovering Information protocols","authors":"Tomo Nikolovski, R. Pazzi","doi":"10.1145/3132340.3132354","DOIUrl":null,"url":null,"abstract":"Keeping an event alive within a bounded area for a certain amount of time in Vehicular Ad Hoc Networks (VANETs) is still an open issue in the literature. Existing approaches tackle this problem by using periodic beacon messages that can quickly saturate the network. In this paper, we propose a novel method called LEA: A Lightweight and Efficient Approach for Hovering Information protocols, which is unique in the literature. Basically, instead of using a periodic beacons, LEA can use any kind of data dissemination protocol and execute it periodically to inform the new vehicles that are arriving into the Hovering Zone about the event. We also propose an equation to calculate the repetition interval for the dissemination. An extensive set of simulation experiments were conducted and results show that LEA can outperform the existing beaconing approaches in terms of total number of transmitted packets while also sustaining a satisfactory relevant delivery ratio for the vehicles that will really forward the event. In addition, the use of a hovering optimized data dissemination protocol can improve even further the efficiency of this approach in terms of time needed for a vehicle to become informed once in enters the Hovering Zone.","PeriodicalId":113404,"journal":{"name":"Proceedings of the 6th ACM Symposium on Development and Analysis of Intelligent Vehicular Networks and Applications","volume":"8 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2017-11-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the 6th ACM Symposium on Development and Analysis of Intelligent Vehicular Networks and Applications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/3132340.3132354","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3

Abstract

Keeping an event alive within a bounded area for a certain amount of time in Vehicular Ad Hoc Networks (VANETs) is still an open issue in the literature. Existing approaches tackle this problem by using periodic beacon messages that can quickly saturate the network. In this paper, we propose a novel method called LEA: A Lightweight and Efficient Approach for Hovering Information protocols, which is unique in the literature. Basically, instead of using a periodic beacons, LEA can use any kind of data dissemination protocol and execute it periodically to inform the new vehicles that are arriving into the Hovering Zone about the event. We also propose an equation to calculate the repetition interval for the dissemination. An extensive set of simulation experiments were conducted and results show that LEA can outperform the existing beaconing approaches in terms of total number of transmitted packets while also sustaining a satisfactory relevant delivery ratio for the vehicles that will really forward the event. In addition, the use of a hovering optimized data dissemination protocol can improve even further the efficiency of this approach in terms of time needed for a vehicle to become informed once in enters the Hovering Zone.
悬停信息协议的轻量级高效方法(LEA)
在车辆自组织网络(VANETs)中,在限定区域内保持事件存活一定时间仍然是文献中的一个开放问题。现有的解决这个问题的方法是使用可以迅速使网络饱和的周期性信标消息。在本文中,我们提出了一种新颖的方法,称为LEA:一种轻量级和高效的悬停信息协议方法,这在文献中是独一无二的。基本上,LEA可以使用任何类型的数据传播协议,并定期执行它,以通知即将到达悬停区域的新车辆有关事件,而不是使用周期性信标。我们还提出了一个公式来计算传播的重复间隔。进行了大量的仿真实验,结果表明LEA在传输数据包总数方面优于现有的信标方法,同时对于真正转发事件的车辆保持令人满意的相关投递率。此外,使用悬停优化的数据传播协议可以进一步提高这种方法的效率,因为车辆进入悬停区域后获得通知所需的时间。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信