Academia.eduAcademia.edu

Outline

Title
Abstract
Introduction
Average Age Analysis
Optimal Codeword Design
Numerical Results
Conclusions
References
All Topics
Computer Science

Optimal Selective Encoding for Timely Updates with Empty Symbol

Profile image of Baturalp BuyukatesBaturalp Buyukates

2020, 2020 IEEE International Symposium on Information Theory (ISIT)

https://doi.org/10.1109/ISIT44484.2020.9174312
visibility

…

description

6 pages

link

1 file

Abstract

An information source generates independent and identically distributed status update messages from an observed random phenomenon which takes n distinct values based on a given pmf. These update packets are encoded at the transmitter to be sent to a receiver which wants to track the observed random variable with as little age as possible. The transmitter implements a selective k encoding policy such that rather than encoding all possible n realizations, the transmitter encodes the most probable k realizations and sends a designated empty symbol when one of the remaining n−k realizations occurs. We consider two scenarios: when the empty symbol does not reset the age and when the empty symbol resets the age. We find the time average age of information and the age-optimal real codeword lengths, including the codeword length for the empty symbol, for both of these scenarios. Through numerical evaluations for arbitrary pmfs, we show that this selective encoding policy yields a lower age ...

Related papers

On Minimizing the Maximum Age-of-Information For Wireless Erasure Channels
Arunabh Srivastava

2019 International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOPT), 2019

Age-of-Information (AoI) is a recently proposed metric for quantifying the freshness of information from the UE's perspective in a communication network. Recently, Kadota et al. [1] have proposed an index-type approximately optimal scheduling policy for minimizing the average-AoI metric for a downlink transmission problem. For delay-sensitive applications, including real-time control of a cyber-physical system, or scheduling URLLC traffic in 5G, it is essential to have a more stringent uniform control on AoI across all users. In this paper, we derive an exactly optimal scheduling policy for this problem in a downlink cellular system with erasure channels. Our proof of optimality involves an explicit solution to the associated average-cost Bellman Equation, which might be of independent theoretical interest. We also establish that the resulting Ageprocess is positive recurrent under the optimal policy, and has an exponentially light tail, with the optimal large-deviation exponent. Finally, motivated by typical applications in smallcell residential networks, we consider the problem of minimizing the peak-AoI with throughput constraints to specific UEs, and derive a heuristic policy for this problem. Extensive numerical simulations have been carried out to compare the efficacy of the proposed policies with other well-known scheduling policies, such as Randomized scheduling and Proportional Fair.

View PDFchevron_right
Version Age of Information Minimization over Fading Broadcast Channels
Hrishikesh pable

arXiv (Cornell University), 2023

We consider a base station (BS) that receives version update packets from multiple exogenous streams and broadcasts them to corresponding users over a fading broadcast channel using a non-orthogonal multiple access (NOMA) scheme. Sequentially indexed packets arrive randomly in each stream, with new packets making the previous ones obsolete. In this case, we consider the version age of information (VAoI) at a user, defined as the difference in the version index of the latest available packet at the BS and that at the user, as a metric of freshness of information. Our objective is to minimize a weighted sum of average VAoI across users subject to an average power constraint at the BS by optimally scheduling the update packets from various streams for transmission and transmitting them with sufficient powers to guarantee their successful delivery. We consider the class of channel-only stationary randomized policies (CO-SRP), which rely solely on channel power gains for transmission decisions. We solve the resulting non-convex problem optimally and show that the VAoI achieved under the optimal CO-SRP is within twice the optimal achievable VAoI. We also obtained a Constrained Markov Decision Process (CMDP)-based solution and its structural properties. Numerical simulations show a close performance between the optimal CO-SRP and CMDP-based solutions. Additionally, a time division multiple access (TDMA) scheme, which allows transmission to at most one user at a time, matches NOMA's performance under tight average power constraints. However, NOMA outperforms TDMA as the constraint is relaxed.

View PDFchevron_right
Age of Information in Wireless Networks
Elif Tugce Ceran

