Age of Information for Updates With Distortion: Constant and Age-Dependent Distortion Constraints
نویسندگان
چکیده
We consider an information update system where receiver requests updates from provider in order to minimize its age of information. The are generated at the (transmitter) as a result completing set tasks such collecting data and performing computations on them. refer this generation process. model quality increasing function processing time spent while generating transmitter. In particular, we use xmlns:xlink="http://www.w3.org/1999/xlink">distortion proxy for , distortion decreasing time. Processing longer transmitter results better quality (lower distortion) update, but it causes determine age-optimal policies request times subject minimum required (maximum allowed constraint updates. For constraint, cases constant maximum constraints, well age-dependent constraints.
منابع مشابه
Information-Theoretic Privacy with General Distortion Constraints
The privacy-utility tradeoff problem is formulated as determining the privacy mechanism (random mapping) that minimizes the mutual information (a metric for privacy leakage) between the private features of the original dataset and a released version. The minimization is studied with two types of constraints on the distortion between the public features and the released version of the dataset: (...
متن کاملOn Authentication With Distortion Constraints
In many multimedia applications, there is a need to authenticate sources subjected to benign degradations such as noise, compression, etc., in addition to potential tampering attacks. Authentication can be enabled through the embedding of suitably chosen markings in the original signal. We develop one information-theoretic formulation of this problem, and identify and interpret the associated f...
متن کاملOn Notions of Distortion and an Almost Minimum Spanning Tree with Constant Average Distortion
Minimum Spanning Trees of weighted graphs are fundamental objects in numerous applications. In particular in distributed networks, the minimum spanning tree of the network is often used to route messages between network nodes. Unfortunately, while being most efficient in the total cost of connecting all nodes, minimum spanning trees fail miserably in the desired property of approximately preser...
متن کاملAge-Optimal Updates of Multiple Information Flows
In this paper, we study an age of information minimization problem, where multiple flows of update packets are sent over multiple servers to their destinations. Two online scheduling policies are proposed. When the packet generation and arrival times are synchronized across the flows, the proposed policies are shown to be (near) optimal for minimizing any timedependent, symmetric, and non-decre...
متن کاملOn source coding with side-information-dependent distortion measures
High-resolution bounds in lossy coding of a real memoryless source are considered when side information is present. Let be a “smooth” source and let be the side information. First we treat the case when both the encoder and the decoder have access to and we establish an asymptotically tight (high-resolution) formula for the conditional rate-distortion function ( ) for a class of locally quadrat...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE ACM Transactions on Networking
سال: 2021
ISSN: ['1063-6692', '1558-2566']
DOI: https://doi.org/10.1109/tnet.2021.3091493