Next Article in Journal
Transition Probability Test for an RO-Based Generator and the Relevance between the Randomness and the Number of ROs
Next Article in Special Issue
Age Analysis of Status Updating System with Probabilistic Packet Preemption
Previous Article in Journal
A List-Ranking Framework Based on Linear and Non-Linear Fusion for Recommendation from Implicit Feedback
Previous Article in Special Issue
Implementation and Evaluation of Age-Aware Downlink Scheduling Policies in Push-Based and Pull-Based Communication
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Using Timeliness in Tracking Infections †

1
Coordinated Science Laboratory, University of Illinois Urbana-Champaign, Urbana, IL 61801, USA
2
Department of Electrical and Computer Engineering, University of Maryland, College Park, MD 20742, USA
*
Author to whom correspondence should be addressed.
This paper is an extended version of our paper published in 2021 IEEE INFOCOM 2021—IEEE International Conference on Computer Communications (online), 10–13 May 2021.
Entropy 2022, 24(6), 779; https://doi.org/10.3390/e24060779
Submission received: 8 March 2022 / Revised: 17 May 2022 / Accepted: 27 May 2022 / Published: 31 May 2022
(This article belongs to the Special Issue Age of Information: Concept, Metric and Tool for Network Control)

Abstract

:
We consider real-time timely tracking of infection status (e.g., COVID-19) of individuals in a population. In this work, a health care provider wants to detect both infected people and people who have recovered from the disease as quickly as possible. In order to measure the timeliness of the tracking process, we use the long-term average difference between the actual infection status of the people and their real-time estimate by the health care provider based on the most recent test results. We first find an analytical expression for this average difference for given test rates, infection rates and recovery rates of people. Next, we propose an alternating minimization-based algorithm to find the test rates that minimize the average difference. We observe that if the total test rate is limited, instead of testing all members of the population equally, only a portion of the population may be tested in unequal rates calculated based on their infection and recovery rates. Next, we characterize the average difference when the test measurements are erroneous (i.e., noisy). Further, we consider the case where the infection status of individuals may be dependent, which occurs when an infected person spreads the disease to another person if they are not detected and isolated by the health care provider. In addition, we consider an age of incorrect information-based error metric where the staleness metric increases linearly over time as long as the health care provider does not detect the changes in the infection status of the people. Through extensive numerical results, we observe that increasing the total test rate helps track the infection status better. In addition, an increased population size increases diversity of people with different infection and recovery rates, which may be exploited to spend testing capacity more efficiently, thereby improving the system performance. Depending on the health care provider’s preferences, test rate allocation can be adjusted to detect either the infected people or the recovered people more quickly. In order to combat any errors in the test, it may be more advantageous for the health care provider to not test everyone, and instead, apply additional tests to a selected portion of the population. In the case of people with dependent infection status, as we increase the total test rate, the health care provider detects the infected people more quickly, and thus, the average time that a person stays infected decreases. Finally, the error metric needs to be chosen carefully to meet the priorities of the health care provider, as the error metric used greatly influences who will be tested and at what test rate.

1. Introduction

We consider the problem of timely tracking of an infectious disease, e.g., COVID-19, in a population of n people. In this problem, a health care provider wants to detect infected people as quickly as possible in order to take precautions such as isolating them from the rest of the population. The health care provider also wants to detect people who have recovered from the disease as soon as possible since these people need to return to work which is especially critical in sectors such as education, food retail, public transportation, etc. Ideally, the health care provider should test all people all the time. However, as the total test rate is limited, the question is how frequently the health care provider should apply tests on these people when their infection and recovery rates are known. In a broader sense, this problem is related to timely tracking of multiple processes in a resource-constrained setting where each process takes binary values of 0 and 1 with different change rates.
Recent studies have shown that people who have recovered from infectious diseases such as COVID-19 can be reinfected. Furthermore, the recovery times of individuals may vary significantly. For these reasons, in this problem, the ith person becomes infected with rate λ i which is independent of the others. Similarly, the ith person recovers from the disease with rate μ i . We note that the index i may represent a specific individual or a group of individuals that share common features such as age, gender, and profession. Depending on the demographics, coefficients λ i and μ i may be statistically known by the health care provider. We denote the infection status of the ith person as x i ( t ) (shown with the black curves on the left in Figure 1) which takes the value 1 when the person is infected and the value 0 when the person is healthy. The health care provider applies tests to people marked as healthy with rate s i and to people marked as infected with rate c i . Based on the test results, the health care provider forms an estimate for the infection status of the ith person denoted by x ^ i ( t ) (shown with the blue curves on the right in Figure 1) which takes the value 1 when the most recent test result is positive and the value 0 when it is negative.
We measure the timeliness of the tracking process by the difference between the actual infection status of people and the real-time estimate of the health care provider which is based on the most recent test results. The difference can occur in two different cases: (i) when the person is sick ( x i ( t ) = 1 ) and the health care provider maps this person as healthy ( x ^ i ( t ) = 0 ), and (ii) when the person recovers from the disease ( x i ( t ) = 0 ) but the health care provider still considers this person as infected ( x ^ i ( t ) = 1 ). The former case represents the error due to late detection of infected people, while the latter case represents the error due to late detection of healed people. Depending on the health care provider’s preferences, detecting infected people may be more important than detecting recovered people (controlling infection), or the other way around (returning people to workforce).
The age of information was proposed to measure timeliness of information in communication systems, and has been studied in the context of queueing systems [1,2,3,4,5,6,7,8], multi-hop and multi-cast networks [9,10,11,12,13,14,15,16,17], social networks [18], timely remote estimation of random processes [19,20,21,22,23,24,25], energy harvesting systems [26,27,28,29,30,31,32,33,34,35,36,37,38,39,40], wireless fading channels [41,42], scheduling in networks [43,44,45,46,47,48,49,50,51,52,53,54,55], lossless and lossy source and channel coding [56,57,58,59,60,61,62,63,64,65,66], vehicular, IoT and UAV systems [67,68,69,70], caching systems [71,72,73,74,75,76,77,78,79,80,81,82], computation-intensive systems [83,84,85,86,87,88,89,90], learning systems [91,92,93], gossip networks [94,95,96,97] and so forth. A more detailed review of the age of information literature can be found in references [98,99,100]. Most relevant to our work, the real-time timely estimation of single and multiple counting processes [19,25], a Wiener process [20], a random walk process [101], and binary and multiple states Markov sources [23,51,102] have been studied. The study that is closest to our work is reference [23], where the remote estimation of a symmetric binary Markov source is studied in a time-slotted system by finding the optimal sampling policies via formulating a Markov Decision Process (MDP) for real-time error, AoI and AoII metrics. Different from [23], in our work, we consider real-time timely estimation of multiple non-symmetric binary sources for a continuous time system. In our work, the sampler (health care provider) does not know the states of the sources (infection status of people), and thus, takes the samples (applies medical tests) randomly (exponential random variables) with fixed rates. Thus, we optimize the test rates of people to minimize the real-time estimation error.
In this paper, we consider the real-time timely tracking of infection status of n people. We first find an analytical expression for the long-term average difference between the actual infection status of people and the estimate of the health care provider based on test results. Then, we propose an alternating minimization-based algorithm to identify the test rates s i and c i for all people. We observe that if the total test rate is limited, we may not apply tests on all people equally. Next, we provide an alternative method to characterize the average difference, by finding the steady state of a Markov chain defined by ( x i ( t ) , x ^ i ( t ) ) . By using this alternative method, we determine the average estimation error when there are errors in the test measurements expressed by a false positive rate p and a false negative rate q. Next, we consider the infection status of two people where an infected person may spread the disease to another person if the infection has not been detected by the health care provider to consequently isolate the infected person. Finally, we consider an age of incorrect information-based error metric where the estimation error increases linearly over time when the health care provider has not detected the changes in the infection status of the people.
Through extensive numerical results, we observe that increasing the total test rate helps track the infection status of people better, and increasing the size of the population increases diversity which may be exploited to improve the performance. Depending on the health care provider’s priorities, we can allocate additional tests to people marked as healthy to detect the infections faster or to people marked as infected to detect the recoveries more quickly. In order to combat the test errors, the health care provider may prefer to apply tests to only a selected portion of the population with higher test rates. When the infection status of a person depends on that of another person, the average time that a person remains infected can be reduced by increasing the total test rate as it helps to detect the infected people more quickly. Finally, we observe that depending on the error metric used, the test rate distribution among the population differs greatly, and thus, we should choose an error metric that aligns with the priorities of the health care provider.

2. System Model

We consider a population of n people. We denote the infection status of the ith person at time t as x i ( t ) (black curve in Figure 2a) which takes binary values 0 or 1 as follows,
x i ( t ) = 1 , if the i th person is infected at time t , 0 , otherwise .
In this paper, we consider a model where each person can be infected multiple times after recovering from the disease. We denote the time interval that the ith person stays healthy for the jth time as W i ( j ) which is exponentially distributed with rate λ i . We denote the recovery time for the ith person after being infected with the virus for the jth time as R i ( j ) which is exponentially distributed with rate μ i .
A health care provider wants to track the infection status of each person. Based on the test results at times t i , , the health care provider generates an estimate for the status of the ith person denoted as x ^ i ( t ) (blue curve in Figure 2a) by
x ^ i ( t ) = x i ( t i , ) , t i , t < t i , + 1 .
When x ^ i ( t ) is 1, the health care provider applies the next test to the ith person after an exponentially distributed time with rate c i . When x ^ i ( t ) is 0, the next test is applied to the ith person after an exponentially distributed time with rate s i .
An estimation error happens when the actual infection status of the ith person, x i ( t ) , is different than the estimate of the health care provider, x ^ i ( t ) , at time t. This could happen in two ways: when x i ( t ) = 1 and x ^ i ( t ) = 0 , i.e., when the ith person is sick, but remains undetected by the health care provider, and when x i ( t ) = 0 and x ^ i ( t ) = 1 , i.e., when the ith person has recovered, but the health care provider is unaware that the ith person has recovered.
We denote the error caused by the former case, i.e., when x i ( t ) = 1 and x ^ i ( t ) = 0 , by Δ i 1 ( t ) (green areas in Figure 2b),
Δ i 1 ( t ) = max { x i ( t ) x ^ i ( t ) , 0 } ,
and we denote the error caused by the latter case, i.e., when x i ( t ) = 0 and x ^ i ( t ) = 1 , by Δ i 2 ( t ) (orange areas in Figure 2b),
Δ i 2 ( t ) = max { x ^ i ( t ) x i ( t ) , 0 } .
Then, the total estimation error for the ith person Δ i ( t ) is
Δ i ( t ) = θ Δ i 1 ( t ) + ( 1 θ ) Δ i 2 ( t ) ,
where θ is the importance factor in [ 0 , 1 ] . A large θ gives more importance to the detection of infected people, and a small θ gives more importance to the detection of recovered people.
We define the long-term weighted average difference between x i ( t ) and x ^ i ( t ) as
Δ i = lim T 1 T 0 T Δ i ( t ) d t .
Then, the overall average difference of all people Δ is
Δ = 1 n i = 1 n Δ i .
Our aim is to track the infection status of all people. Due to limited resources, there is a total test rate constraint i = 1 n s i + i = 1 n c i C . Thus, our aim is to find the optimal test rates s i and c i to minimize Δ in (7) while satisfying this total test rate constraint. We formulate the following problem,
min { s i , c i } Δ s . t . i = 1 n s i + i = 1 n c i C s i 0 , c i 0 , i = 1 , , n .
We provide a summary of the list of the variables used in this work in Table 1. In the next section, we find the total average difference Δ .

3. Average Difference Analysis