2021

Age of information (AoI) is a recently introduced metric that measures the freshness of status updates in monitoring applications and update-based systems. In this thesis, we investigate a wireless communication system in which the status updates of the underlying process of interest can be sampled at any time by the source node, and are transmitted to a destination node over an error-prone communication channel under transmission constraints. More specifically, we study the scheduling of sampling and transmission of status updates in order to minimize the long-term average AoI at the destination for under a constraint on the average number of transmissions, or under energy replenishment constraints at the source. After each transmission, the source receives an instantaneous ACK/NACK feedback, and judiciously decides on the next update, without prior knowledge on the success of future transmissions. The optimal scheduling policy and its structure are studied under different feedback...

View PDFchevron_right
A Min-plus Model of Age-of-Information with Worst-case and Statistical Bounds
mahsa noroozi

ICC 2022 - IEEE International Conference on Communications

We consider networked sources that generate update messages with a defined rate and we investigate the age of that information at the receiver. Typical applications are in cyberphysical systems that depend on timely sensor updates. We phrase the age of information in the min-plus algebra of the network calculus. This facilitates a variety of models including wireless channels and schedulers with random cross-traffic, as well as sources with periodic and random updates, respectively. We show how the age of information depends on the network service where, e.g., outages of a wireless channel cause delays. Further, our analytical expressions show two regimes depending on the update rate, where the age of information is either dominated by congestive delays or by idle waiting. We find that the optimal update rate strikes a balance between these two effects.

View PDFchevron_right
Universal Decoding With an Erasure Option
Meir Feder

2007 IEEE International Symposium on Information Theory, 2007

Motivated by applications of rateless coding, decision feedback, and ARQ, we study the problem of universal decoding for unknown channels, in the presence of an erasure option. Specifically, we harness the competitive minimax methodology developed in earlier studies, in order to derive a universal version of Forney's classical erasure/list decoder, which in the erasure case, optimally trades off between the probability of erasure and the probability of undetected error. The proposed universal erasure decoder guarantees universal achievability of a certain fraction ξ of the optimum error exponents of these probabilities (in a sense to be made precise in the sequel). A single-letter expression for ξ, which depends solely on the coding rate and the threshold, is provided. The example of the binary symmetric channel is studied in full detail, and some conclusions are drawn. ].

View PDFchevron_right
Age of Information in Uncoordinated Unslotted Updating
Sanjit Kaul

2020 IEEE International Symposium on Information Theory (ISIT)

Sensor sources submit updates to a monitor through an unslotted, uncoordinated, unreliable multiple access collision channel. The channel is unreliable; a collision-free transmission is received successfully at the monitor with some transmission success probability. For an infinite-user model in which the sensors collectively transmit updates as a Poisson process and each update has an independent exponential transmission time, a stochastic hybrid system (SHS) approach is used to derive the average age of information (AoI) as a function of the offered load and the transmission success probability. The analysis is then extended to evaluate the individual age of a selected source. When the number of sources and update transmission rate grow large in fixed proportion, the limiting asymptotic individual age is shown to provide an accurate individual age approximation for a small number of sources.

View PDFchevron_right
On Timely Channel Coding with Hybrid ARQ
Karim Banawan

2019 IEEE Global Communications Conference (GLOBECOM)

A status updating communication system is examined, in which a transmitter communicates with a receiver over a noisy channel. The goal is to realize timely delivery of fresh data over time, which is assessed by an age-of-information (AoI) metric. Channel coding is used to combat the channel errors, and feedback is sent to acknowledge updates' reception. In case decoding is unsuccessful, a hybrid ARQ protocol is employed, in which incremental redundancy (IR) bits are transmitted to enhance the decoding ability. This continues for some amount of time in case decoding remains unsuccessful, after which a new (fresh) status update is transmitted instead. In case decoding is successful, the transmitter has the option to idly wait for a certain amount of time before sending a new update. A general problem is formulated that optimizes the codeword and IR lengths for each update, and the waiting times, such that the long term average AoI is minimized. Stationary deterministic policies are investigated, in which the codeword and IR lengths are fixed for each update, and the waiting time is a deterministic function of the AoI. The optimal waiting policy is then derived, and is shown to have a threshold structure, in which the transmitter sends a new update only if the AoI grows above a certain threshold that is a function of the codeword and IR lengths. Choosing the codeword and IR lengths is discussed in the context of binary symmetric channels.

