Optimizing Urgency of Information through Resource Constrained Joint Sensing and Transmission

Applications requiring services from modern wireless networks, such as those involving remote control and supervision, call for maintaining the timeliness of information flows. Current research and development efforts for 5G, Internet of things, and artificial intelligence technologies will benefit from new notions of timeliness in designing novel sensing, computing, and transmission strategies. The age of information (AoI) metric and a recent related urgency of information (UoI) metric enable promising frameworks in this direction. In this paper, we consider UoI optimization in an interactive point-to-point system when the updating terminal is resource constrained to send updates and receive/sense the feedback of the status information at the receiver. We first propose a new system model that involves Gaussian distributed time increments at the receiving end to design interactive transmission and feedback sensing functions and develop a new notion of UoI suitable for this system. We then formulate the UoI optimization with a new objective function involving a weighted combination of urgency levels at the transmitting and receiving ends. By using a Lyapunov optimization framework, we obtain a decision strategy under energy resource constraints at both transmission and receiving/sensing and show that it can get arbitrarily close to the optimal solution. We numerically study performance comparisons and observe significant improvements with respect to benchmarks.


Introduction
As demand from wireless networks exponentially increases to enable emerging technologies, the timeliness of data delivery and adaptation to the context of information becomes essential for improved quality of service and experience in time-sensitive applications. To this end, the measurement and improvement of the timeliness of data delivery and the effective adaptation to the context of delivered data have been fundamental challenges that researchers and practitioners have worked on actively in recent years. The age of information (AoI) is a well-known metric to measure the timeliness of data from the perspective of the nodes receiving or consuming data [1] and is expressed as the time elapsed since the generation of the latest received data. Although AoI has received much interest as a metric representing the freshness of information, new metrics are needed to address nonlinearity in the aging of data and time-varying value or context associated with flowing data. As a matter of fact, context-based applications (e.g., automatic driving and artificial intelligence) and nonlinear age [2][3][4] (as in many IoT applications) require a departure from AoI definition and analysis. Toward this end, the references [5,6] recently proposed an urgency of information (UoI) framework by combining the timeliness and context associated with information updates. In these papers, UoI was formally defined as the product of context-aware weight and the cost resulting from real-time estimation error in a Gaussian dynamical system, the latter being a well-known nonlinear function of AoI. UoI expression can be expressed in mathematical form as follows: where w t is the nonnegative coefficient representing the context or value at a specific time t, δ(.) is the cost function, and C(t) is the instantaneous cost measuring the urgency. This formulation subsumes the typical definition of AoI. If C(t) increases by one each time an update is not received, then the common AoI problem can be formulated as w t = 1 and δ(Q(t)) = U(t)C(t), where U(t) is an indicator that shows whether the information is updated or not. In our current paper, we will pursue a similar metric whereby the urgency level is represented by a coefficient w t , which will be set as an independent, identically distributed random process that shows how crucial the status information is at a specific moment t. In addition, we will pursue a quadratic cost function. This formulation enables us to analyze error increments and connect the proposed framework to the classical AoI problem. The UoI framework in this paper will be designed to measure the expected performance degradation as a weighted sum of expected staleness or informativeness of the latest sensed Gaussian process at the receiving end with respect to the transmitter and the lack of synchrony between them, maintained by status updating from the transmitting end to the receiving end. Our goal is to build a systematic understanding on the interaction of feedback sensing and update transmission to maintain improved UoI levels measuring the synchrony and informativeness of information at one side about the other side when both actions are resource constrained. We will employ Lyapunov optimization tools to address this crucial problem.
Lyapunov optimization methods and tools have been well-known to various research communities to control queues and more generally dynamical systems in a near-optimal sense. In the context of queuing theory, the state of a system at a particular time is the vector of realizations of error variables which can easily be brought in queue forms by lower bounding it by zero and studied for upper bounding the optimal cost. Typically, the cost function is defined to take smaller value when the system moves toward the desirable states. System stability is achieved by taking control actions that make the Lyapunov drift in the negative direction toward zero. The key requirement is that all the queues and virtual queues in the system are mean rate stable [7,8]. In addition, the target function is achieved by taking control actions that minimize the Lyapunov penalty. However, because of the system stability awareness, the solution always has a gap with the optimal solution. Due to its general applicability in queuing theory, Lyapunov optimization is also used in AoI analysis and optimization. Ref. [9] used Lyapunov optimization to identify the tradeoff between AoI, accuracy, and completeness with the constrained throughput optimization problem. Ref. [10] used Lyapunov optimization to jointly minimize the average cost of sampling and transmitting status updates by users over a wireless channel subject to average AoI constraints.
Our work's motivation is rooted in AoI research that was presented in the recent past. We next aim to cover some of the literature that relates to the proposed research in this paper. The references [11,12] address varying source update frequency and [13,14] address service rate in various queuing models. In the wireless network scenario, the scheduling algorithms for optimizing AoI is studied extensively, such as those considering the channel state [15,16], throughput [17][18][19], energy harvesting [20][21][22], and average resource constraints [23,24], multiple sources [25][26][27][28], and multiple channels [29][30][31][32] to name a few. Ref. [33] studied the calculation and iterative process of AoI in combination with queuing theory and gave the analytic formula of average AoI under the random scheduling strategy. Ref. [34] explored the impact of service rate on average AoI under fixed deadline constraints and random exponential deadline constraints. Regarding link scheduling in wireless networks, ref. [35] studied the link-scheduling problem for every time slot under periodic data updates, and proposed random, greedy, Lyapunov optimization, Whittle Index, and other strategies for link scheduling to optimize the average AoI of the network. Ref. [36] proposed offline and online scheduling algorithms based on the Markov decision process for the random data arrival scenario.
Feedback is also an essential factor in wireless communication scenarios and can influence the AoI performance significantly. In particular, it is well known that the feedback may help maintain expedient processing, non-repetitive transmission, and hence, energy efficiency in wireless transmission. For the case of battery-based non-energy harvesting devices, it is also vital to schedule appropriate transmission and sensing strategies to prolong the device's life. As a result, the role of feedback and energy cost in AoI analysis and optimization has received much interest from the research community (see e.g., [37][38][39][40][41]). Additionally, ref. [42] proves that the AoI and energy-harvesting scheduling strongly differ with or without the feedback. Refs. [43,44] minimized the AoI when the sensor uses ON/OFF schemes with energy harvesting nodes. Ref. [45] focused on the extreme cases of one unit battery and infinite battery situations to minimize the average peak AoI with energy constraints. Most recently, the paper [46] provided an analysis of feedback cost in AoI optimization over a point-to-point channel and determined specific conditions when feedback may or may not be useful for AoI optimization.
Decisions to sense/receive updates under energy constraints have also been of interest to AoI researchers. In particular, energy constraints can limit the chance of sensing new data and hence cause AoI to increase. In this context, refs. [47,48] proposed the joint scheduling of sense and transmission schemes to optimize the average peak AoI in an energy-harvesting system. In this paper, we will combine the concept of feedback and sensing, which means that the system will decide whether to sense the feedback information as input. As other related research, refs. [49,50] studied the value of information (VoI) in status update systems, and compared the performance of VoI with AoI. We also refer the reader to the related paper [51]. Based on the idea that AoI is only important when the receiver performs a query, refs. [52,53] proposed the age of information at query (QAoI) and optimized the QAoI.
In this paper, we will extend the UoI optimization framework in [6] to an interactive scenario by considering sensing/receiving costs at the updating terminal under energy resource constraint by using a Lyapunov optimization framework. Resource constraints in receiving/sensing the feedback can be interpreted as a limitation due to processing or energy to make it available for decision making on update transmission. Our motivation can be compared to that of [46] as well, which assumes the cost of feedback is incurred at the receiving end. This new problem calls for coordinated decisions to sense the feedback from the receiver and transmit the update to the receiver. Additionally, we need to account for relativity with respect to the transmitter and receiver sides and measure urgency by using a weight representing their importance under resource constraints. Our framework will address these new issues.
As the main contributions of this paper, we extend the UoI optimization framework by using a new definition that addresses the interactive nature of the setting when transmitting and receiving/sensing information is costly and average resource constraints are present on both actions. Constructing the objective function by assigning different weights to the urgency levels at the transmitting and receiving terminals, we determine jointly optimal scheduling of transmission and receiving/sensing the feedback by using a Lyapunov optimization framework. We obtain the Lyapunov gap and show that the result can be made arbitrarily close to the optimal solution. Our simulation results show that the proposed algorithm performs significantly better than two benchmark schemes, namely the greedy and AoI optimal algorithms.
The rest of the paper is organized as follows. In Section 2, we present the system model of the UoI problem. In Section 3, we formulate the UoI problem and analyze it. In Section 4, we offer numerical results to show the behavior of the solution. Finally, we conclude this paper in Section 5 by summarizing our contributions and discussing future directions.

