Minimizing Age of Information with Soft Updates

被引:26
|
作者
Bastopcu, Melih [1 ]
Ulukus, Sennur [1 ]
机构
[1] Univ Maryland, Dept Elect & Comp Engn, College Pk, MD 20742 USA
关键词
Age of information; low latency systems; soft updates;
D O I
10.1109/JCN.2019.000034
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
We consider an information updating system where an information provider and an information receiver engage in an update process over time. Different from the existing literature where updates are countable (hard) and take effect either immediately or after a delay, but instantaneously in both cases, here updates start taking effect right away but gradually over time. We coin this setting soft updates. When the updating process starts, the age decreases until the soft update period ends. We constrain the number of times the information provider and the information receiver meet (number of update periods) and the total duration of the update periods. We consider two models for the decrease of age during an update period: In the first model, the rate of decrease of age is proportional to the current age, and in the second model, the rate of decrease of age is constant. The first model results in an exponentially decaying age, and the second model results in a linearly decaying age. In both cases, we determine the optimum updating schemes, by determining the optimum start times and optimum durations of the updates, subject to the constraints on the number of update periods and the total update duration.
引用
收藏
页码:233 / 243
页数:11
相关论文
共 50 条
  • [1] Age of Information with Soft Updates
    Bastopcu, Melih
    Ulukus, Sennur
    [J]. 2018 56TH ANNUAL ALLERTON CONFERENCE ON COMMUNICATION, CONTROL, AND COMPUTING (ALLERTON), 2018, : 378 - 385
  • [2] Optimal Status Updates for Minimizing Age of Correlated Information in IoT Networks With Energy Harvesting Sensors
    Xu, Chao
    Zhang, Xinyan
    Yang, Howard H.
    Wang, Xijun
    Pappas, Nikolaos
    Niyato, Dusit
    Quek, Tony Q. S.
    [J]. IEEE TRANSACTIONS ON MOBILE COMPUTING, 2024, 23 (06) : 6848 - 6864
  • [3] Age of Information: Updates With Priority
    Kaul, Sanjit K.
    Yates, Roy D.
    [J]. 2018 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT), 2018, : 2644 - 2648
  • [4] Age of Information for Updates with Distortion
    Bastopcu, Melih
    Ulukus, Sennur
    [J]. 2019 IEEE INFORMATION THEORY WORKSHOP (ITW), 2019, : 299 - 303
  • [5] Age of Information Under Random Updates
    Kam, Clement
    Kompella, Sastry
    Ephremides, Anthony
    [J]. 2013 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY PROCEEDINGS (ISIT), 2013, : 66 - +
  • [6] Minimizing The Age of Information: NOMA or OMA?
    Maatouk, Ali
    Assaad, Mohamad
    Ephremides, Anthony
    [J]. IEEE CONFERENCE ON COMPUTER COMMUNICATIONS WORKSHOPS (IEEE INFOCOM 2019 WKSHPS), 2019, : 102 - 108
  • [7] Minimizing The Age of Information in a CSMA Environment
    Maatouk, Ali
    Assaad, Mohamad
    Ephremides, Anthony
    [J]. 17TH INTERNATIONAL SYMPOSIUM ON MODELING AND OPTIMIZATION IN MOBILE, AD HOC, AND WIRELESS NETWORKS (WIOPT 2019), 2019, : 226 - 233
  • [8] Minimizing Age of Information for Multiple Flows
    Beytur, Hasan Burhan
    Uysal-Biyikoglu, Elif
    [J]. 2018 IEEE INTERNATIONAL BLACK SEA CONFERENCE ON COMMUNICATIONS AND NETWORKING (BLACKSEACOM), 2018, : 31 - 35
  • [9] Minimizing the Age of Information Through Queues
    Bedewy, Ahmed M.
    Sun, Yin
    Shroff, Ness B.
    [J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 2019, 65 (08) : 5215 - 5232
  • [10] Age Debt: A General Framework For Minimizing Age of Information
    Tripathi, Vishrant
    Modiano, Eytan
    [J]. IEEE CONFERENCE ON COMPUTER COMMUNICATIONS WORKSHOPS (IEEE INFOCOM WKSHPS 2021), 2021,