Optimizing Age of Information in Internet of Vehicles Over Error-Prone Channels

December 03, 2024 ยท Entered Twilight ยท ๐Ÿ› Italian National Conference on Sensors

๐Ÿ’ค TWILIGHT: Eternal Rest
Repo abandoned since publication

Repo contents: .idea, DM1_AoI.py, MM1_AoI.py, __pycache__, compareM.py, comparePd.py, compareRho.py, compareTauc.py, fig, lam.py

Authors Cui Zhang, Maoxin Ji, Qiong Wu, Pingyi Fan, Qiang Fan arXiv ID 2412.13204 Category cs.IT: Information Theory Cross-listed cs.NI Citations 2 Venue Italian National Conference on Sensors Repository https://github.com/qiongwu86/Blockchain-Enabled-Variational-Information-Bottleneck-for-Minimizing-AoI-in-IoV โญ 3 Last Checked 3 months ago
Abstract
In the Internet of Vehicles (IoV), Age of Information (AoI) has become a vital performance metric for evaluating the freshness of information in communication systems. Although many studies aim to minimize the average AoI of the system through optimized resource scheduling schemes, they often fail to adequately consider the queue characteristics. Moreover, the vehicle mobility leads to rapid changes in network topology and channel conditions, making it difficult to accurately reflect the unique characteristics of vehicles with the calculated AoI under ideal channel conditions. This paper examines the impact of Doppler shifts caused by vehicle speeds on data transmission in error-prone channels. Based on the M/M/1 and D/M/1 queuing theory models, we derive expressions for the Age of Information and optimize the system's average AoI by adjusting the data extraction rates of vehicles (which affect system utilization). We propose an online optimization algorithm that dynamically adjusts the vehicles' data extraction rates based on environmental changes to ensure optimal AoI. Simulation results have demonstrated that adjusting the data extraction rates of vehicles can significantly reduce the system's AoI. Additionally, in the network scenario of this work, the AoI of the D/M/1 system is lower than that of the M/M/1 system.
Community shame:
Not yet rated
Community Contributions

Found the code? Know the venue? Think something is wrong? Let us know!

๐Ÿ“œ Similar Papers

In the same crypt โ€” Information Theory