Age-of-Information in the Presence of Error

2016/05/02 by Kun Chen, Longbo Huang, Chen, Kun +1 · 2 citations
Computer Science · Medicine · Engineering · #Age of Information Optimization #Congenital Heart Disease Studies #IoT Networks and Protocols

paper · pdf · doi:10.48550/arxiv.1605.00559

Abstract

We consider the peak age-of-information (PAoI) in an M/M/1 queueing system with packet delivery error, i.e., update packets can get lost during transmissions to their destination. We focus on two types of policies, one is to adopt Last-Come-First-Served (LCFS) scheduling, and the other is to utilize retransmissions, i.e., keep transmitting the most recent packet. Both policies can effectively avoid the queueing delay of a busy channel and ensure a small PAoI. Exact PAoI expressions under both policies with different error probabilities are derived, including First-Come-First-Served (FCFS), LCFS with preemptive priority, LCFS with non-preemptive priority, Retransmission with preemptive priority, and Retransmission with non-preemptive priority. Numerical results obtained from analysis and simulation are presented to validate our results.

Cited by

• Balancing Timeliness and Privacy in Discrete-Time Updating Systems
• The Age of Information in Multihop Networks

Related

• On the Age of Information in Single-Server Queues with Aged Updates
• The Age of Information in a Discrete Time Queue: Stationary Distribution and Non-linear Age Mean Analysis
• Peak Age of Information under Tandem of Queues
• On The Age Of Information In Status Update Systems With Packet\n Management
• Outage Analysis of Age-of-Information for Multi-Source Systems