System Model
We consider the system model in Figure 1. Here, the time is slotted: t = 1, 2, . . . , T. The information-carrying signal in the service center and terminal, A t and Q t , are as follows: The variable K t ∼ N (0, σ 2 ) represents the increments added to the information-carrying signal A t and is a Gaussian random variable independent over time and other variables. For convenience, we take the variable A 1 , Q 1 ∼ N (0, σ 2 ); however, the initial conditions are assumed given and do not determine the outcome as long as they come from a wellbehaving distribution that makes the expectations well defined (c.f. Lemma 3 below). U 1 (t), U 2 (t) ∈ {0, 1} are decision variables to determine whether to transmit an update and sense the feedback, respectively. Equation (2) represents the evolution of information at the receiver with respect to the sensing at the transmitter. When U 2 (t) = 1, the sensing action is activated and the information at both ends are synchronized except an additive Gaussian noise due to causality and one time slot difference. The Equation (3) represents the evolution of the information at the transmitter with respect to the receiver side. These two equations represent the interaction between the transmitter and the receiver. Note that if the transmission or sensing does not happen, i.e., if U 1 (t)S t = 0 or U 2 (t) = 0, then Q t or A t , respectively, will become noisier. This is at the heart of the urgency of information notion we pursue in this paper. When a transmission does not happen (due to not transmitting or a channel erasure), the synchrony between the two sides, represented by Q t , is not affected as long as a new sensing action is not taken. At the beginning of the tth time slot, the terminal first decides U 1 (t) ∈ {0, 1} to determine whether to transmit the information-carrying variable Q t to the service center or not. The transmission takes one time slot and goes through an erasure-type wireless channel represented by S t with a fixed failure transmission rate p. In particular, S t = 1 if the transmission is successful and S t = 0 otherwise. At the same time, the service center feeds back A t to the terminal, which also takes one time slot with no failure rate. At the end of the tth time slot, the feedback arrives at the terminal, and the terminal will decide U 2 (t) ∈ {0, 1} to determine whether to sense the feedback or not. We can, in principle, let A t and Q t evolve as max{(1 − U 2 (t))A t + K t , 0} and max{(1 − S t U 1 (t))Q t + U 2 (t)A t , 0} with nonnegative initial values. These versions bring these system states to the form of queues with potentially dependent arrivals and departures. Our Lyapunov drift plus penalty-based analysis will be applicable for both versions. We therefore prefer to keep them as in (2) and (3) in the ensuing analysis. Now we can elicit our optimization problem P 1 to minimize an upper bound of average UoI: where π t is the set of sequence of decisions π t = {U 1 (t), U 2 (t)}, w t is the nonnegative weight of urgency modeled as an i.i.d. random variable, M is the weight of the relative error of the variable A t at the transmitter side, ϕ 1 is the energy (or frequency) constraint on transmission, and ϕ 2 is the energy (or frequency) constraint on sensing. In order to satisfy the average transmission/sensing frequency constraints (5) and (6), we define the virtual queues H t and G t as follows, which are both initialized at 0: Next, let us consider the evolution of the transmission virtual queue: If the terminal decides to transmit at time slot t, the transmission virtual queue H t will increase by 1 − ϕ 1 . Otherwise, it will decrease by ϕ 1 . As a result, the longer the virtual queue, the more transfers will be performed. The virtual queue of sensing G t evolves similarly. Therefore, these two virtual queues can appropriately express the usage of the historical transmission/sensing frequency.

