Efficient Learning-based Scheduling for Information Freshness in Wireless Networks

@article{Li2021EfficientLS,
  title={Efficient Learning-based Scheduling for Information Freshness in Wireless Networks},
  author={Bin Li},
  journal={IEEE INFOCOM 2021 - IEEE Conference on Computer Communications},
  year={2021},
  pages={1-10}
}
  • Bin Li
  • Published 1 January 2021
  • Computer Science
  • IEEE INFOCOM 2021 - IEEE Conference on Computer Communications
Motivated by the recent trend of integrating artificial intelligence into the Internet-of-Things (IoT), we consider the problem of scheduling packets from multiple sensing sources to a central controller over a wireless network. Here, packets from different sensing sources have different values or degrees of importance to the central controller for intelligent decision making. In such a setup, it is critical to provide timely and valuable information for the central controller. In this paper… 

Figures and Tables from this paper

AoI-Constrained Bandit: Information Gathering over Unreliable Channels with Age Guarantees
TLDR
This paper investigates the transmission scheduling problem of maximizing throughput over wireless channels under different time-average AoI requirements for heterogeneous information sources and proposes a learning algorithm that meets the AoI requirement with probability 1 and incurs up to O(K √ T log T ) accumulated regret.
Sending Timely Status Updates through Channel with Random Delay via Online Learning
  • Haoyue Tang, Yuchao Chen, Jintao Wang, Jingzhou Sun, Jian Song
  • Computer Science, Mathematics
    ArXiv
  • 2021
TLDR
This work reformulates the total cost minimization problem as the optimization of a renewal-reward process, and proposes an online sampling strategy based on the Robbins-Monro algorithm that converges to the minimum cost when K goes to infinity, and the optimality gap decays with rate O (lnK/K).

References

SHOWING 1-10 OF 29 REFERENCES
Age-based Scheduling: Improving Data Freshness for Wireless Real-Time Traffic
TLDR
Analytical and simulation results confirm the capability of the proposed scheduling policy to improve the data freshness without sacrificing the feasibility optimality, and reveal that the improvement of network datafreshness is at the cost of slowing down the convergence of the timely throughput.
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.
Throughput-Optimal Scheduling Design With Regular Service Guarantees in Wireless Networks
TLDR
It is proved that the RSG Algorithm can provide service regularity guarantees by using the Lyapunov-drift-based analysis of the steady-state behavior of the stochastic processes, and can achieve a degree of serviceRegularity within a factor of a fundamental lower bound that can be as low as two in some special networks.
Minimizing the Age of Information in Wireless Networks with Stochastic Arrivals
TLDR
A lower bound on the AoI performance achievable by any given network operating under any queueing discipline is derived, which shows that the performance of the Max-Weight policy is close to the analytical lower bound.
Throughput-optimal wireless scheduling with regulated inter-service times
TLDR
A novel maximum-weight type scheduling policy that is proven to be throughput-optimal and also provides provable service regularity guarantees is proposed, which reveals the importance of incorporating the metric of time-since-last-service into the scheduling policy for providing regulated service.
Forever Young: Aging Control For Hybrid Networks
TLDR
A model based on a Markov Decision Process (MDP) shows the existence of an optimal strategy in the class of threshold strategies, wherein users activate their mobile devices if the age of their poadcasts surpasses a given threshold and remain inactive otherwise.
Minimizing age of information in vehicular networks
  • S. Kaul, M. Gruteser, V. Rai, J. Kenney
  • Computer Science
    2011 8th Annual IEEE Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks
  • 2011
TLDR
This work proposes a more comprehensive metric, the average system information age, which captures the requirement of emerging applications to maintain current state information from all other nearby nodes, and designs an application-layer broadcast rate adaptation algorithm that effectively adapts the messaging rates and minimizes the system age.
Integrate Learning and Control in Queueing Systems with Uncertain Payoff
We study task assignment in online service platforms where un-labeled clients arrive according to a stochastic process and each client brings a random number of tasks. As tasks are assigned to
Energy Harvesting Powered Sensing in IoT: Timeliness Versus Distortion
TLDR
An Internet of Things-based sensing system, in which an energy harvesting powered sensor observes the phenomenon of interest and transmits its observations to a remote monitor through a Gaussian channel, is considered and it is shown that the optimal transmit power is a monotonic and bivalued function of current AoI and distortion.
Real-time status: How often should one update?
TLDR
A time-average age metric is employed for the performance evaluation of status update systems and the existence of an optimal rate at which a source must generate its information to keep its status as timely as possible at all its monitors is shown.
...
1
2
3
...