View PDFchevron_right
Near Optimal Update-Broadcast of Datasets
Sachin Agarwal

International Workshop on …, 2007

View PDFchevron_right
Delay and Peak-Age Violation Probability in Short-Packet Transmissions
Elif Uysal-Biyikoglu

2018 IEEE International Symposium on Information Theory (ISIT), 2018

This paper investigates the distribution of delay and peak age of information in a communication system where packets, generated according to an independent and identically distributed Bernoulli process, are placed in a single-server queue with firstcome first-served discipline and transmitted over an additive white Gaussian noise (AWGN) channel. When a packet is correctly decoded, the sender receives an instantaneous error-free positive acknowledgment, upon which it removes the packet from the buffer. In the case of negative acknowledgment, the packet is retransmitted. By leveraging finite-blocklength results for the AWGN channel, we characterize the delay violation and the peak-age violation probability without resorting to approximations based on large deviation theory as in previous literature. Our analysis reveals that there exists an optimum blocklength that minimizes the delay violation and the peak-age violation probabilities. We also show that one can find two blocklength values that result in very similar average delay but significantly different delay violation probabilities. This highlights the importance of focusing on violation probabilities rather than on averages. Index Terms-Delay, finite blocklength, age of information, queuing.

View PDFchevron_right
Age of Information in an URLLC-enabled Decode-and-Forward Wireless Communication System
Chathuranga Basnayaka

ArXiv, 2021

Age of Information (AoI) measures the freshness of data in mission critical Internet-of-Things (IoT) applications i.e., industrial internet, intelligent transportation systems etc. In this paper, a new system model is proposed to estimate the average AoI (AAoI) in an ultra-reliable low latency communication (URLLC) enabled wireless communication system with decodeand- forward relay scheme over the quasi-static Rayleigh block fading channels. Short packet communication scheme is used to meet both reliability and latency requirements of the proposed wireless network. By resorting finite block length information theory, queuing theory and stochastic processes, a closed-form expression for AAoI is obtained. Finally, the impact of the system parameters, such as update generation rate, block length and block length allocation factor on the AAoI are investigated. All results are validated by the numerical results.

View PDFchevron_right