Optimizing the Urgency of Information in P 1
In this section, we will systematically develop a Lyapunov optimization framework for optimizing an upper bound for the solution of P 1 . We summarize the notations we use throughout the rest of the paper in Table 1.
Set of Given Parameters in t th Time Slot

Lyapunov Function Definitions
In order to use the Lyapunov optimization framework, we will first define the Lyapunov drift function ∆ t by using the quadratic sum of system states: where V, Z, θ and β are the weights for different variables, which represent different importance levels of the stability of the queues or system states H t , G t , Q t and A t , respectively. In our analysis, we use the terms "queue" or "system state" interchangeably. Although the evolution of A t and Q t in (2) and (3) can take negative values, we can redefine them by lower bounding their evolution by zero and make their definitions suitable as a queue with arrivals and departures potentially depending on the control actions. However, none of the analysis steps we take in this paper will be affected by this redefinition, as the Lyapunov analysis we present essentially optimizes a bound on the system performance. We therefore continue using the original definitions (2) and (3). The Lyapunov drift function for this system can be expressed as where n t is the number of time slots since the last time we decide to sense the feedback. It is obvious that in tth time slot, the terminal has a knowledge of H t , G t , Q t . However, the terminal cannot access the specific value of A t because the latest estimation error arrived at the service center at the end of (t − 1)st time slot. Nevertheless, the terminal is aware of the number of time slot since the last time it decides to sense n t , which can be expressed as: As a result, the terminal will decide whether to sense based on the number of time slot since the last time it decided to sense n t rather than the error in the service center A t .