In this section, we provide a probabilistic analysis to characterize the average difference Δ . In Section 5.1, we give an alternative method to find Δ by analyzing the steady-state distribution of the Markov chain induced by the states ( x i ( t ) , x ^ i ( t ) ) . Here, we first find analytical expressions for Δ i 1 ( t ) in (3) and Δ i 2 ( t ) in (4) when s i > 0 and c i > 0 . We note that Δ i 1 ( t ) can be equal to 1 when x ^ i ( t ) = 0 and is always equal to 0 when x ^ i ( t ) = 1 . Assume that at time 0, both x i ( 0 ) and x ^ i ( 0 ) are 0. After an exponentially distributed time with rate λ i , which is denoted by W i , the ith person is infected, and thus x i ( t ) becomes 1. At that time, since x ^ i ( t ) = 0 , Δ i 1 ( t ) becomes 1. Further, Δ i 1 ( t ) will be equal to 0 again either when the ith person recovers from the disease which happens after R i which is exponentially distributed with rate μ i or when the health care provider performs a test on the ith person after D i , which is exponentially distributed with rate s i . We define T m ( i ) as the earliest time at which one of these two cases happens, i.e., T m ( i ) = min { R i , D i } (which is shown by the green areas in Figure 3a). We note that T m ( i ) is also exponentially distributed with rate μ i + s i , and we have P ( T m ( i ) = R i ) = μ i μ i + s i and P ( T m ( i ) = D i ) = s i μ i + s i . If the ith person recovers from the disease before testing, we return to the initial case where both x i ( t ) and x ^ i ( t ) are equal to 0 again. In this case, the cycle repeats itself, i.e., the ith person becomes sick again after W i and Δ i 1 ( t ) remains as 1 until either the person recovers or the health care provider performs a test which takes another T m ( i ) duration. If the health care provider performs a test before the person recovers, then x ^ i ( t ) becomes 1. We denote the time interval for which x ^ i ( t ) stays at 0 as I i 1 which is given by
I i 1 = = 1 K 1 T m ( i , ) + W i ( ) ,
where K 1 is geometric with rate P ( T m ( i ) = D i ) = s i μ i + s i . Due to [103] (Prob. 9.4.1), = 1 K 1 T m ( i , ) and = 1 K 1 W i ( ) are exponentially distributed with rates s i and λ i s i μ i + s i , respectively. As E [ I i 1 ] = E [ = 1 K 1 T m ( i , ) ] + E [ = 1 K 1 W i ( ) ] , we have
E [ I i 1 ] = 1 s i + s i + μ i s i λ i .
When x ^ i ( t ) = 1 , the health care provider marks the ith person as infected. The ith person recovers from the virus after R i . After the ith person recovers, either the health care provider performs a test after Z i which is exponentially distributed with rate c i or the ith person is reinfected with the virus which takes W i time. We define T u ( i ) as the earliest time at which one of these two cases happens, i.e., T u ( i ) = min { W i , Z i } (which is shown by the orange areas in Figure 3b). Similarly, we note that T u ( i ) is exponentially distributed with rate λ i + c i , and we have P ( T u ( i ) = W i ) = λ i λ i + c i and P ( T u ( i ) = Z i ) = c i λ i + c i . If the person is reinfected with the virus before a test is applied, this cycle repeats itself, i.e., the ith person recovers after another R i , and then either a test is applied to the ith person, or the person is infected again which takes another T u ( i ) . If the health care provider performs a test to the ith person before the person is reinfected, the health care provider marks the ith person as healthy again, i.e., x ^ i ( t ) becomes 0. We denote the time interval that x ^ i ( t ) is equal to 1 as I i 2 which is given by
I i 2 = = 1 K 2 T u ( i , ) + R i ( ) ,
where K 2 is geometric with rate P ( T u ( i ) = Z i ) = c i λ i + c i . Similarly, = 1 K 2 T u ( i , ) and = 1 K 2 R i ( ) are exponentially distributed with rates c i and c i μ i λ i + c i , respectively. As E [ I i 2 ] = E [ = 1 K 2 T u ( i , ) ] + E [ = 1 K 2 R i ( ) ] , we have
E [ I i 2 ] = 1 c i + c i + λ i c i μ i .
We denote the time interval between the jth and ( j + 1 ) th times that x ^ i ( t ) changes from 1 to 0 as the jth cycle I i ( j ) where I i ( j ) = I i 1 ( j ) + I i 2 ( j ) . We note that Δ i 1 ( t ) is always equal to 0 during I i 2 ( j ) , i.e., x ^ i ( t ) = 1 , and Δ i 1 ( t ) is equal to 1 when x i ( t ) = 1 in I i 1 ( j ) . We denote the total time duration when Δ i 1 ( t ) is equal to 1 as T e , 1 ( i , j ) during the jth cycle where T e , 1 ( i , j ) = = 1 K 1 T m ( i , ) . Thus, we have E [ T e , 1 ( i ) ] = 1 s i . Then, using ergodicity, similar to [80], Δ i 1 is equal to
Δ i 1 = E [ T e , 1 ( i ) ] E [ I i ] = E [ T e , 1 ( i ) ] E [ I i 1 ] + E [ I i 2 ] .
Thus, we have
Δ i 1 = μ i λ i μ i + λ i c i μ i c i + λ i s i + c i s i .
Next, we find Δ i 2 . We note that Δ i 2 ( t ) is equal to 1 when x i ( t ) = 0 in I i 2 ( j ) and is always equal to 0 during I i 1 ( j ) . Similarly, we denote the total time duration where Δ i 2 ( t ) is equal to 1 in the jth cycle I i ( j ) as T e , 2 ( i , j ) which is equal to T e , 2 ( i , j ) = = 1 K 2 T u ( i , ) . Thus, we have E [ T e , 2 ( i ) ] = 1 c i . Then, similar to Δ i 1 in (13), Δ i 2 is equal to
Δ i 2 = μ i λ i μ i + λ i s i μ i c i + λ i s i + c i s i .
By using (5), (14), and (15), we obtain Δ i as
Δ i = μ i λ i μ i + λ i θ c i + ( 1 θ ) s i μ i c i + λ i s i + c i s i .
Then, by inserting (16) in (7), we obtain Δ . In the next section, we solve the optimization problem in (8).

4. Optimization of Average Difference

In this section, we solve the optimization problem in (8). Using Δ i in (16) in (7), we rewrite (8) as
min { s i , c i } i = 1 n μ i λ i μ i + λ i θ c i + ( 1 θ ) s i μ i c i + λ i s i + c i s i s . t . i = 1 n s i + i = 1 n c i C s i 0 , c i 0 , i = 1 , , n .
We define the Lagrangian function [104] for (17) as
L = i = 1 n μ i λ i μ i + λ i θ c i + ( 1 θ ) s i μ i c i + λ i s i + c i s i + β i = 1 n s i + c i C i = 1 n ν i s i i = 1 n η i c i ,
where β 0 , ν i 0 , and η i 0 . The KKT conditions are
L s i = μ i λ i c i μ i + λ i ( 1 θ ) μ i θ ( c i + λ i ) ( μ i c i + λ i s i + s i c i ) 2 + β ν i = 0 ,
L c i = μ i λ i s i μ i + λ i θ λ i ( 1 θ ) ( μ i + s i ) ( μ i c i + λ i s i + s i c i ) 2 + β η i = 0 ,
for all i. The complementary slackness conditions are
β i = 1 n s i + c i C = 0 , ν i s i = 0 , η i c i = 0 .
First, we find s i . From (19), we have
( μ i c i + λ i s i + s i c i ) 2 = μ i λ i c i μ i + λ i θ ( c i + λ i ) ( 1 θ ) μ i β ν i .
When θ ( c i + λ i ) ( 1 θ ) μ i , we solve (22) for s i as
s i = μ i c i λ i + c i 1 μ i c i λ i μ i + λ i θ ( c i + λ i ) ( 1 θ ) μ i β 1 + ,
where we used the fact that we either have s i > 0 and ν i = 0 , or s i = 0 and ν i 0 , due to (21). Here, ( · ) + = max ( · , 0 ) . On the other hand, when θ ( c i + λ i ) < ( 1 θ ) μ i , we have Δ i s i > 0 , and thus it is optimal to choose s i = 0 as our aim is to minimize Δ in (7). In this case, when s i = 0 , we have Δ i = θ λ i μ i + λ i which is independent of the value of c i . As we obtain the same Δ i for all values of c i , and the total update rate is limited, i.e., i = 1 n s i + c i C , in this case, it is optimal to choose c i = 0 as well (i.e., when s i = 0 ).
Next, we find c i . From (20), we have
( μ i c i + λ i s i + s i c i ) 2 = μ i λ i s i μ i + λ i ( 1 θ ) ( μ i + s i ) θ λ i β η i .
When ( 1 θ ) ( μ i + s i ) θ λ i , we solve (24) for c i as
c i = λ i s i μ i + s i 1 λ i s i μ i μ i + λ i ( 1 θ ) ( s i + μ i ) θ λ i β 1 + ,
where we used the fact that we either have c i > 0 and η i = 0 , or c i = 0 and η i 0 , due to (21). Similarly, when ( 1 θ ) ( s i + μ i ) < θ λ i , we have Δ i c i > 0 . Thus, in this case, it is optimal to choose c i = 0 . When c i = 0 , we have Δ i = ( 1 θ ) μ i μ i + λ i which is independent of the value of s i . Thus, it is optimal to choose s i = 0 when c i = 0 .
From (23), if 1 μ i c i λ i μ i + λ i ( θ ( c i + λ i ) ( 1 θ ) μ i ) β , we must have s i = 0 . Thus, for a given c i , the optimal test rate allocation policy for s i is a threshold policy where s i ’s with small 1 μ i c i λ i μ i + λ i ( θ ( c i + λ i ) ( 1 θ ) μ i ) are equal to zero. Similarly, from (25), if 1 λ i s i μ i μ i + λ i ( 1 θ ) ( s i + μ i ) θ λ i β , we must have c i = 0 . Thus, for a given s i , the optimal policy to determine c i is a threshold policy where c i ’s with small 1 λ i s i μ i μ i + λ i ( ( 1 θ ) ( s i + μ i ) θ λ i ) are equal to zero.
Next, we show that in the optimal policy, if s i > 0 and c i > 0 for some i, then the total test rate constraint must be satisfied with equality, i.e., i = 1 n s i + c i = C .
Lemma 1.
In the optimal policy, if s i > 0 and c i > 0 for some i, then we have i = 1 n s i + c i = C .
Proof of Lemma 1.
The derivatives of Δ i with respect to s i and c i are
Δ i s i = μ i λ i c i μ i + λ i ( 1 θ ) μ i θ ( c i + λ i ) c i μ i + s i c i + λ i s i 2 ,
Δ i c i = μ i λ i s i μ i + λ i θ λ i ( 1 θ ) ( s i + μ i ) c i μ i + s i c i + λ i s i 2 .
We note that s i > 0 in (23) implies that θ ( c i + λ i ) > ( 1 θ ) μ i . In this case, we have Δ i s i < 0 . Similarly, c i > 0 in (25) implies that ( 1 θ ) ( s i + μ i ) > θ λ i . Thus, we have Δ i c i < 0 . Therefore, in the optimal policy, if we have s i > 0 and c i > 0 for some i, then we must have i = 1 n s i + c i = C . Otherwise, we can further decrease Δ in (7) by increasing c i or s i . □
Next, we propose an alternating minimization-based algorithm for finding s i and c i . For this purpose, for given initial ( s i , c i ) pairs, we define ϕ i as
ϕ i = 1 μ i c i λ i μ i + λ i ( θ ( c i + λ i ) ( 1 θ ) μ i ) , i = 1 , , n , 1 λ i s i μ i μ i + λ i ( ( 1 θ ) ( s i + μ i ) θ λ i ) , i = n + 1 , , 2 n .
Then, we define u i as
u i = μ i c i λ i + c i ϕ i β 1 + , i = 1 , , n , λ i s i μ i + s i ϕ i β 1 + , i = n + 1 , , 2 n .
From (23) and (25), s i = u i and c i = u n + i , for i = 1 , , n .
Next, we find s i and c i by determining β in (29). First, assume that, in the optimal policy, there is an i such that s i > 0 and c i > 0 . Thus, by Lemma 1, we must have i = 1 n s i + c i = C . We initially take random ( s i , c i ) pairs such that i = 1 n s i + c i = C . Then, given the initial ( s i , c i ) pairs, we immediately choose u i = 0 for ϕ i < 0 . For the remaining u i with ϕ i 0 , we apply a solution method similar to that in [80]. By assuming ϕ i β , i.e., by disregarding ( · ) + in (29), we solve i = 1 2 n u i = C for β . Then, we compare the smallest ϕ i which is larger than zero in (28) with β . If we have ϕ i β , then it implies that u i 0 for all remaining i. Thus, we have obtained u i values for given initial ( s i , c i ) pairs. If the smallest ϕ i which is larger than zero is smaller than β , then the corresponding u i is negative and we should choose u i = 0 for the smallest non-negative ϕ i . Then, we repeat this procedure until the smallest non-negative ϕ i is larger than β . After determining all u i , we obtain s i = u i and c i = u n + i for i = 1 , , n . Then, with the updated values of ( s i , c i ) pairs, we keep finding u i ’s until the KKT conditions in (19) and (20) are satisfied.
We note that for indices (persons) i for which ( s i , c i ) are zero, the health care provider does not perform any tests, and maps these people as either always infected, i.e., x ^ i ( t ) = 1 for all t, or always healthy, i.e., x ^ i ( t ) = 0 . If x ^ i ( t ) = 0 for all t, Δ i = θ λ i μ i + λ i , and if x ^ i ( t ) = 1 for all t, Δ i = ( 1 θ ) μ i μ i + λ i . Thus, for such i, the health care provider should choose x ^ i ( t ) = 0 for all t, if θ λ i μ i + λ i < ( 1 θ ) μ i μ i + λ i , and should choose x ^ i ( t ) = 1 for all t, otherwise, without performing any tests.
Finally, we note that the problem in (17) is not a convex optimization problem as the objective function is not jointly convex in s i and c i . Therefore, the solutions obtained via the proposed method may not be globally optimal. For this reason, we select different initial starting points and apply the proposed alternating minimization-based algorithm and choose the solution that achieves the smallest Δ in (7).
In the next section, we first provide an alternative method to find the average difference Δ in (6) and then characterize the average difference for the erroneous test measurements.