References (57)

  1. S. K. Kaul, R. D. Yates, and M. Gruteser. Real-time status: How often should one update? In IEEE Infocom, March 2012.
  2. M. Costa, M. Codrenau, and A. Ephremides. Age of information with packet management. In IEEE ISIT, June 2014.
  3. A. M. Bedewy, Y. Sun, and N. B. Shroff. Optimizing data freshness, throughput, and delay in multi-server information-update systems. In IEEE ISIT, July 2016.
  4. Q. He, D. Yuan, and A. Ephremides. Optimizing freshness of informa- tion: On minimum age link scheduling in wireless systems. In IEEE WiOpt, May 2016.
  5. C. Kam, S. Kompella, G. D. Nguyen, Wieselthier J. E., and A. Ephremides. Age of information with a packet deadline. In IEEE ISIT, July 2016.
  6. Y. Sun, E. Uysal-Biyikoglu, R. D. Yates, C. E. Koksal, and N. B. Shroff. Update or wait: How to keep your data fresh. IEEE Transactions on Information Theory, 63(11):7492-7508, November 2017.
  7. E. Najm and E. Telatar. Status updates in a multi-stream M/G/1/1 preemptive queue. In IEEE Infocom, April 2018.
  8. E. Najm, R. D. Yates, and E. Soljanin. Status updates through M/G/1/1 queues with HARQ. In IEEE ISIT, June 2017.
  9. A. Soysal and S. Ulukus. Age of information in G/G/1/1 systems. In Asilomar Conference, November 2019.
  10. A. Soysal and S. Ulukus. Age of information in G/G/1/1 systems: Age expressions, bounds, special cases, and optimization. May 2019. Available on arXiv: 1905.13743.
  11. R. D. Yates, P. Ciblat, A. Yener, and M. Wigger. Age-optimal constrained cache updating. In IEEE ISIT, June 2017.
  12. H. Tang, P. Ciblat, J. Wang, M. Wigger, and R. D. Yates. Age of information aware cache updating with file-and age-dependent update durations. September 2019. Available on arXiv: 1909.05930.
  13. S. Nath, J. Wu, and J. Yang. Optimizing age-of-information and energy efficiency tradeoff for mobile pushing notifications. In IEEE SPAWC, July 2017.
  14. Y. Hsu. Age of information: Whittle index for scheduling stochastic arrivals. In IEEE ISIT, June 2018.
  15. I. Kadota, A. Sinha, E. Uysal-Biyikoglu, R. Singh, and E. Modiano. Scheduling policies for minimizing age of information in broadcast wireless networks. IEEE/ACM Transactions on Networking, 26(6):2637- 2650, December 2018.
  16. B. Buyukates, A. Soysal, and S. Ulukus. Age of information scaling in large networks. In IEEE ICC, May 2019.
  17. J. Gong, Q. Kuang, X. Chen, and X. Ma. Reducing age-of-information for computation-intensive messages via packet replacement. In IEEE WCSP, October 2019.
  18. B. Buyukates and S. Ulukus. Timely distributed computation with stragglers. October 2019. Available on arXiv: 1910.03564.
  19. A. Arafa, K. Banawan, K. G. Seddik, and H. V. Poor. On timely channel coding with hybrid ARQ. In IEEE Globecom, December 2019.
  20. Y. Sun, Y. Polyanskiy, and E. Uysal-Biyikoglu. Remote estimation of the Wiener process over a channel with random delay. In IEEE ISIT, June 2017.
  21. Y. Sun and B. Cyr. Information aging through queues: A mutual information perspective. In IEEE SPAWC, June 2018.
  22. J. Chakravorty and A. Mahajan. Remote estimation over a packet-drop channel with Markovian state. IEEE Transactions on Automatic Control, 65(5):2016-2031, May 2020.
  23. M. Bastopcu and S. Ulukus. Age of information for updates with distortion. In IEEE ITW, August 2019.
  24. M. Bastopcu and S. Ulukus. Age of information for updates with distortion: Constant and age-dependent distortion constraints. December 2019. Available on arXiv:1912.13493.
  25. D. Ramirez, E. Erkip, and H. V. Poor. Age of information with finite horizon and partial updates. In IEEE ICASSP, May 2020.
  26. P. Zou, O. Ozel, and S. Subramaniam. Trading off computation with transmission in status update systems. In IEEE PIMRC, September 2019.
  27. A. Kosta, N. Pappas, A. Ephremides, and V. Angelakis. Age and value of information: Non-linear age case. In IEEE ISIT, June 2017.
  28. M. Bastopcu and S. Ulukus. Minimizing age of information with soft updates. Journal of Communications and Networks, 21(3):233-243, June 2019.
  29. A. Arafa and S. Ulukus. Age minimization in energy harvesting communications: Energy-controlled delays. In Asilomar Conference, October 2017.
  30. A. Arafa and S. Ulukus. Age-minimal transmission in energy harvesting two-hop networks. In IEEE Globecom, December 2017.
  31. X. Wu, J. Yang, and J. Wu. Optimal status update for age of information minimization with an energy harvesting source. IEEE Transactions on Green Communications and Networking, 2(1):193-204, March 2018.
  32. A. Arafa, J. Yang, and S. Ulukus. Age-minimal online policies for energy harvesting sensors with random battery recharges. In IEEE ICC, May 2018.
  33. A. Arafa, J. Yang, S. Ulukus, and H. V. Poor. Age-minimal online poli- cies for energy harvesting sensors with incremental battery recharges. In UCSD ITA, February 2018.
  34. A. Arafa, J. Yang, S. Ulukus, and H. V. Poor. Online timely status updates with erasures for energy harvesting sensors. In Allerton Conference, October 2018.
  35. A. Arafa, J. Yang, S. Ulukus, and H. V. Poor. Using erasure feedback for online timely updating with an energy harvesting sensor. In IEEE ISIT, July 2019.
  36. S. Farazi, A. G. Klein, and D. R. Brown III. Average age of information for status update systems with an energy harvesting server. In IEEE Infocom, April 2018.
  37. S. Leng and A. Yener. Age of information minimization for an energy harvesting cognitive radio. IEEE Transactions on Cognitive Communications and Networking, 5(2):427-439, May 2019.
  38. Z. Chen, N. Pappas, E. Bjornson, and E. G. Larsson. Age of information in a multiple access channel with heterogeneous traffic and an energy harvesting node. In IEEE Infocom, April 2019.
  39. M. A. Abd-Elmagid and H. S. Dhillon. Average peak age-of-information minimization in UAV-assisted IoT networks. IEEE Transactions on Vehicular Technology, 68(2):2003-2008, February 2019.
  40. J. Liu, X. Wang, and H. Dai. Age-optimal trajectory planning for UAV- assisted data collection. In IEEE Infocom, April 2018.
  41. E. T. Ceran, D. Gunduz, and A. Gyorgy. A reinforcement learning approach to age of information in multi-user networks. In IEEE PIMRC, September 2018.
  42. H. B. Beytur and E. Uysal-Biyikoglu. Age minimization of multiple flows using reinforcement learning. In IEEE ICNC, February 2019.
  43. M. A. Abd-Elmagid, H. S. Dhillon, and N. Pappas. A reinforcement learning framework for optimizing age-of-information in RF-powered communication systems. August 2019. Available on arXiv: 1908.06367.
  44. P. Mayekar, P. Parag, and H. Tyagi. Optimal lossless source codes for timely updates. In IEEE ISIT, June 2018.
  45. J. Zhong and R. D. Yates. Timeliness in lossless block coding. In IEEE DCC, March 2016.
  46. J. Zhong, R. D. Yates, and E. Soljanin. Timely lossless source coding for randomly arriving symbols. In IEEE ITW, November 2018.
  47. M. Bastopcu, B. Buyukates, and S. Ulukus. Optimal selective encoding for timely updates. In CISS, March 2020.
  48. J. Zhong, E. Soljanin, and R. D. Yates. Status updates through multicast networks. In Allerton Conference, October 2017.
  49. J. Zhong, R. D. Yates, and E. Soljanin. Multicast with prioritized delivery: How fresh is your data? In IEEE SPAWC, June 2018.
  50. B. Buyukates, A. Soysal, and S. Ulukus. Age of information in two-hop multicast networks. In Asilomar Conference, October 2018.
  51. B. Buyukates, A. Soysal, and S. Ulukus. Age of information in multihop multicast networks. Journal of Communications and Networks, 21(3):256-267, July 2019.
  52. B. Buyukates, A. Soysal, and S. Ulukus. Age of information in multicast networks with multiple update streams. In Asilomar Conference, November 2019.
  53. T. M. Cover and J. A. Thomas. Elements of information theory. Wiley Press, 2012.
  54. W. Dinkelbach. On nonlinear fractional programming. Management Science, 13(7):435-607, March 1967.
  55. S. P. Boyd and L. Vandenberghe. Convex Optimization. Cambridge University Press, 2004.
  56. R. M. Corless, G. H. Gonnet, D. E. G. Hare, D. J. Jeffrey, and D. E. Knuth. On the Lambert W function. Advances in Computational Mathematics, 5(1):329-359, December 1996.
  57. M. Bastopcu and S. Ulukus. Partial updates: Losing information for freshness. In IEEE ISIT, June 2020.

