An official website of the United States government
We consider a collection of distributed sensor nodes periodically exchanging information to achieve real-time situa- tional awareness in a communication constrained setting, e.g., collaborative sensing amongst vehicles to enable safety-critical decisions. Nodes may be both consumers and producers of sensed information. Consumers express interest in information about particular locations, e.g., obstructed regions and/or road intersections, whilst producers provide updates on what they are currently able to see. Accordingly, we introduce and explore optimizing trade-offs between the coverage and the space-time average of the “age” of the information available to consumers. We consider two settings that capture the fundamental character of the problem. The first addresses selecting a subset of producers which optimizes a weighted sum of the coverage and the average age given that producers provide updates at a fixed rate. The second addresses the minimization of the weighted average age achieved by a fixed subset of producers with possibly overlapping coverage by optimizing their update rates. The former is shown to be submodular and thus amenable to greedy optimization while the latter has a non-convex/non-concave cost function which is amenable to effective optimization using tools such as the Frank- Wolfe algorithm. Numerical results exhibit the benefits of context dependent optimization information exchanges among obstructed sensing nodes in a communication constrained environment.
more »
« less
Optimizing Timely Coverage in Communication Constrained Collaborative Sensing Systems
We consider a collection of distributed sensor nodes periodically exchanging information to achieve real- time situational awareness in a communication constrained setting, e.g., collaborative sensing amongst vehicles to improve safety-critical decisions. Nodes may be both con- sumers and producers of sensed information. Consumers express interest in information about particular locations, e.g., obstructed regions and/or road intersections, whilst producers broadcast updates on what they are currently able to see. Accordingly, we introduce and explore optimiz- ing trade-offs between the coverage and the space-time in- terest weighted average “age” of the information available to consumers. We consider two settings that capture the fundamental character of the problem. The first addresses selecting a subset of producers that maximizes the cover- age of the consumers preferred regions and minimizes the average age of these regions given that producers provide updates at a fixed rate. The second addresses the mini- mization of the interest weighted average age achieved by a fixed subset of producers with possibly overlapping cov- erage by optimizing their update rates. The first problem is shown to be submodular and thus amenable to greedy op- timization while the second has a non-convex/non-concave cost function which is amenable to effective optimization using the Frank-Wolfe algorithm. Numerical results exhibit the benefits of context dependent optimization information sharing among obstructed sensing nodes.
more »
« less
- Award ID(s):
- 1809327
- PAR ID:
- 10379452
- Date Published:
- Journal Name:
- IEEE Transactions on Control of Network Systems
- ISSN:
- 2372-2533
- Page Range / eLocation ID:
- 1 to 12
- Format(s):
- Medium: X
- Sponsoring Org:
- National Science Foundation
More Like this
-
-
We consider a multicast network in which real-time status updates generated by a source are replicated and sent to multiple interested receiving nodes through independent links. The receiving nodes are divided into two groups: one priority group consists of k nodes that require the reception of every update packet, the other non-priority group consists of all other nodes without the delivery requirement. Using age of information as a freshness metric, we analyze the time-averaged age at both priority and non-priority nodes. For shifted-exponential link delay distributions, the average age at a priority node is lower than that at a non-priority node due to the delivery guarantee. However, this advantage for priority nodes disappears if the link delay is exponential distributed. Both groups of nodes have the same time-averaged age, which implies that the guaranteed delivery of updates has no effect the time-averaged freshness.more » « less
-
We consider the problem of timely exchange of updates between a central station and a set of ground terminals V , via a mobile agent that traverses across the ground terminals along a mobility graph G = (V;E). We design the trajectory of the mobile agent to minimize peak and average age of information (AoI), two newly proposed metrics for measuring timeliness of information. We consider randomized trajectories, in which the mobile agent travels from terminal i to terminal j with probability Pi;j . For the information gathering problem, we show that a randomized trajectory is peak age optimal and factor-8H average age optimal, where H is the mixing time of the randomized trajectory on the mobility graph G. We also show that the average age minimization problem is NP-hard. For the information dissemination problem, we prove that the same randomized trajectory is factor-O(H) peak and average age optimal. Moreover, we propose an age-based trajectory, which utilizes information about current age at terminals, and show that it is factor-2 average age optimal in a symmetric setting.more » « less
-
A source node updates its status as a point process and also forwards its updates to a network of observer nodes. Within the network of observers, these updates are forwarded as point processes from node to node. Each node wishes its knowledge of the source to be as timely as possible. In this network, timeliness is measured by a discrete form of age of information: each status change at the source is referred to as a version and the age at a node is how many versions out of date is its most recent update from the source. This work introduces a method for evaluating the average version age at each node in the network when nodes forward updates using a memoryless gossip protocol. This method is then demonstrated by version age analysis for a collection of simple networks. For gossip on a complete graph with symmetric updating rates, it is shown that each node has average age that grows as the logarithm of the network size.more » « less
-
In this paper, we consider transmission scheduling in a status update system, where updates are generated periodically and transmitted over a Gilbert-Elliott fading channel. The goal is to minimize the long-run average age of information (AoI) under a long-run average energy constraint. We consider two practical cases to obtain channel state information (CSI): (i) without channel sensing and (ii) with delayed channel sensing. For (i), CSI is revealed by the feedback (ACK/NACK) of a transmission, but when no transmission occurs, CSI is not revealed. Thus, we have to balance tradeoffs across energy, AoI, channel exploration, and channel exploitation. The problem is formulated as a constrained partially observable Markov decision process (POMDP). We show that the optimal policy is a randomized mixture of no more than two stationary deterministic policies each of which is of a threshold-type in the belief on the channel. For (ii), (delayed) CSI is available via channel sensing. Then, the tradeoff is only between the AoI and energy. The problem is formulated as a constrained MDP. The optimal policy is shown to have a similar structure as in (i) but with an AoI associated threshold. With these, we develop an optimal structure-aware algorithm for each case.more » « less
- Free Publicly Accessible Full Text
-
Accepted Manuscript1.0
- Journal Article:
- https://doi.org/10.1109/TCNS.2022.3203806