Lemma 1.
In each time slot t, given the error in terminal Q t , urgency weight at the next time slot w t+1 , the number of time slots since the last time terminal decides to sense n t , virtual queue length H t and G t , set Y t = {Q t , n t , H t , G t , w t+1 }, we can obtain an upper bound on the Lyapunov drift ∆ t as Proof. See Appendix A.
Denote the penalty in the tth time slot by f t . Because of causality, , where R is the weight of the UoI compared with system stability and the remaining terms represent UoI at t + 1.

Lemma 2.
If we set the penalty in the tth time slot as f t = Rw t+1 (Q t+1 2 + MA t+1 2 ), and the average of the weight of the urgency as ∼ w. The Lyapunov drift plus penalty function is upper bounded as: Proof. See Appendix B.
where C is a constant, then all the queues and virtual queues in the system are mean rate stable.
Proof. See Appendix C.

Finding Appropriate Weights for the System
Next, we are going to find the optimal value of the weight parameters θ and β to minimize the right hand side of (13) to the extent possible. Note that it is feasible to use a stationary randomized scheme that independently transmits and senses with probability ϕ 1 and ϕ 2 at each time slot, which translates to E[U 1 (t)] = ϕ 1 and E[U 2 (t)] = ϕ 2 . As a result, we reorder (13) to get To make the right hand side of (14) no larger than a constant, we want the coefficients of Q t 2 and n t σ 2 no larger than 0. For the coefficient of Q t 2 , For the coefficient of n t σ 2 , As a result, we take the value of the parameters θ and β as Put the value of the parameters θ and β back to (14), then we can get the upper bound of Note that the right hand of (19) is a constant, which means that all the queues and virtual queues in the system are mean rate stable under above derived conditions.

Deriving Lyapunov Optimal Decisions
We now minimize the upper bound in the RHS of (13), which is actually in the following form: We next show the scheduling scheme for each time slot. Putting the value of the parameters θ and β back to (20), we get the following: Set the update index ϕ 2 )Rn t σ 2 , and then the solution to the scheme (20) can be achieved: We summarize below the resulting Lyapunov optimal Algorithm 1.

Algorithm 1 Decisions scheduling scheme based on Lyapunov optimization
Require: A 0 , Q 0 , H 0 , G 0 , n 0 , S t , K t , ϕ 1 , ϕ 2 , w t , ∼ w, V, Z, M, R 1: for each time slot t do 2: 3: if a t < 0 then if b t < 0 then Calculate Calculate G t+1 = max{G t − ϕ 2 + U 2 (t), 0}; 18: Calculate n t+1 = (1 − U 2 (t))n t + 1; 19: end for Based on the algorithm, we can make decisions by scheduling every time slot to minimize the value of UoI and maintain the virtual queue stability simultaneously. From the algorithm, it is apparent that we can successfully decouple the joint decisions into two independent threshold schemes, which makes the implementation desirably simple.