Related papers

Optimal Selective Encoding for Timely Updates
Baturalp Buyukates

2020

We consider a system in which an information source generates independent and identically distributed status update packets from an observed phenomenon that takes n possible values based on a given pmf. These update packets are encoded at the transmitter node to be sent to the receiver node. Instead of encoding all n possible realizations, the transmitter node only encodes the most probable k realizations and disregards whenever a realization from the remaining n−k values occurs. We find the average age and determine the age-optimal real codeword lengths such that the average age at the receiver node is minimized. Through numerical evaluations for arbitrary pmfs, we show that this selective encoding policy results in a lower average age than encoding every realization and find the age-optimal k. We also analyze a randomized selective encoding policy in which the remaining n−k realizations are encoded and sent with a certain probability to further inform the receiver at the expense o...

View PDFchevron_right
Timely Lossless Source Coding for Randomly Arriving Symbols
Emina Soljanin

2018 IEEE Information Theory Workshop (ITW), 2018

We consider a real-time streaming source coding system in which an encoder observes a sequence of randomly arriving symbols from an i.i.d. source, and feeds binary codewords to a FIFO buffer that outputs one bit per time unit to a decoder. Each source symbol represents a status update by the source, and the timeliness of the system is quantified by the age of information (AoI), defined as the time difference between the present time and the generation time of the most up-to-date symbol at the output of the decoder. When the FIFO buffer is allowed to be empty, we propose an optimal prefix-free lossless coding scheme that minimizes the average peak age based on the analysis of discrete-time Geo/G/1 queue. For more practical scenarios in which a special codeword is reserved for indicating an empty buffer, we propose an encoding scheme that assigns a codeword to the empty buffer state based on an estimate of the buffer idle time.