5. Average Difference for the Case with Erroneous Test Measurements

We note that the infection status of the ith person and its estimate at the health care provider form a continuous time Markov chain (Section 7.5 of [105]) with the states ( x i ( t ) , x ^ i ( t ) ) { ( 0 , 0 ) , ( 0 , 1 ) , ( 1 , 0 ) , ( 1 , 1 ) } . In this section, by finding the steady-state distribution for ( x i ( t ) , x ^ i ( t ) ) , we provide an alternative method to find Δ in (6). Then, we consider the case with erroneous test measurements. For this case, we characterize the long-term average difference for the ith person denoted by Δ i e .

5.1. An Alternative Method to Characterize Average Difference

When there is no error in the tests, the state transition graph is shown in Figure 4a. Assuming that s i > 0 , c i > 0 , every state is accessible from any other state, and thus, the Markov chain induced by the system is irreducible. Note that in Section 4, we see that the testing rates for some people can be equal to 0, i.e., s i = 0 and c i = 0 . For these people, we choose x ^ i ( t ) to be either always 0 or 1, i.e., consider them as always healthy or sick all the time. Depending on the choice of x ^ i ( t ) , when s i = 0 and c i = 0 , either the states ( 0 , 0 ) and ( 1 , 0 ) , or the states ( 0 , 1 ) and ( 1 , 1 ) will be transient, and thus, have 0 probability in the steady state. By using small time-step approximation to a discrete time Markov chain, one can show that the self transition probabilities are non-zero, and thus, the Markov chain induced by the system is also aperiodic (Section 7.5 of [105]). Therefore, the Markov chain shown in Figure 4a admits a unique stationary distribution given by π = { π 00 , π 01 , π 10 , π 11 } . We find the stationary distribution by writing the local-balance equations which are given as
π 00 λ i = π 10 μ i + π 01 c i ,
π 10 ( μ i + s i ) = π 00 λ i ,
π 01 ( c i + λ i ) = π 11 μ i ,
π 11 μ i = π 10 s i + π 01 λ i .
By using (30)–(33) and k = 1 2 = 1 2 π k = 1 , we find the steady-state distribution π as
π 01 = μ i λ i μ i + λ i s i μ i c i + λ i s i + c i s i ,
π 10 = μ i λ i μ i + λ i c i μ i c i + λ i s i + c i s i ,
and π 00 = μ i + s i λ i π 10 , and π 11 = c i + λ i μ i π 01 . We note that Δ i 1 in (14) is also equal to π 10 in (35), i.e., we have Δ i 1 = π 10 . Similarly, Δ i 2 in (15) is equal to π 01 in (34). Thus, by observing that the states ( x i ( t ) , x ^ i ( t ) ) form a continuous time Markov chain, we can find the average difference Δ in (6) by finding the steady-state distribution for π . This method will be particularly useful in the following section where we consider the case with erroneous test measurements.

5.2. Average Difference with Erroneous Test Measurements

In this section, we consider the case where the test measurements can be erroneous. When a test in applied to an infected person, i.e., when x i ( t ) = 1 , the test result will be 0 with probability q and 1 with probability 1 q , where 0 q < 1 2 . In other words, the false-negative probability is equal to q. Similarly, when a test is applied to a healthy person, i.e., when x i ( t ) = 0 , the test result will be 1 with probability p and 0 with probability 1 p , where 0 p < 1 2 . Thus, the false-positive probability is equal to p. The probability distribution for the test measurements is provided in Table 2.
In this section, we consider the case where the health care provider applies only one test rate v i to the ith person, whether the person is currently marked as healthy or infected. That is, we do not consider separate testing rates of s i and c i for healthy and infected people as we did before, instead, here both s i and c i are equal o v i . Since the health care provider applies the same test rate for the ith person, here we do not consider the importance factor θ either. Then, we define the long-term average difference for the ith person with the error on the test measurements as follows, where the superscript e stands for “erroneous”.
Δ i e = Δ i 1 e + Δ i 2 e ,
and the definitions of Δ i 1 e and Δ i 2 e follow similarly from (13). We note that with the test rates v i and errors on the test measurements, the states ( x i ( t ) , x ^ i ( t ) ) form a continuous time Markov chain, and the corresponding state transition graph is shown in Figure 4b. Assuming that v i > 0 , one can show that there is a unique steady-state distribution π e = { π 00 e , π 01 e , π 10 e , π 11 e } which can be found by solving the local balance equations which are given as follows
π 00 e ( v i p + λ i ) = π 01 e v i ( 1 p ) + π 10 e μ i ,
π 10 e ( v i ( 1 q ) + μ i ) = π 00 e λ i + π 11 e v i q ,
π 01 e ( v i ( 1 p ) + λ i ) = π 00 e v i p + π 11 e μ i ,
π 11 e ( v i q + μ i ) = π 10 e v i ( 1 q ) + π 01 e λ i .
Then, by using (37)–(40) and k = 1 2 = 1 2 π k e = 1 , we find the steady-state distribution π e as
π 00 e = μ i λ i q + ( 1 p ) μ i ( v i + μ i ) ( λ i + μ i ) ( λ i + μ i + v i ) ,
π 01 e = μ i λ i ( 1 q ) + p μ i ( v i + μ i ) ( λ i + μ i ) ( λ i + μ i + v i ) ,
π 10 e = μ i λ i ( 1 p ) + q λ i ( v i + λ i ) ( λ i + μ i ) ( λ i + μ i + v i ) ,
π 11 e = μ i λ i p + ( 1 q ) λ i ( v i + λ i ) ( λ i + μ i ) ( λ i + μ i + v i ) .
We note that Δ i 1 e , and Δ i 2 e are equal to π 10 e in (43), and π 01 e in (41), respectively. Thus, if v i > 0 , then Δ i e in (36) becomes
Δ i e = p μ i 2 + q λ i 2 + ( 2 p q ) μ i λ i + v i ( p μ i + q λ i ) ( λ i + μ i ) ( λ i + μ i + v i ) .
We immediately note that if false-positive test probability p and false-negative test probability q are equal to 0, Δ i e becomes 2 μ i λ i ( λ i + μ i ) ( λ i + μ i + v i ) which is equal to Δ i 1 + Δ i 2 provided in (14) and (15), respectively, when v i = s i = c i . Then, Δ i e p 0 is equivalent to v i + μ i λ i 0 and Δ i e q 0 is equivalent to v i + λ i μ i 0 which means that depending on the values of v i , μ i , and λ i , the long-term average difference Δ i e can be an increasing function of only p or only q, or both p and q, but Δ i e cannot be a decreasing function of both p and q. This is expected as false-negative and false-positive tests negatively affect the estimation process. One can also show that Δ i e v i < 0 and 2 Δ i e v i 2 > 0 which means that Δ i e decreases with v i and is a convex function of the test rate v i .
Next, we consider the case when v i = 0 . Note that when v i = 0 , the health care provider either maps these people as always sick or always healthy depending on their infection and recovery rates. Thus, when v i = 0 and depending on the estimate x ^ i ( t ) , two of the states in Figure 4b will never be visited and thus, these states will have 0 steady-state probabilities. For this case, the steady states are given by π ¯ 1 , x ^ i e and π ¯ 0 , x ^ i e . The local balance equation is λ i π ¯ 0 , x ^ i e = μ i π ¯ 1 , x ^ i e . By using π ¯ 0 , x ^ i e + π ¯ 1 , x ^ i e = 1 , we find the steady-state distribution as π ¯ 0 , x ^ i e = μ i μ i + λ i , and π ¯ 1 , x ^ i e = λ i μ i + λ i . Thus, if μ i < λ i , i.e., if people are infected more frequently, then the health care provider chooses its estimate as x ^ i ( t ) = 1 and, Δ i e = μ i μ i + λ i . If μ i λ i , i.e., if people stay healthy more often, then we have x ^ i ( t ) = 0 , and Δ i e = λ i μ i + λ i . Therefore, when v i = 0 , we have
Δ i e = min μ i μ i + λ i , λ i μ i + λ i .
In order to find the optimal test rates v i in the case of errors on the test measurements, we formulate the following optimization problem
min { v i } i = 1 n 𝟙 { v i > 0 } p μ i 2 + q λ i 2 + ( 2 p q ) μ i λ i + v i ( p μ i + q λ i ) ( λ i + μ i ) ( λ i + μ i + v i ) + 𝟙 { v i = 0 } min μ i μ i + λ i , λ i μ i + λ i s . t . i = 1 n v i C v i 0 , i = 1 , , n ,
where the objective function is given by the summation of Δ i e in (45) when v i > 0 and Δ i e in (46) when v i = 0 over all people and 𝟙 { . } is the indicator function taking value 1 when { · } is true and 0, otherwise. In (47), we have a constraint on the total test rate, i.e., i = 1 n v i C . We note that the optimization problem in (47) is in general not convex due to the indicator function in the objective function. However, for a given set of 𝟙 { v i = 0 } , the optimization problem in (47) is convex and can be solved optimally. Thus, by solving the problem in (47) for all possible set of 𝟙 { v i = 0 } , we can determine the global optimal solution which requires to solve 2 n different optimization problems which can be impractical for large n. Because of this reason, next, we provide a greedy algorithm to solve the optimization problem in (47).
In the greedy solution, initially, assuming that 𝟙 { v i > 0 } = 1 for all i, we consider the following the optimization problem
min { v i } i = 1 n p μ i 2 + q λ i 2 + ( 2 p q ) μ i λ i + v i ( p μ i + q λ i ) ( λ i + μ i ) ( λ i + μ i + v i ) s . t . i = 1 n v i C v i 0 , i = 1 , , n ,
where the objective function in (48) is equal to Δ i e in (45). For this optimization problem, we define the Lagrangian function for (48) as
L = i = 1 n p μ i 2 + q λ i 2 + ( 2 p q ) μ i λ i + v i ( p μ i + q λ i ) ( λ i + μ i ) ( λ i + μ i + v i ) + β ¯ i = 1 n v i C i = 1 n ν ¯ i v i ,
where β ¯ 0 , ν ¯ i 0 . We note that the problem defined in (48) is a convex optimization problem, and thus we can find the optimal test rates v i by analyzing the KKT and the complementary slackness conditions. The KKT conditions are given by
L v i = 2 ( 1 p q ) μ i λ i ( μ i + λ i ) ( μ i + λ i + v i ) 2 + β ¯ ν ¯ i = 0 ,
for all i. The complementary slackness conditions are
β ¯ i = 1 n v i C = 0 , ν ¯ i v i = 0 .
By using (50) and (51), we find the optimal v i values for the problem in (48) as
v i = ( μ i + λ i ) μ i λ i ( μ i + λ i ) 3 2 ( 1 p q ) β ¯ 1 + .
With the test rates v i in (52) we find the average differences Δ i e in (45) and then compare them with Δ i e in (46) when v i = 0 . Due to the errors in the tests, Δ i e in (46) with v i = 0 can be smaller than Δ i e in (45) with the test rates v i found in (52). For these people, we choose index i where the difference between Δ i e in (45) with the v i in (52) and Δ i e in (46) is the highest. Then, we take v i = 0 as applying no test to this person can further decrease Δ i e . For the remaining people, we solve the optimization problem in (48). After obtaining the test rates for the remaining people, we again compare average differences Δ i e with the test rates in (52) and with no test and we choose v i = 0 for the person where Δ i e can be further decreased. We repeat these steps until all Δ i e s with v i > 0 cannot be further decreased by choosing v i = 0 .
We note that the solution obtained in (52) has a threshold structure. As false-positive and -negative test rates increase, the term 2 ( 1 p q ) β ¯ in (52) becomes smaller. As a result, some people with higher ( μ i + λ i ) 3 μ i λ i may not be tested by the health care provider. Thus, when p and q are high, a smaller portion of the population is tested with higher test rates in order to combat the test errors.

