On Emptying a Wireless Network with Minimum-Energy Under Age Constraints

He, Qinming; Dán, György; Fodor, Viktoria

doi:10.1109/infcomw.2019.8845089

Cited by 9 publications

(5 citation statements)

References 17 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

Section: A Related Workmentioning

confidence: 99%

“…Recently, the optimization and analysis of the average age of information have attracted a lot of attention; see, for example, [25]- [34]. In [25], the authors consider the link scheduling problem in a multiple users system under age of information constraints. In [26], the authors consider the age of information minimization problem in an Internet of things (IoT) system in which packets arrive with either random or fixed deadlines.…”

Section: A Related Workmentioning

confidence: 99%

See 1 more Smart Citation

Information freshness and packet drop rate interplay in a two-user multi-access channel

et al. 2022

View full text Add to dashboard Cite

In this work, we combine the two notions of timely delivery of information to study their interplay; namely, deadlineconstrained packet delivery due to latency constraints and freshness of information. More specifically, we consider a twouser multiple access setup with random access, in which user 1 is a wireless device with a buffer and has external bursty traffic which is deadline-constrained, while user 2 monitors a sensor and transmits status updates to the destination. We provide analytical expressions for the throughput and drop probability of user 1. For user 2, we derive in closed form the age of information distribution, the average age of information (AoI), and the probability the AoI to be larger than a certain value for each time slot. The relations reveal a trade-off between the average AoI of user 2 and the drop rate of user 1: the lower the average AoI, the higher the drop rate, and vice versa. Simulations corroborate the validity of our theoretical results.Index Terms-Age of information, deadline-constrained traffic, multi-access channel, random access. I. INTRODUCTIONT HE proliferation of inexpensive devices with impressive sensing, computing, and control capabilities has lead to their widespread use in modern control environments which are often referred to as wireless networked control systems (WNCSs). Wireless sensors offer several advantages compared to their wired counterparts, such as scalability and flexibility in deployment at a lower cost, while at the same time they facilitate breaking new disruptive technologies into the market, such as autonomous vehicles, wireless industrial automation, environmental, and health monitoring, to name a few [2], [3]. In such scenarios, however, often a shared wireless network is used for information exchange, which introduces unique challenges that need to be addressed to avoid

show abstract

Section: A Related Workmentioning

confidence: 99%

Section: A Related Workmentioning

confidence: 99%

Information freshness and packet drop rate interplay in a two-user multi-access channel

et al. 2022

View full text Add to dashboard Cite

show abstract

“…Another line of research arises from the introduction of AoI to various applications and networking context. By including energy constraints, [23] extends [12] for optimal link activation for AoI minimization in wireless networks with interference. The study in [24] is similar to [12] and [23] in terms of the scheduling aspect and the presence of interference, however the system model considers AoI for all node pairs of the network, and the emphasis is on performance bounds.…”

Section: Related Workmentioning

confidence: 99%

“…By including energy constraints, [23] extends [12] for optimal link activation for AoI minimization in wireless networks with interference. The study in [24] is similar to [12] and [23] in terms of the scheduling aspect and the presence of interference, however the system model considers AoI for all node pairs of the network, and the emphasis is on performance bounds. The work in [25] considers a twoway data exchanging system, where the AoI is constrained by the uplink transmission capability and the downlink energy transfer capability.…”

Section: Related Workmentioning

confidence: 99%

Optimal Scheduling of Age-centric Caching: Tractability and Computation

Ahani¹,

Yuan²

2020

Preprint

View full text Add to dashboard Cite

The notion of age of information (AoI) has become an important performance metric in network and control systems. Information freshness, represented by AoI, naturally arises in the context of caching. We address optimal scheduling of cache updates for a time-slotted system where the contents vary in size. There is limited capacity for the cache and for making content updates. Each content is associated with a utility function that is monotonically decreasing in the AoI. For this combinatorial optimization problem, we present the following contributions. First, we provide theoretical results settling the boundary of problem tractability. In particular, by a reformulation using network flows, we prove the boundary is essentially determined by whether or not the contents are of equal size. Second, we derive an integer linear formulation for the problem, of which the optimal solution can be obtained for small-scale scenarios. Next, via a mathematical reformulation, we derive a scalable optimization algorithm using repeated column generation. In addition, the algorithm computes a bound of global optimum, that can be used to assess the performance of any scheduling solution. Performance evaluation of large-scale scenarios demonstrates the strengths of the algorithm in comparison to a greedy schedule. Finally, we extend the applicability of our work to cyclic scheduling.

show abstract

“…The authors apply tools from Lyapunov optimization theory and provide an algorithm that minimizes the power consumption while keeping the data fresh in the destination. In an AoI-constrained wireless network, authors in [17] consider the link activation problem for energy minimization. To the best of our knowledge there is no work that considers both transmission and sampling costs in a wireless network with time average AoI constraints.…”

Section: Introductionmentioning

confidence: 99%

Optimal Sampling Cost in Wireless Networks with Age of Information Constraints

Fountoulakis

Παππάς

Codreanu

et al. 2020

IEEE INFOCOM 2020 - IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)

View full text Add to dashboard Cite

We consider the problem of minimizing the time average cost of sampling and transmitting status updates by users over a wireless channel subject to average Age of Information constraints (AoI). Errors in the transmission may occur and the scheduling algorithm has to decide if the users sample a new packet or attempt for retransmission of the packet sampled previously. The cost consists of both sampling and transmission costs. The sampling of a new packet after a failure imposes an additional cost in the system. We formulate a stochastic optimization problem with time average cost in the objective under time average AoI constraints. To solve this problem, we apply tools from Lyapunov optimization theory and develop a dynamic algorithm that takes decisions in a slot-by-slot basis. The algorithm decides if a user: a) samples a new packet, b) transmits the old one, c) remains silent. We provide optimality guarantees of the algorithm and study its performance in terms of time average cost and AoI through simulation results.

show abstract

On Emptying a Wireless Network with Minimum-Energy Under Age Constraints

Cited by 9 publications

References 17 publications

Information freshness and packet drop rate interplay in a two-user multi-access channel

Information freshness and packet drop rate interplay in a two-user multi-access channel

Optimal Scheduling of Age-centric Caching: Tractability and Computation

Optimal Sampling Cost in Wireless Networks with Age of Information Constraints

Contact Info

Product

Resources

About