Solving for the Target Function and Lyapunov Gap
In this section, we will solve for the target function and achieve the expression of the gap between the optimal solution and the result obtained by the Lyapunov optimization algorithm. We will also prove that the result gained by the Lyapunov optimization algorithm can be infinitely close to the optimal solution. Now make the summation of the total T-time slot on both sides of (19), and we can get Note that L T ≥ 0 and L 0 T = 0, and then divide T on both sides of (24) to get the time-averaged result Theorem 1. Set the problem of (20) as P 2 (π t ), and then the solution of P 2 (π t ) will satisfy the following gap: That is, the solution of P 2 (π t ) can be approximated by the solution of P 1 (π t ), and the gap between them is (V+Z) 2R .

Proof. See Appendix D.
To be precise, the proof of this gap result in Appendix D requires A t and Q t in (2) and (3) to be lower bounded by zero. Nevertheless, our numerical results show consistence with this gap even when they are non-negative. Note that as the value of R is taken as large as possible, and the result obtained by the Lyapunov optimization algorithm P 2 (π t ) can be made arbitrarily close to the optimal result P * 1 (π t ). (V+Z) 2R can also seem to be the ratio of the weight of the energy constraints and UoI, which shows the tradeoff between the UoI and the energy constraints.

Numerical Results
In this section, we present extensive numerical results to explore the behaviour of the optimal scheme under various constraints and scenarios. At the beginning of each time slot, the terminal first decides whether to transmit the error packets to the service center or not. The transmission takes 1 ms and goes through a wireless channel with a fixed failure transmission rate. At the same time, the service center transmits the estimation error (feedback) to the terminal, which also takes 1 ms with no failure rate. At the end of each time slot, the feedback arrives at the terminal, and the terminal will decide whether to sense this feedback. Meanwhile, the service channel receives the error packets and the latest estimation of Gaussian noise. The service center will immediately calculate the error difference between the transmitted status information and the received status information and add that new error into the error packet.

Response to Urgency Levels
To demonstrate the system's response to a new urgency, for every 5000 time slots, we set W = 100 in the 50 consecutive time slots and W = 1 in the rest of the time slots. The transmission/sense energy constraints are set as ϕ 1 = 0.25 and ϕ 2 = 0.5. The channel error rate is p = 0.8, the weight of the UoI is set as M = 2.5 and R = 2, and the weight of the system states is set as V = Z = 1. Additionally, the Gaussian noise variance will be set to unity. Figures 2-4 show a sample evolution of the squared of errors MA 2 t + Q 2 t and two virtual queue length H t , G t . Observing Figures 2-4, we understand that when the urgency level rises, the square of errors will drop significantly, and the virtual queues will keep increasing because update transmissions are ramped up. However, due to the energy constraints, the terminal's probability of transmitting and sensing are affected. This is the reason why the square of errors will increase, and the transmission virtual queue will decrease after the urgency. These show that the system can swiftly respond to urgency levels while keeping the error variance portion of UoI (i.e., Q 2 t + MA 2 t ) at a reasonable level at all times.

Tradeoff between UoI and System Parameters
In this section, we compare how the relationship between different variables will affect the UoI in the system. Unless otherwise specified, we set the energy constraint of transmission/sensing as ϕ 1 = ϕ 2 = 0.8, the weight of the system stability as V = Z = 1, the weight of totally UoI and the UoI in service center as R = M = 2, the channel error rate as p = 0.8, and the weight of urgency at each time slot is i.i.d. with probability 0.99 being 1 and probability 0.01 being 100. Figures 5 and 6 present the relationship between UoI and transmission/sense energy constraint. They also show the effect of system stability weights on UoI. In Figure 5, the energy constraint of transmission ranges from 0.1 to 1.0, and the weight of the queue stability (i.e., the virtual queue levels) in the transmission part will be set as V = 1, 10, 100, and 1000. Similarly, in Figure 6, we set the energy constraint of sensing from 0.1 to 1.0 and Z = 1, 10, 100, and 1000. We observe that when average energy is less constrained, the UoI decreases. However, the UoI will not change much when the transmission frequency reaches 0.5. This is due to the fact that the frequency constraint becomes inactive after a certain level depending on the sensing activity. As sensing and transmission are in tandem, the higher frequency drives the overall performance. Moreover, when the weight of the stability V and Z are small, e.g., V = 1 or Z = 1, we pay more attention to the value of UoI than the frequency of transmission levels, yielding a virtual queue significantly above the set constraint. On the other hand, if we set the weight of the stability V and Z at a high level, e.g., V = 1000 or Z = 1000, the virtual queue stability becomes much more important, which compromises UoI performance.
In Figure 7, the energy constraint of transmission will be set from 0.1 to 1.0, and the failure probability of transmission will be set as p = 0.2, 0.4, 0.6, 0.8, and 1.0. We observe that the higher p is, the lower the average UoI is. This is because we need to decide to transmit more frequently to achieve the optimal average of UoI when the success rate is lower. In Figure 8, we observe that the average UoI decreases no matter whether ϕ 1 or ϕ 2 increases because we have more chances to transmit or sense when the energy is sufficient. Additionally, as ϕ 2 gets smaller, the curve will converge earlier because the error packets in the service center are the input of the terminal. When we have less probability of sensing the feedback, the transmission frequency will also not be large because of the input limitation, even if the transmission energy is sufficient. In Figure 9, we set the weight of total UoI as R = 1, 8, 16 and 64, and the weight of two virtual queues as V = Z = 20. As expected, the larger the weight of the total UoI is, the smaller the average UoI will be. This is because the system will consider the UoI more important and will take more chances to transmit and sense. Moreover, the Lyapunov gap, i.e., (V+Z) 2R , will diminish as R increases.