6. Average Estimation Error with Dependent Infection Rates

In this section, we consider the case where we have two people whose infection rates depend on each other. When these two people are healthy, they can be individually infected with the virus after an exponential time with rate λ . When one of these two people is infected and this has not been detected by the health care provider, this person can infect the other healthy person after an exponential time with rate λ 12 which has been illustrated in Figure 5. Thus, when both of the people are healthy, their individual infection rate is λ . However, when one of them is sick and this has not been detected by the health care provider, the healthy person’s total infection rate is equal to λ + λ 12 . On the other hand, if only one person is infected, i.e., x i ( t ) = 1 , which has also been detected by the health care provider, x ^ i ( t ) = 1 , then we assume that we isolate the infected person from the healthy one, and thus, the healthy person’s infection rate remains as λ instead of λ + λ 12 . When the people are infected, they recover from the disease after an exponential time with rate μ .
When the health care provider believes that a person is healthy, i.e., x ^ i ( t ) = 0 , the next test is applied to this person after an exponential time with rate s. When the health care provider believes that a person is sick, i.e., x ^ i ( t ) = 1 , the next test applied to this person after an exponential time with rate c. Here, we note that since the people are identical in terms of their infection and recovery rates, the health care provider applies the same test rates.
Similar to Section 5, we note that the states { x 1 ( t ) , x ^ 1 ( t ) , x 2 ( t ) , x ^ 2 ( t ) } form a continuous time Markov chain where the unique stationary distribution is given by π d = { π 0000 d , π 0001 d , , π 1111 d } . In order to find the stationary distribution, we write the local balance equations as follows
2 λ π 0000 d = μ π 1000 d + c π 0100 d + μ π 0010 d + c π 0001 d ,
( 2 λ + c ) π 0001 d = μ π 0011 d + c π 0101 d + μ π 1001 d ,
( λ + λ 12 + μ + s ) π 0010 d = c π 0110 d + μ π 1010 d + λ π 0000 d ,
( λ + μ ) π 0011 d = c π 0111 d + μ π 1011 d + s π 0010 d + λ π 0001 d ,
( 2 λ + c ) π 0100 d = c π 0101 d + μ π 0110 d + μ π 1100 d ,
( 2 λ + 2 c ) π 0101 d = μ π 0111 d + μ π 1101 d ,
( λ + μ + s + c ) π 0110 d = λ π 0100 d + μ π 1110 d ,
( λ + μ + c ) π 0111 d = s π 0110 d + λ π 0101 d + μ π 1111 d ,
( λ + λ 12 + μ + s ) π 1000 d = λ π 0000 d + c π 1001 d + μ π 1010 d ,
( λ + μ + s + c ) π 1001 d = μ π 1011 d + λ π 0001 d ,
( 2 μ + 2 s ) π 1010 d = ( λ + λ 12 ) π 1000 d + ( λ + λ 12 ) π 0010 d ,
( 2 μ + s ) π 1011 d = s π 1010 d + λ π 1001 d + λ π 0011 d ,
( λ + μ ) π 1100 d = s π 1000 d + λ π 0100 d + c π 1101 d + μ π 1110 d ,
( λ + μ + c ) π 1101 d = s π 1001 d + λ π 0101 d + μ π 1111 d ,
( 2 μ + s ) π 1110 d = λ π 1100 d + s π 1010 d + λ π 0110 d ,
2 μ π 1111 d = s π 1110 d + λ π 1101 d + s π 1011 d + λ π 0111 d .
By using (53)–(57) and j = 1 2 = 1 2 m = 1 2 h = 1 2 π j m h d = 1 , we find the stationary distribution π d . We denote the long-term average estimation error for person i as Δ i d for i = 1 , 2 , where the superscript d stands for “dependent”, which is given by
Δ i d = Δ i 1 d + Δ i 2 d ,
where Δ i 1 d and Δ i 2 d follow from (13). Then, we have
Δ 11 d = π 1000 d + π 1001 d + π 1010 d + π 1011 d ,
Δ 12 d = π 0100 d + π 0101 d + π 0110 d + π 0111 d ,
Δ 21 d = π 0010 d + π 0110 d + π 1010 d + π 1110 d ,
Δ 22 d = π 0001 d + π 0101 d + π 1001 d + π 1101 d .
In Section 8, for given infection, recovery and test rates, we numerically evaluate the stationary distribution and find the average difference Δ i d .

7. Age of Incorrect Information Based Error Metric

To date, we have considered an estimation error metric that takes the value 1 if the actual infection status of a person is different than the real-time estimation at the health care provider. Thus, the error metric takes values based on the information content. On the other hand, the traditional age metric introduced in [1] considers only the time passed since the most recently received status update packet is generated at the source. As a result, the traditional age metric does not consider the information content and age alone may not be a suitable performance metric for the problem considered in our work.
In the context of infection tracking, it is important to know how long the estimations at the health care provider have been different from the actual infection status of the people. However, the error metric that we have considered thus far does not have the time component, i.e., it only takes value 1 independent of the time duration that it has been off from the actual health status. Motivated by the AoII introduced in [51,102] which accounts for both the time and the information content, in this section, we consider the following error metric, where the superscript s stands for “synchronization” implied in AoII,
Δ i s = ( t V i ( t ) ) 𝟙 { x ^ i ( t ) x i ( t ) } ,
where V i ( t ) is the last time instant where the health care provider makes an accurate estimation of the health status for the ith person, i.e., the last time instant when Δ i s = 0 . Similarly, we define
Δ i 1 s = ( t V i 1 ( t ) ) max { x i ( t ) x ^ i ( t ) , 0 } ,
Δ i 2 s = ( t V i 2 ( t ) ) max { x ^ i ( t ) x i ( t ) , 0 } ,
where V i 1 ( t ) and V i 2 ( t ) are equal to the last time instants when Δ i 1 s and Δ i 2 s are equal to 0, respectively. A sample evolution of Δ i 1 s and Δ i 2 s is shown in Figure 6 and we note that Δ i s ( t ) = Δ i 1 s ( t ) + Δ i 2 s ( t ) .
Similar to Section 3, the infection and the recovery rates of the ith person are λ i and μ i , respectively. In this section, the health care provider applies only one test rate for each person denoted by w i . That is, we do not consider separate testing rates of s i and c i for healthy and infected people as we did previously, instead, here both s i and c i are equal o w i . We first consider the case where w i > 0 . By following the steps in Section 3, one can show that E [ I i 1 ] = 1 w i + w i + μ i w i λ i and E [ I i 2 ] = 1 w i + w i + λ i w i μ i which can be obtained by substituting w i instead of s i and c i in (10) and (12), respectively. Next, we denote the total area when Δ i 1 s ( t ) > 0 as A e , 1 ( i , j ) during the jth cycle where A e , 1 ( i , j ) = = 1 K 1 T m ( i , ) 2 2 and K 1 has a geometric distribution with success rate w i μ i + w i . Then, we have E [ A e , 1 ( i ) ] = 1 w i ( w i + μ i ) . Similarly, we denote the total area when Δ i 2 s ( t ) > 0 as A e , 2 ( i , j ) during the jth cycle where A e , 2 ( i , j ) = = 1 K 2 T u ( i , ) 2 2 and K 2 has a geometric distribution with success rate w i λ i + w i . Then, we have E [ A e , 2 ( i ) ] = 1 w i ( w i + λ i ) . By using ergodicity, the long-term average differences become Δ i 1 s = E [ A e , 1 ( i ) ] E [ I i 1 ] + E [ I i 2 ] and Δ i 2 s = E [ A e , 2 ( i ) ] E [ I i 1 ] + E [ I i 2 ] which gives
Δ i s = Δ i 1 s + Δ i 2 s = μ i λ i μ i + λ i 2 w i + μ i + λ i ( w i + μ i + λ i ) ( w i + μ i ) ( w i + λ i ) ,
when w i > 0 . One can show that Δ i s is a decreasing function of w i , i.e., Δ i s w i < 0 , and Δ i s is a convex function of w i , i.e., 2 Δ i s w i 2 > 0 .
When w i = 0 , we have E [ I i ] = μ i λ i μ i + λ i , i.e., E [ I i ] is equal to the expected time of a person’s healthy and sick states. Since the health care provider applies no tests to test a person, it either estimates this person to be always sick ( x ^ i ( t ) = 1 ) or always healthy ( x ^ i ( t ) = 0 ). When w i = 0 and x ^ i ( t ) = 1 , then Δ i s = 1 μ i λ i μ i + λ i . When w i = 0 and x ^ i ( t ) = 1 , we have Δ i s = 1 λ i μ i μ i + λ i . If μ i < λ i , then the health care provider x ^ i ( t ) = 1 , and x ^ i ( t ) = 0 , otherwise. Thus, when w i = 0 , we have Δ i s = min 1 μ i λ i μ i + λ i , 1 λ i μ i μ i + λ i .
In order to find the optimal test rates, we formulate the following optimization problem
min { w i } i = 1 n 𝟙 { w i > 0 } μ i λ i μ i + λ i 2 w i + μ i + λ i ( w i + μ i + λ i ) ( w i + μ i ) ( w i + λ i ) + 𝟙 { w i = 0 } min 1 μ i λ i μ i + λ i , 1 λ i μ i μ i + λ i s . t . i = 1 n w i C w i 0 , i = 1 , , n ,
where the objective function in (78) is equal to the summation of Δ i s in (77) when w i > 0 and Δ i s when w i = 0 over all people. In order to solve the problem in (78), we follow the same greedy solution approach in Section 5. First, by assuming that w i > 0 , and thus, the average difference Δ i s is given in (77), we solve the following optimization problem
min { w i } i = 1 n μ i λ i μ i + λ i 2 w i + μ i + λ i ( w i + μ i + λ i ) ( w i + μ i ) ( w i + λ i ) s . t . i = 1 n w i C w i 0 , i = 1 , , n .
Since the problem in (79) is a convex optimization problem, by defining Lagrangian function and analyzing the KKT and the complementary slackness conditions, we can find the optimal w i values. In order to avoid being repetitive, we skip these optimization steps. Then, we compare Δ i s in (77) with w i values found in (79) with min { 1 μ i λ i μ i + λ i , 1 λ i μ i μ i + λ i } . If we can reduce Δ i s further, we choose w i = 0 for the person with the highest improvement. Then, we solve the optimization problem in (79) for the remaining people. We repeat these steps until there is no improvement in Δ i s by choosing w i = 0 .
In the next section, we provide extensive numerical results to evaluate optimal test rates in various settings considered in this paper.

