A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL.
The file type is application/pdf.
Filters
Optimizing Information Freshness in Two-Hop Status Update Systems under a Resource Constraint
[article]
2021
arXiv
pre-print
Preserved Fulltext
Other Versions
In this paper, we investigate the age minimization problem for a two-hop relay system, under a resource constraint on the average number of forwarding operations at the relay. ...
Based on the observed multi-threshold structure of the optimal policy, we then devise a low-complexity double threshold relaying (DTR) policy with only two thresholds, one for relay's AoI and the other ...
What is the average AoI performance of the optimal or near-optimal policies in a multi-hop system under a resource constraint? ...
arXiv:2007.02531v2
fatcat:6biz5hpyv5h3phphrk4ilys2ka
Guest Editorial Age of Information
2021
IEEE Journal on Selected Areas in Communications
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL.
The file type is application/pdf.
The paper "Optimal and quantized mechanism design for fresh data acquisition," by Zhang et al., considers an information update system in which a destination acquires, and pays for, fresh data updates ...
Cyberphysical Systems and Applications Papers in this area use AoI to evaluate and optimize cyberphysical systems ranging from a UAV update collectors to edge and cloud server allocation. ...
The paper "Optimizing information freshness in two-hop status update system under a resource constraint," by Gu et al., studies a relay scheduling problem in a two-hop status-update system, where the relay ...
doi:10.1109/jsac.2021.3066816
fatcat:q25s42txefgy7bph73bcifeqqm
Minimizing AoI in Resource-Constrained Multi-Source Relaying Systems with Stochastic Arrivals
[article]
2021
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL.
The file type is application/pdf.
We formulate a stochastic optimization problem aiming to minimize the sum average age of information (AAoI) of sources under per-slot transmission capacity constraints and a long-run average resource constraint ...
We consider a multi-source relaying system where the sources independently and randomly generate status update packets which are sent to the destination with the aid of a bufferaided relay through unreliable ...
Leinonen has also been financially supported in part by the Academy of Finland (grant 319485). ...
arXiv:2109.05106v1
fatcat:mqtqjrsi4jb3tlgvfmj4dfe5nq
Low-Latency and Fresh Content Provision in Information-Centric Vehicular Networks
[article]
2020
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
To provide up-to-date information with low latency, two schemes are designed for cache update and content delivery at the roadside units (RSUs). ...
The roadside unit centric (RSUC) scheme decouples cache update and content delivery through bandwidth splitting, where the cached content items are updated regularly in a round-robin manner. ...
the resource reserved for Capacity-AoI trade-off under the two schemes. ...
arXiv:2005.04358v1
fatcat:gngc2gnrxzc3ngsxbtxlvzzdim
Two-Hop Age of Information Scheduling for Multi-UAV Assisted Mobile Edge Computing: FRL vs MADDPG
[article]
2022
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf.
In this work, we adopt the emerging technology of mobile edge computing (MEC) in the Unmanned aerial vehicles (UAVs) for communication-computing systems, to optimize the age of information (AoI) in the ...
To maintain the freshness of the tasks, we formulate the AoI minimization in two-hop communication framework, the first hop at the UAVs and the second hop at the BS. ...
In this regard, we suggest a two-hop MEC-enabled UAV network at which we should guarantee the freshness of Information. ...
arXiv:2206.09488v1
fatcat:ni3nkm4nerbmpomqc3y62y7jwi
Age of Information: An Introduction and Survey
[article]
2020
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
In particular, we describe the current state of the art in the design and optimization of low-latency cyberphysical systems and applications in which sources send time-stamped status updates to interested ...
These applications desire status updates at the recipients to be as timely as possible; however, this is typically constrained by limited system resources. ...
Note that while both [14] and [15] used the phrase system age of information, the optimization metric was indeed the average age of status updates. ...
arXiv:2007.08564v1
fatcat:l7ctda3ukfge5hqtbk3ez7pjia
Joint Transmission and Computing Scheduling for Status Update with Mobile Edge Computing
[article]
2020
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Age of Information (AoI), defined as the time elapsed since the generation of the latest received update, is a promising performance metric to measure data freshness for real-time status monitoring. ...
In many applications, status information needs to be extracted through computing, which can be processed at an edge server enabled by mobile edge computing (MEC). ...
Fig. 1 . 1 Status update system with MEC.
Lemma 1 . 1 Under the constraints (5b)-(5f), the objective ∆ T in the problem (5) is a non-increasing function of t k and an increasing function of c k . ...
arXiv:2002.09719v1
fatcat:s6p4ws27pfhvhd47tgjw7t4eby
Dynamic Scheduling for Minimizing AoI in Resource-Constrained Multi-Source Relaying Systems with Stochastic Arrivals
[article]
2022
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf.
We formulate a stochastic optimization problem and solve it under two different scenarios regarding the knowledge of system statistics: known environment and unknown environment. ...
We consider a multi-source relaying system where the independent sources randomly generate status update packets which are sent to the destination with the aid of a relay through unreliable links. ...
The age of information (AoI) has been proposed to characterize the information freshness in status update systems [4] . ...
arXiv:2203.05656v1
fatcat:6e6gkxbtdvabffzjmstjudrxmq
Optimal Policies for Status Update Generation in a Wireless System with Heterogeneous Traffic
[article]
2018
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
We consider the problem of optimally controlling the status update generation process for a system with a source-destination pair that communicates via a wireless link, whereby the source node is comprised ...
Furthermore, due to their limited computational resources they typically utilize a simple First-In First-Out (FIFO) queueing discipline. ...
In [20] the problem of AoI minimization for single-hop flows in a wireless network, under interference constraints and a time varying channel is considered. ...
arXiv:1810.03201v1
fatcat:wuf4tfsllnaaxpzfnjg7hvbzae
Freshness-Optimal Caching for Information Updating Systems with Limited Cache Storage Capacity
[article]
2020
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL.
The file type is application/pdf.
In order to keep the average freshness as large as possible in the cache updating system, we formulate an average freshness-optimal cache updating problem (AFOCUP) to obtain an optimal cache scheme. ...
In this paper, we investigate a cache updating system with a server containing N files, K relays and M users. The server keeps the freshest versions of the files which are updated with fixed rates. ...
In this section, we investigate the optimal caching update strategy to maximize the average freshness F over all files at the users under some necessary constraints. ...
arXiv:2012.14323v1
fatcat:27jcku6uezaczgffqevhzbedxu
Optimal Status Update for Age of Information Minimization with an Energy Harvesting Source
[article]
2018
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Other Versions
In this paper, we consider a scenario where an energy harvesting sensor continuously monitors a system and sends time-stamped status updates to a destination. ...
We use the metric Age of Information (AoI), the time that has elapsed since the last received update was generated, to measure the "freshness" of the status information available at the destination. ...
An offline policy to miminimize AoI in a two-hop relay channel is studied in [45] . ...
arXiv:1706.05773v3
fatcat:devzgrimjnb73ckzuy2gs7klla
Single Threshold Packet Scheduling Policy for AoI Minimization in Resource-Constrained Network
[article]
2022
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf.
Furthermore, we show that the proposed policy reduces to the optimal policies under special settings and achieves close-to-optimal performance under general settings. ...
Specifically, we model the resource-constrained AoI minimization problem as a constrained Markov decision process (CMDP) and propose a low-complexity single threshold packet scheduling policy for it. ...
In this paper, we derive a lower bound on the AoI under a given resource constraint and propose a low-complexity single threshold policy, which allows us to have a near optimal solution to problem P0 in ...
arXiv:2206.12550v1
fatcat:kande3ttsjfgbd6vnhko3rnmw4
Managing Congestion Control in Mobile AD-HOC Network Using Mobile Agents
[article]
2014
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
When mobile agent travels through the network, it can select a less-loaded neighbor node as its next hop and update the routing table according to the node congestion status. ...
In mobile adhoc networks, congestion occurs with limited resources. The standard TCP congestion control mechanism is not able to handle the special properties of a shared wireless channel. ...
Yung Yi et al [4] have evolved a fair hop-by-hop congestion control algorithm with the MAC constraint being imposed in the form of a channel access time constraint, using an optimization-based model. ...
arXiv:1401.4844v1
fatcat:q4dwqqh5tnal5kydrdgfp3hnri
Internet of Things: The Optimal Generation Rates under Preemption Strategy in a Multi-Source Queuing System
2021
Entropy
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL.
The file type is application/pdf.
In view of this, we focus on the multi-source preemptive queuing model and investigate how to control the generation rate of each source to achieve the optimal overall information freshness. ...
Additionally, we also derive a closed-form approximate optimal solution under light load cases to meet the demands for rapid deployment. ...
The authors of [21] investigated the distribution of AoI in a wireless networked control system with two hops-based on which, the authors minimized the tail of the AoI distribution respect to the frequency ...
doi:10.3390/e23081055
fatcat:rne66ztuuzanbaaw3la6u6jkqy
Energy-Optimized Content Refreshing of Age-of-Information-Aware Edge Caches in IoT Systems
2022
Future Internet
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf.
of status updates. ...
In this work, we propose a model-driven and AoI-aware optimization scheme for information caching at the network edge. ...
In [18] Akar et al. propose a discrete-time queueing model to derive the distributions of AoI and Peak AoI in multisource IoT-based status update systems under the assumption of Bernoulli information ...
doi:10.3390/fi14070197
fatcat:342heus2gzg3tmqn63md2n3hry
« Previous
Showing results 1 — 15 out of 2,256 results