Minimizing the Age of Information in Intelligent Transportation Systems

Ibrahim Sorkhoh, Dariush Ebrahimi, S. Sharafeddine, C. Assi
{"title":"Minimizing the Age of Information in Intelligent Transportation Systems","authors":"Ibrahim Sorkhoh, Dariush Ebrahimi, S. Sharafeddine, C. Assi","doi":"10.1109/CloudNet51028.2020.9335793","DOIUrl":null,"url":null,"abstract":"In many applications offered by intelligent transportation systems (ITS), maintaining the freshness of real-time information is a key requirement for the successful delivery of their services. The age of information (AoI) is a new metric recently proposed to capture the data freshness. This paper considers intelligent vehicles in a Vehicle to Infrastructure (V2I) network where each vehicle has a stream of data sampled by on-board sensors to communicate with a road side unit (RSU). Many vehicles demand access and vehicles stay in range for a short period of time. The objective of the RSU, then, is to schedule transmissions of these vehicles with the objective of maintaining data freshness upon receiving these packets. We first formulate the scheduling problem as a mixed integer linear program (MILP) to minimize the weighted AoI, accounting for the dynamic nature of the environment (vehicles' arrivals and their speeds, channel reliability, etc.). We also propose a scalable greedy algorithm that solves the problem in a polynomial time, and we prove that it obtains the optimal solution. We generate synthetic data using SUMO and evaluate numerically the performance of our algorithms.","PeriodicalId":156419,"journal":{"name":"2020 IEEE 9th International Conference on Cloud Networking (CloudNet)","volume":"3 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2020-11-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2020 IEEE 9th International Conference on Cloud Networking (CloudNet)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CloudNet51028.2020.9335793","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 4

Abstract

In many applications offered by intelligent transportation systems (ITS), maintaining the freshness of real-time information is a key requirement for the successful delivery of their services. The age of information (AoI) is a new metric recently proposed to capture the data freshness. This paper considers intelligent vehicles in a Vehicle to Infrastructure (V2I) network where each vehicle has a stream of data sampled by on-board sensors to communicate with a road side unit (RSU). Many vehicles demand access and vehicles stay in range for a short period of time. The objective of the RSU, then, is to schedule transmissions of these vehicles with the objective of maintaining data freshness upon receiving these packets. We first formulate the scheduling problem as a mixed integer linear program (MILP) to minimize the weighted AoI, accounting for the dynamic nature of the environment (vehicles' arrivals and their speeds, channel reliability, etc.). We also propose a scalable greedy algorithm that solves the problem in a polynomial time, and we prove that it obtains the optimal solution. We generate synthetic data using SUMO and evaluate numerically the performance of our algorithms.
最小化智能交通系统的信息时代
在智能交通系统(ITS)提供的许多应用中,保持实时信息的新鲜度是成功提供服务的关键要求。信息时代(AoI)是最近提出的用于捕获数据新鲜度的新度量。本文考虑了车辆到基础设施(V2I)网络中的智能车辆,其中每辆车都有一个由车载传感器采样的数据流,以与路侧单元(RSU)通信。许多车辆需要进入,车辆在短时间内停留在范围内。因此,RSU的目标是调度这些车辆的传输,目的是在接收到这些数据包时保持数据的新鲜度。我们首先将调度问题表述为一个混合整数线性规划(MILP),以最小化加权AoI,考虑环境的动态性质(车辆到达及其速度,通道可靠性等)。我们还提出了一个可扩展的贪心算法,该算法在多项式时间内解决了问题,并证明了它得到了最优解。我们使用SUMO生成合成数据,并对算法的性能进行数值评估。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术文献互助群
群 号:604180095
Book学术官方微信