8. Numerical Results

In this section, we provide seven numerical results. For these examples, we take λ i as
λ i = a r i , i = 1 , , n ,
where r = 0.9 and a is such that i = 1 n λ i = 6 . Furthermore, we take μ i as
μ i = b q i , i = 1 , , n ,
where q = 1.1 and b is such that i = 1 n μ i = 4 . Since λ i in (80) decreases with i, people with lower indices become infected more quickly compared to people with higher indices. Since μ i in (81) increases with i, people with higher indices recover more quickly compared to people with lower indices. Thus, a person with a low index becomes infected quickly and recovers slowly.
In the first example, we take the total number of people as n = 10 , the total test rate as C = 16 , and θ = 0.5 . We start with randomly chosen s i and c i such that i = 1 n s i + c i = 16 , and apply the alternating minimization-based method proposed in Section 4. We repeat this process for 30 different initial ( s i , c i ) pairs and choose the solution that gives the smallest Δ . In Figure 7a, we observe that the first three people are never tested by the health care provider. We note that s i , which is the test rate when x ^ i ( t ) = 0 , initially increases with i but then decreases with i. This means that people who become infected rarely are tested less frequently when they are marked as healthy. Similarly, we observe in Figure 7a that c i , which is the test rate when x ^ i ( t ) = 1 , monotonically increases with i. In other words, people who recover from the virus quickly are tested more frequently when they are marked as infected.
In Figure 7b, we plot Δ i resulting from the solution found from the proposed algorithm, Δ i when the health care provider applies tests to everyone in the population uniformly, i.e., s i = c i = C 2 n for all i, and Δ i when the health care provider applies no tests, i.e., s i = c i = 0 for all i. In the case of no tests, we have Δ i = min { θ λ i μ i + λ i , ( 1 θ ) μ i μ i + λ i } . We observe in Figure 7b that the health care provider applies tests on people whose Δ i can be reduced the most as opposed to uniform testing where everyone is tested equally. Thus, the first three people who have the smallest Δ i are not tested by the health care provider. With the proposed solution, by not testing the first three people, Δ i are further reduced for the remaining people compared to uniform testing. For the people who are not tested, the health care provider chooses x ^ i ( t ) = 1 all the time, i.e., marks these people always sick as θ λ i μ i + λ i > ( 1 θ ) μ i μ i + λ i . This is expected as these people have high λ i and low μ i , i.e., they are infected easily and they stay sick for a long time.
In the second example, we use the same set of variables except for the total test rate C. We vary the total test rate C in between 5 and 20. We plot Δ with respect to C in Figure 8. We observe that Δ decreases with C. Thus, with higher total test rates, the health care provider can track the infection status of the population better as expected.
In the third example, we use the same set of variables except for the total number of people n. In addition, we also use uniform infection and healing rates, i.e., λ i = 6 n and μ i = 4 n for all i, for comparison with λ i in (80) and μ i in (81), while keeping the total infection and healing rates the same, i.e., i = 1 n λ i = 6 and i = 1 n μ i = 4 , for both cases. We vary the number of people n from 2 to 30. We observe in Figure 9 that when the infection and healing rates are uniform in the population, the health care provider can track the infection status with the same efficiency, even though the population size increases (while keeping the total infection and healing rates fixed). For the case of λ i in (80) and μ i in (81), when we increase the population size, we increase the number of people who rarely become sick, i.e., people with high i indices, and also people who rarely heal from the disease, i.e., people with small i indices. Thus, it becomes easier for the health care provider to track the infection status of the people. This is why when we use λ i in (80) and μ i in (81), we observe in Figure 9 that the health care provider can track the infection status of the people better, even though the population size increases.
In the fourth example, we employ the same set of variables as the first example except for the importance factor θ . Here, we vary θ in between 0.2 and 0.7 . We plot Δ in (7), Δ ¯ 1 which is Δ ¯ 1 = 1 n i = 1 n Δ i 1 , and Δ ¯ 2 which is Δ ¯ 2 = 1 n i = 1 n Δ i 2 in Figure 10a. Note that Δ ¯ 1 represents the average difference when people are infected, but have not been detected by the health care provider, and Δ ¯ 2 represents the average difference when people have recovered, but the health care provider still marks them as infected. Note that when θ is high, we assign importance to minimization of Δ ¯ 1 , i.e., the early detection of people with infection, and when θ is low, we give importance to minimization of Δ ¯ 2 , i.e., the early detection of people who recovered from the disease. This is why we observe in Figure 10a that Δ ¯ 1 decreases with θ while Δ ¯ 2 increases with θ .
We plot the total test rates i = 1 n s i and i = 1 n c i in Figure 10b. We observe in Figure 10b that if it is more important to detect the infected people, i.e., if θ is high, then the health care provider should apply higher test rates to people who are marked as healthy. In other words, i = 1 n s i increases with θ . Similarly, if it is more important to detect people who recovered from the disease, then the health care provider should apply high test rates to people who are marked as infected. That is, i = 1 n c i is high when θ is low. Therefore, depending on the priorities of the health care provider, a suitable θ needs to be chosen.
In the fifth numerical result, we consider the case where there are errors in the test measurements, i.e., the model in Section 5. We take the total test rate as C = 20 , and vary error rates in the test p = q = { 0.1 , 0.2 , 0.4 } . In Figure 11a, we provide the test rates v i that we found as a result of our greedy policy in Section 5. When the error rates p and q are low, i.e., when p = q = 0.1 , we see that the health care provider applies tests to everyone in the population and the corresponding Δ i e is lower than applying no test as shown in Figure 11b. As we increase the error rates, we observe that some people in the population start to be not tested by the health care provider, see Figure 11a when p = q = { 0.2 , 0.4 } . In this case, the health care provider applies more tests to the remaining people to combat the test errors. However, although it applies more tests to the remaining people, we observe in Figure 11b that the achieved average difference Δ i e becomes higher as error rates increase.
In the sixth numerical result, we consider the case where the infection status of the people depend on each other. In other words, when one person is infected, they can infect the other person with rate λ 12 when they are not detected by the health care provider, i.e., the infection model in Section 6. For this example, first, we take μ = 5 , λ = 2.5 , s = c = C 4 and vary λ = { 2 , , 200 } and C = { 20 , 40 , 60 } . If λ 12 = 0 , i.e., if the infection status of people are independent from each other, then the average time that person 1 or 2 is sick is equal to λ λ + μ = 1 3 . As we increase infection rate λ 12 among the person 1 and 2, we see in Figure 12a that the average time that person 1 is sick increases. However, we note that as we increase the total test rate, the health care provider can detect a sick person more frequently, and this explains why the average infected time is low in Figure 12a when the test rate is high. Then, we consider λ 12 = { 5 , 10 , 15 } and vary the total test rates λ = { 2 , , 200 } . We plot the average time that both person 1 and 2 stay as sick in Figure 12b. As we increase the total test rate, the health care provider detects the infected person more quickly, and thus, prohibits the infection from spreading. As a result, we observe that the average time that both people are infected decreases in C in Figure 12b. Since both people can be infected with the virus independent from each other with rate λ , the plots in Figure 12b do not drop to 0.
In the last numerical result, we consider the age of incorrect information-based error metric in Section 7. Here, the estimation error increases with the time that the health care provider does not detect the changes in the infection status of the people. As a result, the average difference expression given by Δ i s in (77) is different than Δ i e in (45) when p = q = 0 . For this example, we consider the total test rate C = 4 and compare the normalized average differences given by Δ i s i = 1 n Δ i s , and Δ i e i = 1 n Δ i e and the corresponding test rates w i and v i . In Figure 13b, depending on the error metric model, people who are tested by the health care provider show considerable variation in their test rates. For example, with the error metric Δ i s in (77), we apply tests to every third person while the same person is not tested with the error metric Δ i e in (45). In Figure 13a, we provide the normalized average difference values. Here, the average normalized error for the tested people exhibit similar values whereas the normalized difference may vary for the untested people. Thus, we should choose a suitable error metric that satisfies the priorities of the health care provider as it greatly affects who is tested and with which test rates.

9. Conclusions and Discussion

We considered the timely tracking of infection status of individuals in a population. For exponential infection and healing processes with given rates, we determined the rates of exponential testing processes. We considered errors on the test measurements and observed that in order to combat the test errors, a limited portion of the population may be tested with higher test rates. Then, we studied a dependent infection spread model for two people, where one infected person can spread the virus to the other if it has not been detected by the health care provider. Finally, we studied an AoII-based error metric where the error function linearly increases over time as the changes in the infection status have not been detected by the health care provider. We observed in numerical results that the test rates depend on the individuals’ infection and recovery rates, the individuals’ last known state of being healthy or infected, as well as the health care provider’s priorities of detecting infected people versus detecting recovered people more quickly.
In the literature, in order to model epidemics, population is partitioned into groups called compartments. One such example is the SIR model used in [106] with the compartments susceptible (S), infected (I), and recovered (R) which has been further developed by adding the states hospitalized (H), and death (D) in [107]. In these epidemic models, the transitions between the compartments are assumed to be Markovian. In [107], with epidemiological data, the delay distributions for the infected (I) to hospitalized (H), and infected (I) to death (D) are well approximated by exponential and gamma distributions, respectively. However, due to the lack of data availability the delay distribution for infected (I) to recovered (R) is modeled with gamma distribution with higher tolerance. In our work, we modeled infection and recovery times, i.e., the delays between recovered (R) to infected (I) and infected (I) to recovered (R) with exponential distributions. Therefore, more realistic infection tracking models can be developed by considering gamma distributions as observed in [107]. This more realistic model corresponds to the problem of real-time timely tracking of a binary Markov source in a serially connected network. The serially connected network model was studied in [8] with the traditional age of information metric. We note that considering the same networking model with the AoII-based error metric to track information dissemination of a binary Markov source represents a promising research direction and has direct applications to the real-time tracking of epidemic spread models. One can also study the extension of dependent infection spread model in Section 6 to n > 2 people as a future research direction.
Another interesting research direction could be to consider different kinds of tests with different false-positive and false-negative test rates. Regarding this problem, instead of having a total test rate capacity C, we may consider a total test budget K. Assuming that each test bears a different cost, the goal might be to identify how many tests the health care provider should obtain from each type. Here, one can study a trade-off between applying fewer tests with a small probability of error versus applying more tests to individuals with a high probability of error. Moreover, one can consider a scenario where the health care provider may prefer to apply different test types to individuals depending on their infection and recovery rates.

