Mobility Aware Event Dissemination in VANET

J. Mukherjee, Arobinda Gupta
{"title":"Mobility Aware Event Dissemination in VANET","authors":"J. Mukherjee, Arobinda Gupta","doi":"10.1145/2684464.2684498","DOIUrl":null,"url":null,"abstract":"Many future VANET applications will be event-driven and will require events of different kinds to be delivered to vehicles en route in time. In this work, we propose a publish-subscribe based communication framework for a service provider (SP) that utilizes its roadside units (RSUs) to deliver relevant events to moving vehicles. Vehicles subscribe to a SP for specific types of events; the events are also reported to the SP. The SP delivers the events to the subscribed vehicles within the validity periods of both the subscriptions and the events through RSUs placed along the route of the vehicles. The problem is referred as the Minimum Cost Event Placement Problem [10] that schedules the placement of events in RSUs for different time intervals so that the events are delivered to the subscribed vehicles while incurring minimum cost of utilization of the RSUs. In this paper, we give a ln n approximation algorithm for the problem, where n is the number of subscriptions. We then propose a centralized online algorithm to solve the problem. A lower bound on the cost of utilization of the RSUs for a given set of subscriptions and events is presented next. Detailed simulation results in realistic city traffic scenarios are presented to show the performance of the algorithms.","PeriodicalId":298587,"journal":{"name":"Proceedings of the 16th International Conference on Distributed Computing and Networking","volume":"133 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2015-01-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the 16th International Conference on Distributed Computing and Networking","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/2684464.2684498","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3

Abstract

Many future VANET applications will be event-driven and will require events of different kinds to be delivered to vehicles en route in time. In this work, we propose a publish-subscribe based communication framework for a service provider (SP) that utilizes its roadside units (RSUs) to deliver relevant events to moving vehicles. Vehicles subscribe to a SP for specific types of events; the events are also reported to the SP. The SP delivers the events to the subscribed vehicles within the validity periods of both the subscriptions and the events through RSUs placed along the route of the vehicles. The problem is referred as the Minimum Cost Event Placement Problem [10] that schedules the placement of events in RSUs for different time intervals so that the events are delivered to the subscribed vehicles while incurring minimum cost of utilization of the RSUs. In this paper, we give a ln n approximation algorithm for the problem, where n is the number of subscriptions. We then propose a centralized online algorithm to solve the problem. A lower bound on the cost of utilization of the RSUs for a given set of subscriptions and events is presented next. Detailed simulation results in realistic city traffic scenarios are presented to show the performance of the algorithms.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
VANET中机动感知事件传播
许多未来的VANET应用程序将是事件驱动的,并且需要将不同类型的事件及时传递给车辆。在这项工作中,我们为服务提供商(SP)提出了一个基于发布-订阅的通信框架,该框架利用其路边单元(rsu)向移动车辆传递相关事件。车辆为特定类型的事件订阅SP;事件也被报告给服务提供商。服务提供商通过放置在车辆路线上的rsu,在订阅和事件有效期内将事件传递给已订阅的车辆。这个问题被称为最小成本事件放置问题[10],它按照不同的时间间隔安排事件在rsu中的放置,以便事件被传递到订阅的车辆,同时产生最小的rsu使用成本。本文给出了该问题的一个ln n近似算法,其中n为订阅数。然后,我们提出了一个集中式在线算法来解决这个问题。接下来将给出一组给定订阅和事件的rsu使用成本的下限。最后给出了具体的城市交通场景仿真结果,验证了算法的有效性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Distributed Computation of Sparse Cuts via Random Walks Self-Stabilizing ℓ-Exclusion Revisited Optimally Resilient Asynchronous MPC with Linear Communication Complexity OPCAM: Optimal Algorithms Implementing Causal Memories in Shared Memory Systems Solving Consensus in Opportunistic Networks
×
引用
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