基于轨迹的车辆网络多目标最优数据转发

Mao-Bao Fu, Xin Li, Fan Li, Xinyu Guo, Zhi-Li Wu
{"title":"基于轨迹的车辆网络多目标最优数据转发","authors":"Mao-Bao Fu, Xin Li, Fan Li, Xinyu Guo, Zhi-Li Wu","doi":"10.1109/PCCC.2014.7017077","DOIUrl":null,"url":null,"abstract":"Vehicular networks have been increasingly used for applications like road infrastructure monitoring and traffic jam detection, etc. Data forwarding is a well-known challenging problem in vehicular networks, which suffers from delay and error due to the frequent network disruption and fast topological change. The minimizations of the delivery delay and network cost are both central to data forwarding in vehicular networks. However, previous works usually focus on only one of the two objectives and most of them do not make good use of vehicle trajectory information. In this paper, we formulate the V2V (vehicle to vehicle) data forwarding problem as a novel multi-objective Markov Decision Process (MDP). We exploit the vehicle trajectory information and traffic statistics to estimate the parameters of the MDP (i.e., transition probabilities, rewards). The optimal routing policy is then developed by solving the multi-objective MDP. We conduct extensive simulations on a taxi network in a mega-city, the experimental results validate the effectiveness of our proposed mechanism.","PeriodicalId":105442,"journal":{"name":"2014 IEEE 33rd International Performance Computing and Communications Conference (IPCCC)","volume":"160 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"TMODF: Trajectory-based multi-objective optimal data forwarding in vehicular networks\",\"authors\":\"Mao-Bao Fu, Xin Li, Fan Li, Xinyu Guo, Zhi-Li Wu\",\"doi\":\"10.1109/PCCC.2014.7017077\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Vehicular networks have been increasingly used for applications like road infrastructure monitoring and traffic jam detection, etc. Data forwarding is a well-known challenging problem in vehicular networks, which suffers from delay and error due to the frequent network disruption and fast topological change. The minimizations of the delivery delay and network cost are both central to data forwarding in vehicular networks. However, previous works usually focus on only one of the two objectives and most of them do not make good use of vehicle trajectory information. In this paper, we formulate the V2V (vehicle to vehicle) data forwarding problem as a novel multi-objective Markov Decision Process (MDP). We exploit the vehicle trajectory information and traffic statistics to estimate the parameters of the MDP (i.e., transition probabilities, rewards). The optimal routing policy is then developed by solving the multi-objective MDP. We conduct extensive simulations on a taxi network in a mega-city, the experimental results validate the effectiveness of our proposed mechanism.\",\"PeriodicalId\":105442,\"journal\":{\"name\":\"2014 IEEE 33rd International Performance Computing and Communications Conference (IPCCC)\",\"volume\":\"160 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2014-12-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2014 IEEE 33rd International Performance Computing and Communications Conference (IPCCC)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/PCCC.2014.7017077\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2014 IEEE 33rd International Performance Computing and Communications Conference (IPCCC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/PCCC.2014.7017077","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3

摘要

车辆网络越来越多地应用于道路基础设施监控和交通堵塞检测等领域。数据转发是车用网络中一个非常具有挑战性的问题,由于网络频繁中断和拓扑变化快,导致数据转发存在延迟和错误。在车载网络中,传输延迟和网络成本的最小化是数据转发的核心。然而,以往的工作通常只关注两个目标中的一个,并且大多数没有很好地利用车辆轨迹信息。本文将车对车数据转发问题表述为一种新的多目标马尔可夫决策过程(MDP)。我们利用车辆轨迹信息和交通统计来估计MDP的参数(即转移概率,奖励)。通过求解多目标MDP,得到最优路由策略。我们在一个特大城市的出租车网络上进行了大量的模拟,实验结果验证了我们提出的机制的有效性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
TMODF: Trajectory-based multi-objective optimal data forwarding in vehicular networks
Vehicular networks have been increasingly used for applications like road infrastructure monitoring and traffic jam detection, etc. Data forwarding is a well-known challenging problem in vehicular networks, which suffers from delay and error due to the frequent network disruption and fast topological change. The minimizations of the delivery delay and network cost are both central to data forwarding in vehicular networks. However, previous works usually focus on only one of the two objectives and most of them do not make good use of vehicle trajectory information. In this paper, we formulate the V2V (vehicle to vehicle) data forwarding problem as a novel multi-objective Markov Decision Process (MDP). We exploit the vehicle trajectory information and traffic statistics to estimate the parameters of the MDP (i.e., transition probabilities, rewards). The optimal routing policy is then developed by solving the multi-objective MDP. We conduct extensive simulations on a taxi network in a mega-city, the experimental results validate the effectiveness of our proposed mechanism.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Performance and energy evaluation of RESTful web services in Raspberry Pi Proximity-driven social interactions and their impact on the throughput scaling of wireless networks POLA: A privacy-preserving protocol for location-based real-time advertising Replica placement in content delivery networks with stochastic demands and M/M/1 servers Combinatorial JPT based on orthogonal beamforming for two-cell cooperation
×
引用
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