Optimizing information freshness using low-power status updates via sleep-wake scheduling

@article{Bedewy2020OptimizingIF,
  title={Optimizing information freshness using low-power status updates via sleep-wake scheduling},
  author={Ahmed M. Bedewy and Yin Sun and Rahul Singh and Ness B. Shroff},
  journal={Proceedings of the Twenty-First International Symposium on Theory, Algorithmic Foundations, and Protocol Design for Mobile Networks and Mobile Computing},
  year={2020}
}
  • A. Bedewy, Yin Sun, +1 author N. Shroff
  • Published 1 October 2019
  • Computer Science, Mathematics
  • Proceedings of the Twenty-First International Symposium on Theory, Algorithmic Foundations, and Protocol Design for Mobile Networks and Mobile Computing
In this paper, we consider the problem of optimizing the freshness of status updates that are sent from a large number of low-power source nodes to a common access point. The source nodes utilize carrier sensing to reduce collisions and adopt an asychronized sleep-wake strategy to achieve an extended battery lifetime (e.g., 10-15 years). We use age of information (AoI) to measure the freshness of status updates, and design the sleep-wake parameters for minimizing the weighted-sum peak AoI of… 
Low-Power Status Updates via Sleep-Wake Scheduling
TLDR
A low-complexity solution is devised to solve the problem of optimizing the freshness of status updates that are sent from a large number of low-power sources to a common access point and it is proved that the solution is within a small gap from the optimum AoI performance.
Age-Optimal Low-Power Status Update over Time-Correlated Fading Channel
TLDR
This paper considers transmission scheduling in a status update system, where updates are generated periodically and transmitted over a Gilbert-Elliott fading channel, and develops an optimal algorithm using the structure of the problem.
Age of Information in Energy Harvesting Aided Massive Multiple Access Networks
  • Zhengru Fang, Jingjing Wang, Yong Ren, Zhu Han, H. Poor, L. Hanzo
  • Computer Science, Mathematics
    IEEE Journal on Selected Areas in Communications
  • 2022
TLDR
Simulation results show that the proposed algorithms are beneficial in terms of yielding a lower peak AoI at a low power consumption in the context of the multiple access protocols considered.
Age of Information: An Introduction and Survey
TLDR
The current state of the art in the design and optimization of low-latency cyberphysical systems and applications in which sources send time-stamped status updates to interested recipients is described and AoI timeliness metrics are described.
Age Minimization Transmission Scheduling over Time-Correlated Fading Channel under An Average Energy Constraint
TLDR
This paper considers transmission scheduling in a status update system, where updates are generated periodically and transmitted over a Gilbert-Elliott fading channel and shows that the optimal policy is a randomized mixture of no more than two stationary deterministic policies each of which is of a threshold-type in the belief on the channel.
Remote Tracking of Distributed Dynamic Sources over A Random Access Channel with One-bit Updates
  • Sunjung Kang, A. Eryilmaz, N. Shroff
  • Computer Science
    2021 19th International Symposium on Modeling and Optimization in Mobile, Ad hoc, and Wireless Networks (WiOpt)
  • 2021
TLDR
This work considers a network, where n distributed information sources whose states evolve according to a random process transmit their time-varying states to a remote estimator over a shared wireless channel, and proposes update strategies for remote tracking of source states that require each update to constitute as few bits as possible.
A UoI-Optimal Policy for Timely Status Updates with Resource Constraint
TLDR
This paper first formulate the problem in a constrained Markov decision process and prove that the UoI-optimal policy has a threshold structure, and designs a reinforcement learning (RL)-based scheduling policy for timely status information with resource constraint.
Timely Status Update Based on Urgency of Information with Statistical Context
TLDR
A dynamic threshold-based scheduling policy which only requires the conditional expectation of the weight in the next time slot by Lyapunov method is proposed and the online algorithm SARSA is used to obtain a policy.
Performance Analysis of Age of Information in Ultra-Dense Internet of Things (IoT) Systems with Noisy Channels
  • Bo Zhou, W. Saad
  • Computer Science, Mathematics
    IEEE Transactions on Wireless Communications
  • 2021
TLDR
A mean-field approximation approach with guaranteed accuracy is developed to analyze the asymptotic performance for the considered system with an infinite number of devices and the effects of the system parameters on the average AoI are characterized.
Centralized and Distributed Age of Information Minimization With Nonlinear Aging Functions in the Internet of Things
TLDR
Novel centralized and distributed resource allocation schemes are proposed to enable IoT devices to share limited communication resources and to transmit IoT messages in a timely manner and show that the distributed approach is more viable for a massive IoT.
...
1
2
...

References

SHOWING 1-10 OF 103 REFERENCES
Low-Power Status Updates via Sleep-Wake Scheduling
TLDR
A low-complexity solution is devised to solve the problem of optimizing the freshness of status updates that are sent from a large number of low-power sources to a common access point and it is proved that the solution is within a small gap from the optimum AoI performance.
Optimizing Information Freshness in Wireless Networks under General Interference Constraints
TLDR
It is proved an important separation principle: the optimal scheduling policy can be designed assuming fresh information, and independently, the packet generation rate control can be done by ignoring interference.
Timely Status Update in Massive IoT Systems: Decentralized Scheduling for Wireless Uplinks
TLDR
The timeliness of the status is measured by the recently proposed age-of-information (AoI) metric and it is proved that RR-ONE is asymptotically optimal among all policies in the massive IoT regime.
Optimizing data freshness, throughput, and delay in multi-server information-update systems
  • A. Bedewy, Yin Sun, N. Shroff
  • Computer Science, Mathematics
    2016 IEEE International Symposium on Information Theory (ISIT)
  • 2016
TLDR
It is proved that a preemptive Last Generated First Served (LGFS) policy simultaneous optimizes the age, throughput, and delay performance in infinite buffer queueing systems and age-optimality for the LGFS policy for any finite queue size is shown.
Life-Add: Lifetime Adjustable design for WiFi networks with heterogeneous energy supplies
TLDR
It is proven that Life-Add achieves near-optimal proportional-fair utility performance for single access point (AP) scenarios, and alleviates the near-far effect and hidden terminal problem in general multiple AP scenarios.
Optimal Link Scheduling for Age Minimization in Wireless Systems
TLDR
This work investigates age minimization in a wireless network and proposes a novel approach of optimizing the scheduling strategy to deliver all messages as fresh as possible and proves it is NP-hard in general.
Update or wait: How to keep your data fresh
TLDR
This work introduces a penalty function to characterize the level of “dissatisfaction” on data staleness, and forms the average age penalty minimization problem as a constrained semi-Markov decision process (SMDP) with an uncountable state space.
Optimizing Age of Information in Wireless Networks with Throughput Constraints
TLDR
This paper develops three low-complexity transmission scheduling policies that attempt to minimize AoI subject to minimum throughput requirements and evaluates their performance against the optimal policy, and develops a randomized policy, a Max-Weight policy and a Whittle's Index policy.
Status updates over unreliable multiaccess channels
  • R. Yates, S. Kaul
  • Computer Science, Mathematics
    2017 IEEE International Symposium on Information Theory (ISIT)
  • 2017
TLDR
The age of information (AoI), which is a timeliness metric, is derived and conditions that optimize AoI at the sink are arrived at, in which updates from different nodes must have the same AoI.
Age of Information: An Introduction and Survey
TLDR
The current state of the art in the design and optimization of low-latency cyberphysical systems and applications in which sources send time-stamped status updates to interested recipients is described and AoI timeliness metrics are described.
...
1
2
3
4
5
...