View PDFchevron_right
The Age of Information of Short-Packet Communications: Joint or Distributed Encoding?
Nan Yang

ICC 2022 - IEEE International Conference on Communications

In this paper, we analyze the impact of different encoding schemes on the age of information (AoI) performance in a point-to-point system, where a source generates packets based on the status updates collected from multiple sensors and transmits the packets to a destination. In this system, we consider two encoding schemes, namely, the joint encoding scheme and the distributed encoding scheme. In the joint encoding scheme, the status updates from all the sensors are jointly encoded into a packet for transmission. In the distributed encoding scheme, the status update from each sensor is encoded individually and the sensors' packets are transmitted following the round robin policy. To ensure the freshness of packets, the zero-wait policy is adopted in both schemes, where a new packet is immediately generated once the source finishes the transmission of the current packet. We derive closed-form expressions for the average AoI achieved by these two encoding schemes and compare their performances. Simulation results show that the distributed encoding scheme is more appropriate for systems with a relatively large number of sensors, compared with the joint encoding scheme. Index Terms-Age of information, short packet communications, low latency communications, encoding scheme.

View PDFchevron_right
Timely updates over an erasure channel
Emina Soljanin

2017 IEEE International Symposium on Information Theory (ISIT), 2017

Using an age of information (AoI) metric, we examine the transmission of coded updates through a binary erasure channel to a monitor/receiver. We start by deriving the average status update age of an infinite incremental redundancy (IIR) system in which the transmission of a k-symbol update continues until k symbols are received. This system is then compared to a fixed redundancy (FR) system in which each update is transmitted as an n symbol packet and the packet is successfully received if and only if at least k symbols are received. If fewer than k symbols are received, the update is discarded. Unlike the IIR system, the FR system requires no feedback from the receiver. For a single monitor system, we show that tuning the redundancy to the symbol erasure rate enables the FR system to perform as well as the IIR system. As the number of monitors is increased, the FR system outperforms the IIR system that guarantees delivery of all updates to all monitors.

View PDFchevron_right
Probability of complete decoding of random codes for short messages
Bryan Ng

Electronics Letters, 2015

View PDFchevron_right

Related topics

  • Computer Science
    • 580 California St., Suite 400
    San Francisco, CA, 94104
    © 2025 Academia. All rights reserved