More Like this

1. Context-aware Status Updating: Wireless Scheduling for Maximizing Situational Awareness in Safety-critical Systems

   https://doi.org/10.1109/MILCOM58377.2023.10356278  

   Ornee, Tasmeen Zaman ; Shisher, Md Kamran ; Kam, Clement ; Sun, Yin ( October 2023 , IEEE)

   In this study, we investigate a context-aware status updating system consisting of multiple sensor-estimator pairs. A centralized monitor pulls status updates from multiple sensors that are monitoring several safety-critical situations (e.g., carbon monoxide density in forest fire detection, machine safety in industrial automation, and road safety). Based on the received sensor updates, multiple estimators determine the current safety-critical situations. Due to transmission errors and limited communication resources, the sensor updates may not be timely, resulting in the possibility of misunderstanding the current situation. In particular, if a dangerous situation is misinterpreted as safe, the safety risk is high. In this paper, we introduce a novel framework that quantifies the penalty due to the unawareness of a potentially dangerous situation. This situation-unaware penalty function depends on two key factors: the Age of Information (AoI) and the observed signal value. For optimal estimators, we provide an information-theoretic bound of the penalty function that evaluates the fundamental performance limit of the system. To minimize the penalty, we study a pull-based multi-sensor, multi-channel transmission scheduling problem. Our analysis reveals that for optimal estimators, it is always beneficial to keep the channels busy. Due to communication resource constraints, the scheduling problem can be modelled as a Restless Multi-armed Bandit (RMAB) problem. By utilizing relaxation and Lagrangian decomposition of the RMAB, we provide a low-complexity scheduling algorithm which is asymptotically optimal. Our results hold for both reliable and unreliable channels. Numerical evidence shows that our scheduling policy can achieve up to 100 times performance gain over periodic updating and up to 10 times over randomized policy. 

   more » « less
2. An Age Control Transport Protocol for Delivering Fresh Updates in the Internet-of-Things

   https://doi.org/10.1109/WoWMoM.2019.8793011  

   Shreedhar, Tanya ; Kaul, Sanjit K. ; Yates, Roy D. ( June 2019 , 2019 IEEE 20th International Symposium on "A World of Wireless, Mobile and Multimedia Networks" (WoWMoM))

   Internet-of-Things (IoT) applications have sources sense and send their measurement updates over the Internet to a monitor (control station) for real-time monitoring and actuation. Ideally, these updates would be delivered fresh, at a high rate constrained only by the supported sensing rate. However, such a rate may lead to network congestion related delays in delivery of updates at the monitor that make the freshest update at the monitor unacceptably old for the application. Alternately, at low rates, while updates arrive at the monitor with smaller delays, new updates arrive infrequently. Thus, both low and high rates may lead to an undesirably aged freshest update at the monitor. We propose a novel transport layer protocol, namely the Age Control Protocol (ACP), which enables timely delivery of such updates to monitors over the Internet in a network-transparent manner. ACP adapts the rate of updates from a source such that the average age of updates at the monitor is minimized. We detail the protocol and the proposed control algorithm. We demonstrate its efficacy using extensive simulations and realworld experiments, including wireless access for the sources and an end-to-end connection with multiple hops to the monitor. 

   more » « less
3. Privacy Leakage in Discrete-Time Updating Systems

   https://doi.org/10.1109/ISIT50566.2022.9834673  

   Sathyavageeswaran, Nitya ; Yates, Roy D. ; Sarwate, Anand D. ; Mandayam, Narayan ( June 2022 , 2022 IEEE International Symposium on Information Theory (ISIT))

   A source generates time-stamped update packets that are sent to a server and then forwarded to a monitor. This occurs in the presence of an adversary that can infer information about the source by observing the output process of the server. The server wishes to release updates in a timely way to the monitor but also wishes to minimize the information leaked to the adversary. We analyze the trade-off between the age of information (AoI) and the maximal leakage for systems in which the source generates updates as a Bernoulli process. For a time slotted system in which sending an update requires one slot, we consider three server policies: (1) Memoryless with Bernoulli Thinning (MBT): arriving updates are queued with some probability and head-of-line update is released after a geometric holding time; (2) Deterministic Accumulate-and-Dump (DAD): the most recently generated update (if any) is released after a fixed time; (3) Random Accumulate-and-Dump (RAD): the most recently generated update (if any) is released after a geometric waiting time. We show that for the same maximal leakage rate, the DAD policy achieves lower age compared to the other two policies but is restricted to discrete age-leakage operating points. 

   more » « less
4. Fundamental Bounds on the Age of Information in Multi-Hop Global Status Update Networks

   Farazi, Shahab ; Klein, Andrew G. ; Brown, D. Richard ( January 2019 , Age of Information Workshop (INFOCOM 2019))

   This paper studies the “age of information” in a general multi-source multi-hop wireless network with explicit channel contention. Specifically, the scenario considered in this paper assumes that each node in the network is both a source and a monitor of information, that all nodes wish to receive fresh status updates from all other nodes in the network, and that only one node can transmit in each time slot. Lower bounds for peak and average age of information are derived and expressed in terms of fundamental graph properties including the connected domination number. An algorithm to generate near-optimal periodic status update schedules based on sequential optimal flooding is also developed. These schedules are analytically shown to exactly achieve the peak age bound and also achieve the average age bound within an additive gap scaling linearly with the size of the network. Moreover, the results are sufficiently general to apply to any connected network topology. Illustrative numerical examples are presented which serve to verify the analysis for several canonical network topologies of arbitrary size, as well as every connected network with nine or fewer nodes. 

   more » « less
5. Timely Updates By Multiple Sources: The M/M/1 Queue Revisited

   https://doi.org/10.1109/CISS48834.2020.1570627741  

   Kaul, Sanjit K. ; Yates, Roy D. ( March 2020 , 2020 54th Annual Conference on Information Sciences and Systems (CISS))

   Multiple sources submit updates to a monitor through an M/M/1 queue. A stochastic hybrid system (SHS) approach is used to derive the average age of information (AoI) for an individual source as a function of the offered load of that source and the competing update traffic offered by other sources. This work corrects an error in a prior analysis. By numerical evaluation, this error is observed to be small and qualitatively insignificant. 

   more » « less