New uses of wireless communication are envisioned to realize real-time control applications through networked monitoring. In such scenarios, the freshness of collected status updates is of critical importance for system performance, which can be quantified by the performance metric called Age of Information (AoI). In this paper, we apply this performance metric to study an age minimization problem in a wireless monitoring system where sensor nodes are employed to collect status information about their surroundings. The sampled data are forwarded to central controller via multiple hops. The problem formulation involvesjoint consideration of data sampling at source, flow routing, and link scheduling along the transmission path. The formulated problem falls in the form of an integer nonlinear program (INLP). To efficiently solve the problem, we construct AoI reward function to decouple the time coupling among sampling and relay decisions. Considering the system stability, we employ Lyapunov optimization technique to develop a distributed sampling and relay scheme. Simulation results show that the performance of our proposed scheme is competitive in terms of delivering status updates in a timely manner.
%0 Conference Paper
%1 xin20ITC32
%A Zhao, Xinlong
%A Song, Xianxin
%A Liu, Xin
%A Qin, Xiaoqi
%A Li, Hang
%B 32th International Teletraffic Congress (ITC 32)
%C Osaka, Japan
%D 2020
%K Age_of_information_(AoI) itc itc32 multihop_network networked_monitoring transmission_scheduling
%T A Distributed Data Sampling and Relay Scheme for Obtaining Fresh Updates in Multihop Networks
%U https://gitlab2.informatik.uni-wuerzburg.de/itc-conference/itc-conference-public/-/raw/master/itc32/xin20ITC32.pdf?inline=true
%X New uses of wireless communication are envisioned to realize real-time control applications through networked monitoring. In such scenarios, the freshness of collected status updates is of critical importance for system performance, which can be quantified by the performance metric called Age of Information (AoI). In this paper, we apply this performance metric to study an age minimization problem in a wireless monitoring system where sensor nodes are employed to collect status information about their surroundings. The sampled data are forwarded to central controller via multiple hops. The problem formulation involvesjoint consideration of data sampling at source, flow routing, and link scheduling along the transmission path. The formulated problem falls in the form of an integer nonlinear program (INLP). To efficiently solve the problem, we construct AoI reward function to decouple the time coupling among sampling and relay decisions. Considering the system stability, we employ Lyapunov optimization technique to develop a distributed sampling and relay scheme. Simulation results show that the performance of our proposed scheme is competitive in terms of delivering status updates in a timely manner.
@inproceedings{xin20ITC32,
abstract = {New uses of wireless communication are envisioned to realize real-time control applications through networked monitoring. In such scenarios, the freshness of collected status updates is of critical importance for system performance, which can be quantified by the performance metric called Age of Information (AoI). In this paper, we apply this performance metric to study an age minimization problem in a wireless monitoring system where sensor nodes are employed to collect status information about their surroundings. The sampled data are forwarded to central controller via multiple hops. The problem formulation involvesjoint consideration of data sampling at source, flow routing, and link scheduling along the transmission path. The formulated problem falls in the form of an integer nonlinear program (INLP). To efficiently solve the problem, we construct AoI reward function to decouple the time coupling among sampling and relay decisions. Considering the system stability, we employ Lyapunov optimization technique to develop a distributed sampling and relay scheme. Simulation results show that the performance of our proposed scheme is competitive in terms of delivering status updates in a timely manner.},
added-at = {2021-03-02T15:22:25.000+0100},
address = {Osaka, Japan},
author = {Zhao, Xinlong and Song, Xianxin and Liu, Xin and Qin, Xiaoqi and Li, Hang},
biburl = {https://www.bibsonomy.org/bibtex/27d5b162d6d9e2c4fd5c8c8154d4fe424/itc},
booktitle = {32th International Teletraffic Congress (ITC 32)},
interhash = {229d44783ec7260a1d3349decc23ba84},
intrahash = {7d5b162d6d9e2c4fd5c8c8154d4fe424},
keywords = {Age_of_information_(AoI) itc itc32 multihop_network networked_monitoring transmission_scheduling},
timestamp = {2021-03-02T15:22:25.000+0100},
title = {A Distributed Data Sampling and Relay Scheme for Obtaining Fresh Updates in Multihop Networks},
url = {https://gitlab2.informatik.uni-wuerzburg.de/itc-conference/itc-conference-public/-/raw/master/itc32/xin20ITC32.pdf?inline=true},
year = 2020
}