Optimizing Roadside Advertisement Dissemination in Vehicular Cyber-Physical Systems

Huanyang Zheng, Jie Wu
{"title":"Optimizing Roadside Advertisement Dissemination in Vehicular Cyber-Physical Systems","authors":"Huanyang Zheng, Jie Wu","doi":"10.1109/ICDCS.2015.13","DOIUrl":null,"url":null,"abstract":"In this paper, we address a promising application in the Vehicular Cyber-Physical Systems (VCPS) called roadside advertisement dissemination. Its application involves three elements: the drivers in the vehicles, Roadside Access Points (RAPs), and shopkeepers. The shopkeeper wants to attract as many customers as possible, through using RAPs to disseminate advertisements to the passing vehicles. Upon receiving an advertisement, the driver may detour towards the shop, depending on the detour distance. Given a fixed number of RAPs and the traffic distribution, our goal is to optimize the RAP placement for the shopkeeper to maximally attract potential customers. This application is a non-trivial extension of traditional coverage problems, the difference being that we use RAPs to cover the traffic flows. RAP placement algorithms may pose complex trade-offs. If we place RAPs at locations that can provide small detour distances to attract more customers, these locations may not necessarily be located in heavy traffic regions. While heavy traffic regions cover more flows, they can cause large detour distances, making shopping less attractive to customers. To balance this trade off, novel RAP placement algorithms are proposed. Since real-world traffic distributions exhibit unique patterns, here we further consider the Manhattan grid scenario and then propose corresponding near-optimal solutions. Real trace-driven experiments validate the competitive performance of the proposed algorithms.","PeriodicalId":129182,"journal":{"name":"2015 IEEE 35th International Conference on Distributed Computing Systems","volume":"24 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2015-07-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"19","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2015 IEEE 35th International Conference on Distributed Computing Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICDCS.2015.13","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 19

Abstract

In this paper, we address a promising application in the Vehicular Cyber-Physical Systems (VCPS) called roadside advertisement dissemination. Its application involves three elements: the drivers in the vehicles, Roadside Access Points (RAPs), and shopkeepers. The shopkeeper wants to attract as many customers as possible, through using RAPs to disseminate advertisements to the passing vehicles. Upon receiving an advertisement, the driver may detour towards the shop, depending on the detour distance. Given a fixed number of RAPs and the traffic distribution, our goal is to optimize the RAP placement for the shopkeeper to maximally attract potential customers. This application is a non-trivial extension of traditional coverage problems, the difference being that we use RAPs to cover the traffic flows. RAP placement algorithms may pose complex trade-offs. If we place RAPs at locations that can provide small detour distances to attract more customers, these locations may not necessarily be located in heavy traffic regions. While heavy traffic regions cover more flows, they can cause large detour distances, making shopping less attractive to customers. To balance this trade off, novel RAP placement algorithms are proposed. Since real-world traffic distributions exhibit unique patterns, here we further consider the Manhattan grid scenario and then propose corresponding near-optimal solutions. Real trace-driven experiments validate the competitive performance of the proposed algorithms.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
基于车载信息物理系统的路边广告传播优化
在本文中,我们讨论了在车辆信息物理系统(VCPS)中一个很有前途的应用,即路边广告传播。它的应用涉及三个要素:车辆中的驾驶员、路边接入点(rap)和店主。店主想通过使用rap向过往车辆传播广告来吸引尽可能多的顾客。在收到广告后,司机可以根据绕行的距离绕行到商店。给定固定数量的RAP和流量分布,我们的目标是优化店主的RAP放置,以最大限度地吸引潜在客户。这个应用程序是传统覆盖问题的一个重要扩展,不同之处在于我们使用rap来覆盖流量。RAP放置算法可能会带来复杂的权衡。如果我们将rap放置在可以提供较小绕行距离以吸引更多客户的位置,这些位置可能不一定位于交通繁忙的区域。虽然交通繁忙的地区覆盖了更多的人流,但它们可能会造成很大的绕路距离,使购物对顾客的吸引力降低。为了平衡这种权衡,提出了新的RAP放置算法。由于现实世界的交通分布呈现出独特的模式,这里我们进一步考虑曼哈顿网格场景,然后提出相应的接近最优的解决方案。真实的跟踪驱动实验验证了所提出算法的竞争性能。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
FLOWPROPHET: Generic and Accurate Traffic Prediction for Data-Parallel Cluster Computing Improving the Energy Benefit for 802.3az Using Dynamic Coalescing Techniques Systematic Mining of Associated Server Herds for Malware Campaign Discovery Rain Bar: Robust Application-Driven Visual Communication Using Color Barcodes Optimizing Roadside Advertisement Dissemination in Vehicular Cyber-Physical Systems
×
引用
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