Tradeoff between UoI and System Stability
The tradeoff between the target function and the system stability is always an exciting and crucial question in the Lyapunov optimization framework. This section will show examples of how different weights can affect the system stability and UoI. We set T = 10, 000 and channel error rate as p = 0.8. The urgency weight w t is determined as an i.i.d. random process with probability 0.99 being 1 and probability 0.01 being 1000. We will observe the number of update transmissions and senses (i.e. the energies spent for update transmission and sensing throughout T = 10, 000 slots) to represent system stability.
In Figures 10 and 11, we set the weight of the system stability as V = Z = 10, and the weight of UoI as R = M = 2. As the energy is sufficient, we can have more chances to transmit and sense. In addition, the number of transmissions is always smaller or equal to the number of senses. This makes sense because the input error in the terminal comes from the service center and will be sent together in one transmission. In addition, even if there is no energy constraint for the transmission, e.g., ϕ 1 = 1.0, the number of transmissions will not reach the value of constraints. This is due to the fact that the frequency constraint becomes inactive after a certain level. However, when ϕ 2 ≤ 0.2, the energy spent for sensing goes above the set energy constraints. The reason is that the weight of UoI is much larger than the weight of stability. This means that the system will sacrifice stability for better UoI. In Figures 12 and 13, we set the weight of the system stability as V = Z = 80, which is larger than the weight of UoI. We see that both the transmission and sensing constraints are not binding. Comparing with the Figures 5 and 6, we observe that the UoI with V, Z = 100 is close to the UoI with V, Z = 1. Hence, by sacrificing a small amount of UoI, a very stable system can be guaranteed. In Figure 14, we set the weight of the UoI in service center as M ∈ [1, 10], the weights Z = 8, 16, 32, 64, and 128, and V = 5, ϕ 1 = 0.5 and ϕ 2 = 0.8. The virtual queue G t is small when its weight is large, and the energy constraints are tight. In addition, when the weight of UoI in the service center M increases, the sensing time will keep increasing because the UoI in the service center is much more important than the virtual queue stability and the information in the terminal. This also exemplifies that our framework can accommodate different cases flexibly by using different weights.

Comparison of Lyapunov Optimal Performance with Other Algorithms
The greedy and probabilistic algorithms are also very suitable naive algorithms to solve this problem. The main idea of the greedy algorithm is that the terminal will decide to transmit/sense at time t if the instantaneous transmission/sensing frequency at time t has not reached the corresponding set limits. Moreover, for the probabilistic algorithm, in each time slot the terminal will transmit/sense with probability equal to the value of frequency constraints. For Figure 15, we set the weight of system stability as V = Z = 30. Channel success rate is set as p = 0.6, sense energy constraint is set as ϕ 2 = 0.8, and the weight of urgency at each time slot is the same as before. Because the greedy algorithm takes action independent of urgency, we will compare the average UoI with w t = 1. From the figure, the average error portion of UoI (i.e., Q 2 t + MA 2 t ) obtained by Lyapunov optimization is always lower than the other two algorithms, especially when the energy is insufficient and the gap closes with increasing energy availability. Recall that UoI can subsume various AoI problems. For instance, if we set the cost function δ(.) as a linear function with the unit parameter and the urgency weight w t = 1, then we can express the AoI in terminalQ t and the AoI in service centerÃ t as Let us use the same Lyapunov optimization algorithm described earlier along with the same weights for system state variables and target function for a fair comparison. In Figure 16, we set the weight of virtual queues as V = Z = 20, the weight of UoI as R = M = 2, the weight of system states θ, β in AoI optimal will be the same as the value of UoI optimal and will be calculated each round. Additionally, set the probability of fail transmission as p = 0.6, sensing frequency limitation as ϕ 2 = 0.6. We can deduce that the average UoI obtained by UoI optimal is much better than the value obtained by AoI optimal. In addition, the value of average UoI by UoI optimal is smaller than that of the average weighted AoI by AoI optimal. This is because, in the AoI model, the increment K t will always be 1; however, the UoI model yields a lower expectation.

Conclusions
This paper focused on urgency of information (UoI) optimization through joint sensing and transmission. We proposed a new interactive status updating problem over a point-topoint channel in which transmission and sensing actions are determined to minimize UoI as a combination of the staleness of sensed data and synchronization between two ends under resource constraints, and we used a Lyapunov optimization framework for its optimization. We obtained the gap between the optimal solution and the result gained by the Lyapunov optimal algorithm, and proved that the gap between them can be made arbitrarily small. We presented an extensive numerical study that illustrates various features of the model and resulting algorithm, and potential performance improvements with respect to several schemes. In our future work, we plan to extend this work in multiple directions such as the case of multiple terminals in series or parallel, on demand UoI definition and optimization as well as the cases of computation transmission tradeoffs and dynamical energy constraints.

Conflicts of Interest:
The authors declare no conflict of interest.

Appendix A
Based on (7) we can get the following sequence of steps: where the first inequality follows from the definition of H t in (7) used in the identity that for any X = max{a + b − c, 0}, X 2 ≤ (a + b − c) 2 , the following equalities follow from rearranging terms and the final inequality follow from ϕ 1 − U 1 (t) ≤ 1. Based on Equation (8), and using the same method as that for obtaining (A1), we get the following inequality: Based on (2), we have Recall that K t ∼ (0, σ 2 ) follows i.i.d Gaussian distributions. This is due to the fact that the queue A t is the summation of K t ; it is obvious that the summation of the Gaussian distribution is still a Gaussian distribution. As a result, the error in the service center also follows a Gaussian distribution A t ∼ (0, nσ 2 ). In addition, as U 2 (t) ∈ {0, 1}, we can simplified (A3) by U 2 (t) 2 = U 2 (t) and (1 − U 2 (t)) 2 = 1 − U 2 (t). As a result, we have Based on (3) and the fact that (1 − U 1 (t)S t ) 2 = (1 − U 1 (t)S t ), we have Based on (A1)-(A5), we have

Appendix C
We start by assuming that the initial values satisfy E[L 0 ] < ∞. If ∆ t + E[ f t ] ≤ C, where C is a constant, then take the summation over T time slots to get Based on (9) we have From the definition of the virtual queue H t (A1), it is obviously that E (H 2 t ) ≥ (E[(H t )] ) 2 , and also because the penalty function f t is always non-negative, we can change (A9) into Since T → ∞, the right hand side of (A11) is equal to 0. As a result, As a result, the virtual queue H t is mean rate stable. The other system states Q t , A t and the virtual queue Z t can be proven as mean rate stable with the same method above. Therefore, the expressions of the queues in the system are appropriate, and the Lyapunov optimization algorithm is applicable. We also recall that the evolution of Q t , A t , although not originally in a queue form, can be easily redefined to be bounded below by 0, and the analysis in our paper will be valid without any changes.
easily by observing that the constraints must be active almost always over the T time horizon O(T) time instants: Recalling that queues A t and Q t are mean rate stable, we have, E Q t 2 = E Q t+1 2 and E A t 2 = E A t+1 2 . From (A3)-(A5), we can get the expectation of A 2 t and Q 2 t as As a result, (A17) can be simplified as follows: Now take the summation of the total T-time slot on both sides of (A20) and we have Note that L T ≥ 0 and L 0 T = 0; we then divide T on both sides of (A21) to get the time averaged result Finally, divide R on both side of (A22) to convert f t into target function