Author Contributions

Conceptualization, M.B. and S.U.; methodology, M.B. and S.U.; software, M.B.; validation, M.B. and S.U.; formal analysis, M.B. and S.U.; investigation, M.B. and S.U.; resources, M.B. and S.U.; data curation, M.B. and S.U.; writing—original draft preparation, M.B. and S.U.; writing—review and editing, M.B. and S.U.; visualization, M.B. and S.U.; supervision, S.U.; project administration, S.U.; funding acquisition, S.U. All authors have read and agreed to the published version of the manuscript.

Funding

This work was supported by NSF Grants CCF 17-13977 and ECCS 18-07348.

Data Availability Statement

Not applicable.

Conflicts of Interest

The authors declare no conflict of interest.

References

  1. Kaul, S.K.; Yates, R.D.; Gruteser, M. Real-time status: How often should one update? In Proceedings of the 2012 Proceedings IEEE INFOCOM, Orlando, FL, USA, 25–30 March 2012. [Google Scholar]
  2. Kadota, I.; Sinha, A.; Uysal-Biyikoglu, E.; Singh, R.; Modiano, E. Scheduling policies for minimizing age of information in broadcast wireless networks. IEEE/ACM Trans. Netw. 2018, 26, 2637–2650. [Google Scholar] [CrossRef] [Green Version]
  3. Kam, C.; Kompella, S.; Nguyen, G.D.; Wieselthier, J.E.; Ephremides, A. Age of information with a packet deadline. In Proceedings of the 2016 IEEE International Symposium on Information Theory (ISIT), Barcelona, Spain, 10–15 July 2016. [Google Scholar]
  4. Sun, Y.; Uysal-Biyikoglu, E.; Yates, R.D.; Koksal, C.E.; Shroff, N.B. Update or wait: How to keep your data fresh. IEEE Trans. Inf. Theory 2017, 63, 7492–7508. [Google Scholar] [CrossRef]
  5. Najm, E.; Telatar, E. Status updates in a multi-stream M/G/1/1 preemptive queue. In Proceedings of the IEEE Infocom 2018-IEEE Conference On Computer Communications Workshops (Infocom Wkshps), Honolulu, HI, USA, 15–19 April 2018. [Google Scholar]
  6. Soysal, A.; Ulukus, S. Age of information in G/G/1/1 systems: Age expressions, bounds, special cases, and optimization. IEEE Trans. Inf. Theory 2021, 67, 7477–7489. [Google Scholar] [CrossRef]
  7. Buyukates, B.; Ulukus, S. Age of information with Gilbert-Elliot servers and samplers. arXiv 2020, arXiv:2002.05711. [Google Scholar]
  8. Yates, R.D. The age of information in networks: Moments, distributions, and sampling. IEEE Trans. Inf. Theory 2020, 66, 5712–5728. [Google Scholar] [CrossRef]
  9. Talak, R.; Karaman, S.; Modiano, E. Minimizing age-of-information in multi-hop wireless networks. In Proceedings of the 2017 55th Annual Allerton Conference on Communication, Control, and Computing (Allerton), Monticello, IL, USA, 3–6 October 2017. [Google Scholar]
  10. Tripathi, V.; Moharir, S. Age of information in multi-source systems. In Proceedings of the GLOBECOM 2017-2017 IEEE Global Communications Conference, Centre, Singapore, 4–8 December 2017. [Google Scholar]
  11. Bedewy, A.M.; Sun, Y.; Shroff, N.B. The age of information in multihop networks. IEEE/ACM Trans. Netw. 2019, 27, 1248–1257. [Google Scholar] [CrossRef] [Green Version]
  12. Zhong, J.; Yates, R.D.; Soljanin, E. Multicast with prioritized delivery: How fresh is your data? In Proceedings of the 2018 IEEE 19th International Workshop on Signal Processing Advances in Wireless Communications (SPAWC), Kalamata, Greece, 25–28 June 2018. [Google Scholar]
  13. Buyukates, B.; Soysal, A.; Ulukus, S. Age of information in two-hop multicast networks. In Proceedings of the 2018 52nd Asilomar Conference on Signals, Systems, and Computers, Pacific Grove, CA, USA, 28–31 October 2018. [Google Scholar]
  14. Buyukates, B.; Soysal, A.; Ulukus, S. Age of information in multihop multicast networks. J. Commun. Netw. 2019, 21, 256–267. [Google Scholar] [CrossRef] [Green Version]
  15. Buyukates, B.; Soysal, A.; Ulukus, S. Age of information in multicast networks with multiple update streams. In Proceedings of the 2019 53rd Asilomar Conference on Signals, Systems, and Computers, Pacific Grove, CA, USA, 3–6 November 2019. [Google Scholar]
  16. Krishnan, K.S.A.; Sharma, V. Minimizing age of information in a multihop wireless network. In Proceedings of the ICC 2020-2020 IEEE International Conference on Communications, Dublin, Ireland, 7–11 June 2020. [Google Scholar]
  17. Farazi, S.; Klein, A.G.; Brown, D.R., III. Fundamental bounds on the age of information in multi-hop global status update networks. J. Commun. Netw. 2019, 21, 268–279. [Google Scholar] [CrossRef]
  18. Ioannidis, S.; Chaintreau, A.; Massoulie, L. Optimal and scalable distribution of content updates over a mobile social network. In Proceedings of the IEEE Infocom, Rio De Janeiro, Brazil, 24 April 2009. [Google Scholar]
  19. Wang, M.; Chen, W.; Ephremides, A. Reconstruction of counting process in real-time: The freshness of information through queues. In Proceedings of the ICC 2019-2019 IEEE International Conference on Communications (ICC), Shanghai, China, 20–24 May 2019. [Google Scholar]
  20. Sun, Y.; Polyanskiy, Y.; Uysal-Biyikoglu, E. Remote estimation of the Wiener process over a channel with random delay. In Proceedings of the 2017 IEEE International Symposium on Information Theory (ISIT), Aachen, Germany, 25–30 June 2017. [Google Scholar]
  21. Sun, Y.; Cyr, B. Information aging through queues: A mutual information perspective. In Proceedings of the 2018 IEEE 19th International Workshop on Signal Processing Advances in Wireless Communications (SPAWC), Kalamata, Greece, 25–28 June 2018. [Google Scholar]
  22. Chakravorty, J.; Mahajan, A. Remote estimation over a packet-drop channel with Markovian state. IEEE Trans. Autom. Control 2020, 65, 2016–2031. [Google Scholar] [CrossRef] [Green Version]
  23. Kam, C.; Kompella, S.; Ephremides, A. Age of incorrect information for remote estimation of a binary Markov source. In Proceedings of the IEEE INFOCOM 2020-IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS), Toronto, ON, Canada, 6–9 July 2020. [Google Scholar]
  24. Arafa, A.; Banawan, K.; Seddik, K.G.; Poor, H.V. Sample, quantize and encode: Timely estimation over noisy channels. IEEE Trans. Commun. 2021, 69, 6485–6499. [Google Scholar] [CrossRef]
  25. Bastopcu, M.; Ulukus, S. Who should Google Scholar update more often? In Proceedings of the IEEE INFOCOM 2020-IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS), Toronto, ON, Canada, 6–9 July 2020. [Google Scholar]
  26. Bacinoglu, B.T.; Sun, Y.; Uysal-Biyikoglu, E.; Mutlu, V. Achieving the age-energy trade-off with a finite-battery energy harvesting source. In Proceedings of the 2018 IEEE International Symposium on Information Theory (ISIT), Vail, CO, USA, 17–22 June 2018. [Google Scholar]
  27. Baknina, A.; Ozel, O.; Yang, J.; Ulukus, S.; Yener, A. Sending information through status updates. In Proceedings of the 2018 IEEE International Symposium on Information Theory (ISIT), Vail, CO, USA, 17–22 June 2018. [Google Scholar]
  28. Baknina, A.; Ulukus, S. Coded status updates in an energy harvesting erasure channel. In Proceedings of the 2018 52nd Annual Conference on Information Sciences and Systems (CISS), Princeton, NJ, USA, 21–23 March 2018. [Google Scholar]
  29. Wu, X.; Yang, J.; Wu, J. Optimal status update for age of information minimization with an energy harvesting source. IEEE Trans. Green Commun. Netw. 2018, 2, 193–204. [Google Scholar] [CrossRef]
  30. Feng, S.; Yang, J. Optimal status updating for an energy harvesting sensor with a noisy channel. In Proceedings of the IEEE INFOCOM 2018-IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS), Honolulu, HI, USA, 15–19 April 2018. [Google Scholar]
  31. Feng, S.; Yang, J. Minimizing age of information for an energy harvesting source with updating failures. In Proceedings of the 2018 IEEE International Symposium on Information Theory (ISIT), Vail, CO, USA, 17–22 June 2018. [Google Scholar]
  32. Arafa, A.; Yang, J.; Ulukus, S.; Poor, H.V. Age-minimal online policies for energy harvesting sensors with incremental battery recharges. In Proceedings of the 2018 Information Theory and Applications Workshop (ITA), San Diego, CA, USA, 11–16 February 2018. [Google Scholar]
  33. Arafa, A.; Yang, J.; Ulukus, S. Age-minimal online policies for energy harvesting sensors with random battery recharges. In Proceedings of the 2018 IEEE international conference on communications (ICC), Kansas City, MO, USA, 20–24 May 2018. [Google Scholar]
  34. Arafa, A.; Yang, J.; Ulukus, S.; Poor, H.V. Age-minimal transmission for energy harvesting sensors with finite batteries: Online policies. IEEE Trans. Inf. Theory 2020, 66, 534–556. [Google Scholar] [CrossRef] [Green Version]
  35. Arafa, A.; Yang, J.; Ulukus, S.; Poor, H.V. Online timely status updates with erasures for energy harvesting sensors. In Proceedings of the 2018 56th Annual Allerton Conference on Communication, Control, and Computing (Allerton), Monticello, IL, USA, 2–5 October 2018. [Google Scholar]
  36. Arafa, A.; Yang, J.; Ulukus, S.; Poor, H.V. Using erasure feedback for online timely updating with an energy harvesting sensor. In Proceedings of the 2019 IEEE International Symposium on Information Theory (ISIT), Paris, France, 7–12 July 2019. [Google Scholar]
  37. Arafa, A.; Yang, J.; Ulukus, S.; Poor, H.V. Timely status updating over erasure channels using an energy harvesting sensor: Single and multiple sources. IEEE Trans. Green Commun. Netw. 2022, 6, 6–19. [Google Scholar] [CrossRef]
  38. Farazi, S.; Klein, A.G.; Brown, D.R., III. Average age of information for status update systems with an energy harvesting server. In Proceedings of the IEEE INFOCOM 2018-IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS), Honolulu, HI, USA, 15–19 April 2018. [Google Scholar]
  39. Leng, S.; Yener, A. Age of information minimization for an energy harvesting cognitive radio. IEEE Trans. Cogn. Commun. Netw. 2019, 5, 427–439. [Google Scholar] [CrossRef]
  40. Chen, Z.; Pappas, N.; Bjornson, E.; Larsson, E.G. Age of information in a multiple access channel with heterogeneous traffic and an energy harvesting node. In Proceedings of the IEEE INFOCOM 2019-IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS), Paris, France, 29 April–2 May 2019. [Google Scholar]
  41. Bhat, R.V.; Vaze, R.; Motani, M. Throughput maximization with an average age of information constraint in fading channels. IEEE Trans. Wirel. Commun. 2021, 20, 481–494. [Google Scholar] [CrossRef]
  42. Ostman, J.; Devassy, R.; Durisi, G.; Uysal, E. Peak-age violation guarantees for the transmission of short packets over fading channels. In Proceedings of the IEEE INFOCOM 2019-IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS), Paris, France, 29 April–2 May 2019. [Google Scholar]
  43. Bastopcu, M.; Ulukus, S. Age of information with soft updates. In Proceedings of the 2018 56th Annual Allerton Conference on Communication, Control, and Computing (Allerton), Monticello, IL, USA, 2–5 October 2018. [Google Scholar]
  44. Bastopcu, M.; Ulukus, S. Minimizing age of information with soft updates. J. Commun. Netw. 2019, 21, 233–243. [Google Scholar] [CrossRef] [Green Version]
  45. Buyukates, B.; Soysal, A.; Ulukus, S. Age of information scaling in large networks. In Proceedings of the 2019 IEEE Global Communications Conference (GLOBECOM), Waikoloa, HI, USA, 9–13 December 2019. [Google Scholar]
  46. Buyukates, B.; Soysal, A.; Ulukus, S. Age of information scaling in large networks with hierarchical cooperation. In Proceedings of the 2019 IEEE Global Communications Conference (GLOBECOM), Waikoloa, HI, USA, 9–13 December 2019. [Google Scholar]
  47. Buyukates, B.; Soysal, A.; Ulukus, S. Scaling laws for age of information in wireless networks. IEEE Trans. Wirel. Commun. 2021, 20, 2413–2427. [Google Scholar] [CrossRef]
  48. Zhong, J.; Yates, R.D.; Soljanin, E. Minimizing content staleness in dynamo-style replicated storage systems. In Proceedings of the IEEE INFOCOM 2018-IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS), Honolulu, HI, USA, 15–19 April 2018. [Google Scholar]
  49. Rajaraman, N.; Vaze, R.; Reddy, G. Not just age but age and quality of information. IEEE J. Sel. Areas Commun. 2021, 39, 1325–1338. [Google Scholar] [CrossRef]
  50. Liu, Z.; Ji, B. Towards the tradeoff between service performance and information freshness. In Proceedings of the ICC 2019-2019 IEEE International Conference on Communications (ICC), Shanghai, China, 20–24 May 2019. [Google Scholar]
  51. Maatouk, A.; Assaad, M.; Ephremides, A. The age of incorrect information: An enabler of semantics-empowered communication. arXiv 2020, arXiv:2012.13214. [Google Scholar]
  52. Uysal, E.; Kaya, O.; Ephremides, A.; Gross, J.; Codreanu, M.; Popovski, P.; Johansson, K.H. Semantic communications in networked systems. arXiv 2021, arXiv:2103.05391. [Google Scholar]
  53. Ayan, O.; Vilgelm, M.; Klügel, M.; Hirche, S.; Kellerer, W. Age-of-information vs. value-of-information scheduling for cellular networked control systems. In Proceedings of the 10th ACM/IEEE International Conference on Cyber-Physical Systems, Montreal, QC, Canada, 16–18 April 2019. [Google Scholar]
  54. Bastopcu, M.; Ulukus, S. Timely group updating. In Proceedings of the 2021 55th Annual Conference on Information Sciences and Systems (CISS), Baltimore, MD, USA, 24–26 March 2021. [Google Scholar]
  55. Banerjee, S.; Bhattacharjee, R.; Sinha, A. Fundamental limits of age-of-information in stationary and non-stationary environments. In Proceedings of the 2020 IEEE International Symposium on Information Theory (ISIT), Los Angeles, CA, USA, 21–26 June 2020. [Google Scholar]
  56. Zhong, J.; Yates, R.D. Timeliness in lossless block coding. In Proceedings of the 2016 Data Compression Conference (DCC), Snowbird, UT, USA, 29 March–1 April 2016. [Google Scholar]
  57. Zhong, J.; Yates, R.D.; Soljanin, E. Timely lossless source coding for randomly arriving symbols. In Proceedings of the 2018 IEEE Information Theory Workshop (ITW), Guangzhou, China, 25–29 November 2018. [Google Scholar]
  58. Mayekar, P.; Parag, P.; Tyagi, H. Optimal lossless source codes for timely updates. In Proceedings of the 2018 IEEE International Symposium on Information Theory (ISIT), Vail, CO, USA, 17–22 June 2018. [Google Scholar]
  59. Mayekar, P.; Parag, P.; Tyagi, H. Optimal source codes for timely updates. IEEE Trans. Inf. Theory 2020, 66, 3714–3731. [Google Scholar] [CrossRef] [Green Version]
  60. Bastopcu, M.; Buyukates, B.; Ulukus, S. Optimal selective encoding for timely updates. In Proceedings of the 2020 54th Annual Conference on Information Sciences and Systems (CISS), Princeton, NJ, USA, 18–20 March 2020. [Google Scholar]
  61. Buyukates, B.; Bastopcu, M.; Ulukus, S. Optimal selective encoding for timely updates with empty symbol. In Proceedings of the 2020 IEEE International Symposium on Information Theory (ISIT), Los Angeles, CA, USA, 21–26 June 2020. [Google Scholar]
  62. Bastopcu, M.; Buyukates, B.; Ulukus, S. Selective encoding policies for maximizing information freshness. IEEE Trans. Commun. 2021, 69, 5714–5726. [Google Scholar] [CrossRef]
  63. Ramirez, D.; Erkip, E.; Poor, H.V. Age of information with finite horizon and partial updates. In Proceedings of the ICASSP 2020-2020 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP), Barcelona, Spain, 4–8 May 2020. [Google Scholar]
  64. Arafa, A.; Banawan, K.; Seddik, K.G.; Poor, H.V. On timely channel coding with hybrid ARQ. In Proceedings of the 2019 IEEE Global Communications Conference (GLOBECOM), Big Island, HI, USA, 9–13 December 2019. [Google Scholar]
  65. Arafa, A.; Wesel, R.D. Timely transmissions using optimized variable length coding. In Proceedings of the IEEE INFOCOM 2021-IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS), Vancouver, BC, Canada, 10–13 May 2021. [Google Scholar]
  66. Bastopcu, M.; Ulukus, S. Partial updates: Losing information for freshness. In Proceedings of the 2020 IEEE International Symposium on Information Theory (ISIT), Los Angeles, CA, USA, 21–26 June 2020. [Google Scholar]
  67. Abd-Elmagid, M.A.; Dhillon, H.S. Average peak age-of-information minimization in UAV-assisted IoT networks. IEEE Trans. Veh. Technol. 2019, 68, 2003–2008. [Google Scholar] [CrossRef] [Green Version]
  68. Liu, J.; Wang, X.; Dai, H. Age-optimal trajectory planning for UAV-assisted data collection. In Proceedings of the IEEE INFOCOM 2018-IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS), Honolulu, HI, USA, 15–19 April 2018. [Google Scholar]
  69. Abd-Elmagid, M.A.; Pappas, N.; Dhillon, H.S. On the role of age of information in the internet of things. IEEE Commun. Mag. 2019, 57, 72–77. [Google Scholar] [CrossRef] [Green Version]
  70. Alabbasi, A.; Aggarwal, V. Joint information freshness and completion time optimization for vehicular networks. IEEE Trans. Serv. Comput. 2020, 15, 1–14. [Google Scholar] [CrossRef] [Green Version]
  71. Gao, W.; Cao, G.; Srivatsa, M.; Iyengar, A. Distributed maintenance of cache freshness in opportunistic mobile networks. In Proceedings of the 2012 IEEE 32nd International Conference on Distributed Computing Systems, Macau, China, 18–21 June 2012. [Google Scholar]
  72. Yates, R.D.; Ciblat, P.; Yener, A.; Wigger, M. Age-optimal constrained cache updating. In Proceedings of the 2017 IEEE International Symposium on Information Theory (ISIT), Aachen, Germany, 25–30 June 2017. [Google Scholar]
  73. Kam, C.; Kompella, S.; Nguyen, G.D.; Wieselthier, J.E.; Ephremides, A. Information freshness and popularity in mobile caching. In Proceedings of the 2017 IEEE International Symposium on Information Theory (ISIT), Aachen, Germany, 25–30 June 2017. [Google Scholar]
  74. Zhang, S.; Li, J.; Luo, H.; Gao, J.; Zhao, L.; Shen, X.S. Towards fresh and low-latency content delivery in vehicular networks: An edge caching aspect. In Proceedings of the 2018 10th International Conference on Wireless Communications and Signal Processing (WCSP), Hangzhou, China, 18–20 October 2018. [Google Scholar]
  75. Tang, H.; Ciblat, P.; Wang, J.; Wigger, M.; Yates, R. Age of information aware cache updating with file- and age-dependent update durations. In Proceedings of the 2020 18th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOPT), Volos, Greece, 15–19 June 2020. [Google Scholar]
  76. Zhong, J.; Yates, R.D.; Soljanin, E. Two freshness metrics for local cache refresh. In Proceedings of the 2018 IEEE International Symposium on Information Theory (ISIT), Vail, CO, USA, 17–22 June 2018. [Google Scholar]
  77. Yang, L.; Zhong, Y.; Zheng, F.; Jin, S. Edge caching with real-time guarantees. arXiv 2019, arXiv:1912.11847. [Google Scholar]
  78. Bastopcu, M.; Ulukus, S. Maximizing information freshness in caching systems with limited cache storage capacity. In Proceedings of the 2020 54th Asilomar Conference on Signals, Systems, and Computers, Pacific Grove, CA, USA, 1–5 November 2020. [Google Scholar]
  79. Bastopcu, M.; Ulukus, S. Cache freshness in information updating systems. In Proceedings of the 2021 55th Annual Conference on Information Sciences and Systems (CISS), Baltimore, MD, USA, 24–26 March 2021. [Google Scholar]
  80. Bastopcu, M.; Ulukus, S. Information freshness in cache updating systems. IEEE Trans. Wirel. Commun. 2021, 20, 1861–1874. [Google Scholar] [CrossRef]
  81. Kaswan, P.; Bastopcu, M.; Ulukus, S. Freshness based cache updating in parallel relay networks. In Proceedings of the 2021 IEEE International Symposium on Information Theory (ISIT), Melbourne, Australia, 12–20 July 2021. [Google Scholar]
  82. Gu, Y.; Wang, Q.; Chen, H.; Li, Y.; Vucetic, B. Optimizing information freshness in two-hop status update systems under a resource constraint. IEEE J. Sel. Areas Commun. 2021, 39, 1380–1392. [Google Scholar] [CrossRef]
  83. Kuang, Q.; Gong, J.; Chen, X.; Ma, X. Age-of-information for computation-intensive messages in mobile edge computing. arXiv 2019, arXiv:1901.01854. [Google Scholar]
  84. Gong, J.; Kuang, Q.; Chen, X.; Ma, X. Reducing age-of-information for computation-intensive messages via packet replacement. In Proceedings of the 2019 11th International Conference on Wireless Communications and Signal Processing (WCSP), Xi’an, China, 23–25 October 2019. [Google Scholar]
  85. Zou, P.; Ozel, O.; Subramaniam, S. Trading off computation with transmission in status update systems. In Proceedings of the 2019 IEEE 30th Annual International Symposium on Personal, Indoor and Mobile Radio Communications (PIMRC), Istanbul, Turkey, 8–11 September 2019. [Google Scholar]
  86. Bastopcu, M.; Ulukus, S. Age of information for updates with distortion. In Proceedings of the 2019 IEEE Information Theory Workshop (ITW), Gotland, Sweden, 25–28 August 2019. [Google Scholar]
  87. Bastopcu, M.; Ulukus, S. Age of information for updates with distortion: Constant and age-dependent distortion constraints. IEEE/ACM Trans. Netw. 2021, 29, 2425–2438. [Google Scholar] [CrossRef]
  88. Buyukates, B.; Ulukus, S. Timely updates in distributed computation systems with stragglers. In Proceedings of the 2020 54th Asilomar Conference on Signals, Systems, and Computers, Pacific Grove, CA, USA, 1–5 November 2020. [Google Scholar]
  89. Buyukates, B.; Ulukus, S. Timely distributed computation with stragglers. IEEE Trans. Commun. 2020, 68, 5273–5282. [Google Scholar] [CrossRef]
  90. Zou, P.; Ozel, O.; Subramaniam, S. Optimizing information freshness through computation–transmission tradeoff and queue management in edge computing. IEEE/ACM Trans. Netw. 2021, 29, 949–963. [Google Scholar] [CrossRef]
  91. Buyukates, B.; Ulukus, S. Timely communication in federated learning. In Proceedings of the IEEE INFOCOM 2021-IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS), Vancouver, BC, Canada, 10–13 May 2021. [Google Scholar]
  92. Ozfatura, E.; Buyukates, B.; Gündüz, D.; Ulukus, S. Age-based coded computation for bias reduction in distributed learning. In Proceedings of the GLOBECOM 2020-2020 IEEE Global Communications Conference, Taipei, Taiwan, 7–11 December 2020. [Google Scholar]
  93. Ceran, E.T.; Gündüz, D.; György, A. A reinforcement learning approach to age of information in multi-user networks with HARQ. IEEE J. Sel. Areas Commun. 2021, 39, 1412–1426. [Google Scholar] [CrossRef]
  94. Yates, R.D. The age of gossip in networks. In Proceedings of the 2021 IEEE International Symposium on Information Theory (ISIT), Melbourne, Australia, 12–20 July 2021. [Google Scholar]
  95. Buyukates, B.; Bastopcu, M.; Ulukus, S. Age of gossip in networks with community structure. In Proceedings of the 2021 IEEE 22nd International Workshop on Signal Processing Advances in Wireless Communications (SPAWC), Lucca, Italy, 27–30 September 2021. [Google Scholar]
  96. Bastopcu, M.; Buyukates, B.; Ulukus, S. Gossiping with binary freshness metric. In Proceedings of the 2021 IEEE Globecom Workshops (GC Wkshps), Madrid, Spain, 7–11 December 2021. [Google Scholar]
  97. Kaswan, P.; Ulukus, S. Timely gossiping with file slicing and network coding. arXiv 2022, arXiv:2202.00649. [Google Scholar]
  98. Kosta, A.; Pappas, N.; Angelakis, V. Age of information: A new concept, metric, and tool. Found. Trends Netw. 2017, 12, 162–259. [Google Scholar] [CrossRef] [Green Version]
  99. Sun, Y.; Kadota, I.; Talak, R.; Modiano, E. Age of information: A new metric for information freshness. Synth. Lect. Commun. Netw. 2019, 12, 1–224. [Google Scholar] [CrossRef]
  100. Yates, R.D.; Sun, Y.; Brown, D.R., III; Kaul, S.K.; Modiano, E.; Ulukus, S. Age of information: An introduction and survey. IEEE J. Sel. Areas Commun. 2021, 39, 1183–1210. [Google Scholar] [CrossRef]
  101. Yun, J.; Joo, C.; Eryilmaz, A. Optimal real-time monitoring of an information source under communication costs. In Proceedings of the 2018 IEEE Conference on Decision and Control (CDC), Miami Beach, FL, USA, 17–19 December 2018. [Google Scholar]
  102. Maatouk, A.; Kriouile, S.; Assaad, M.; Ephremides, A. The age of incorrect information: A new performance metric for status updates. IEEE/ACM Trans. Netw. 2020, 28, 2215–2228. [Google Scholar] [CrossRef]
  103. Yates, R.D.; Goodman, D.J. Probability and Stochastic Processes; Wiley: Hoboken, NJ, USA, 2014. [Google Scholar]
  104. Boyd, S.P.; Vandenberghe, L. Convex Optimization; Cambridge University Press: Cambridge, UK, 2004. [Google Scholar]
  105. Bertsekas, D.P.; Tsitsiklis, J.N. Introduction to Probability; Athena Scientific: Belmont, MA, USA, 2008. [Google Scholar]
  106. Chen, Y.C.; Lu, P.E.; Chang, C.S.; Liu, T.H. A time-dependent SIR model for COVID-19 with undetectable infected persons. IEEE Trans. Netw. Sci. Eng. 2020, 7, 3279–3294. [Google Scholar] [CrossRef]
  107. Olmez, S.Y.; Mori, J.; Miehling, E.; Başar, T.; Smith, R.L.; West, M.; Mehta, P.G. A data-informed approach for analysis, validation, and identification of COVID-19 models. In Proceedings of the 2021 American Control Conference (ACC), New Orleans, LA, USA, 25–28 May 2021. [Google Scholar]
Figure 1. System model. There are n people whose infection status are given by x i ( t ) . The health care provider applies tests on these people. Based on the test results, estimations for the infection status x ^ i ( t ) are generated. Infected people are shown in red and healthy people are shown in green.
Figure 1. System model. There are n people whose infection status are given by x i ( t ) . The health care provider applies tests on these people. Based on the test results, estimations for the infection status x ^ i ( t ) are generated. Infected people are shown in red and healthy people are shown in green.
Entropy 24 00779 g001
Figure 2. (a) A sample evolution of x i ( t ) and x ^ i ( t ) , and (b) the corresponding Δ i ( t ) in (5). Green areas correspond to the error caused by Δ i 1 ( t ) in (3). Orange areas correspond to the error caused by Δ i 2 ( t ) in (4).
Figure 2. (a) A sample evolution of x i ( t ) and x ^ i ( t ) , and (b) the corresponding Δ i ( t ) in (5). Green areas correspond to the error caused by Δ i 1 ( t ) in (3). Orange areas correspond to the error caused by Δ i 2 ( t ) in (4).
Entropy 24 00779 g002
Figure 3. A sample evolution of (a) Δ i 1 ( t ) , and (b) Δ i 2 ( t ) in a typical cycle.
Figure 3. A sample evolution of (a) Δ i 1 ( t ) , and (b) Δ i 2 ( t ) in a typical cycle.
Entropy 24 00779 g003
Figure 4. Transition graphs of the states ( x i ( t ) , x ^ i ( t ) ) (a) when there is no error in the tests, and (b) when there are errors in the tests.
Figure 4. Transition graphs of the states ( x i ( t ) , x ^ i ( t ) ) (a) when there is no error in the tests, and (b) when there are errors in the tests.
Entropy 24 00779 g004
Figure 5. The infection rates of two people where the individual infection rate is equal to λ . When the infection has not been detected, these two people can infect each other with rate λ 12 .
Figure 5. The infection rates of two people where the individual infection rate is equal to λ . When the infection has not been detected, these two people can infect each other with rate λ 12 .
Entropy 24 00779 g005
Figure 6. A sample evolution of (a) Δ i 1 s ( t ) , and (b) Δ i 2 s ( t ) in a typical update cycle.
Figure 6. A sample evolution of (a) Δ i 1 s ( t ) , and (b) Δ i 2 s ( t ) in a typical update cycle.
Entropy 24 00779 g006
Figure 7. (a) Test rates s i and c i , (b) corresponding average difference Δ i .
Figure 7. (a) Test rates s i and c i , (b) corresponding average difference Δ i .
Entropy 24 00779 g007
Figure 8. The average difference Δ with respect to total test rate C.
Figure 8. The average difference Δ with respect to total test rate C.
Entropy 24 00779 g008
Figure 9. The average difference Δ with respect to number of people n. We use uniform infection and healing rates, i.e., λ i = 6 n and μ i = 4 n for all i, and also λ i in (80) and μ i in (81) with i = 1 n λ i = 6 and i = 1 n μ i = 4 .
Figure 9. The average difference Δ with respect to number of people n. We use uniform infection and healing rates, i.e., λ i = 6 n and μ i = 4 n for all i, and also λ i in (80) and μ i in (81) with i = 1 n λ i = 6 and i = 1 n μ i = 4 .
Entropy 24 00779 g009
Figure 10. (a) Δ in (7), Δ ¯ 1 which is 1 n i = 1 n Δ i 1 , and Δ ¯ 2 which is 1 n i = 1 n Δ i 2 , (b) corresponding total test rates i = 1 n s i and i = 1 n c i .
Figure 10. (a) Δ in (7), Δ ¯ 1 which is 1 n i = 1 n Δ i 1 , and Δ ¯ 2 which is 1 n i = 1 n Δ i 2 , (b) corresponding total test rates i = 1 n s i and i = 1 n c i .
Entropy 24 00779 g010
Figure 11. (a) Test rates v i , (b) corresponding average difference Δ i e when there is error in the tests.
Figure 11. (a) Test rates v i , (b) corresponding average difference Δ i e when there is error in the tests.
Entropy 24 00779 g011
Figure 12. (a) The percentage of the time that person 1 stays as infected while we increase λ 12 , (b) the percentage of the time that both person 1 and 2 stay as infected while we increase the total test rate C.
Figure 12. (a) The percentage of the time that person 1 stays as infected while we increase λ 12 , (b) the percentage of the time that both person 1 and 2 stay as infected while we increase the total test rate C.
Entropy 24 00779 g012
Figure 13. (a) The normalized average differences Δ i s i = 1 n Δ i s , and Δ i e i = 1 n Δ i e , and (b) the corresponding test rates w i and v i .
Figure 13. (a) The normalized average differences Δ i s i = 1 n Δ i s , and Δ i e i = 1 n Δ i e , and (b) the corresponding test rates w i and v i .
Entropy 24 00779 g013
Table 1. List of variables used in this work.
Table 1. List of variables used in this work.
VariablesDefinition of the Variables
Section 2, Section 3 and Section 4
nnumber of people in the population
x i ( t ) infection status of the ith person at time t
x ^ i ( t ) estimation of x i ( t ) at the health care provider
λ i , μ i infection and recovery rates for the ith person
c i , s i test rates applied to the ith person when x ^ i ( t ) = 1 , and x ^ i ( t ) = 0
Δ i ( t ) total estimation error for the ith person at time t
θ importance factor in [ 0 , 1 ]
Δ i the long-time weighted average for the ith person
Ctotal test rate constraint
Section 5
Δ i e the long-time average difference for the ith person with
erroneous test measurements
qfalse-negative testing probability with 0 q < 1 2
pfalse-positive testing probability with 0 p < 1 2
v i test rate applied to the ith person with erroneous test measurements
Section 6
λ , μ individual infection and recovery rate of a person
λ 12 the rate of spreading the virus from an undetected infected person
to a healthy person
c, stest rates applied to people when x ^ i ( t ) = 1 , and x ^ i ( t ) = 0
Δ i d the long-time average difference for the ith person with
dependent infection rates
Section 7
w i test rate applied to the ith person for AoII-based error metric
Δ i s the long-time average difference for the ith person with
AoII-based error metric
Table 2. The probability distribution for successful and false test measurements.
Table 2. The probability distribution for successful and false test measurements.
x i ( t ) x ^ i ( t ) 01
0 1 p p
1q 1 q
Publisher’s Note: MDPI stays neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Share and Cite

MDPI and ACS Style

Bastopcu, M.; Ulukus, S. Using Timeliness in Tracking Infections. Entropy 2022, 24, 779. https://doi.org/10.3390/e24060779

AMA Style

Bastopcu M, Ulukus S. Using Timeliness in Tracking Infections. Entropy. 2022; 24(6):779. https://doi.org/10.3390/e24060779

Chicago/Turabian Style

Bastopcu, Melih, and Sennur Ulukus. 2022. "Using Timeliness in Tracking Infections" Entropy 24, no. 6: 779. https://doi.org/10.3390/e24060779

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop