University of Oulu

M. Moltafet, M. Leinonen and M. Codreanu, "Moment Generating Function of the AoI in Multi-Source Systems with Computation-Intensive Status Updates," 2021 IEEE Information Theory Workshop (ITW), 2021, pp. 1-6, doi: 10.1109/ITW48936.2021.9611498

Moment generating function of the AoI in multi-source systems with computation-intensive status updates

Saved in:
Author: Moltafet, Mohammad1; Leinonen, Markus1; Codreanu, Marian2
Organizations: 1Centre for Wireless Communications – Radio Technologies University of Oulu, Finland
2Department of Science and Technology Linköping University, Sweden
Format: article
Version: accepted version
Access: open
Online Access: PDF Full Text (PDF, 0.4 MB)
Persistent link: http://urn.fi/urn:nbn:fi-fe2021121060139
Language: English
Published: Institute of Electrical and Electronics Engineers, 2021
Publish Date: 2021-12-10
Description:

Abstract

We consider a multi-source status update system in which status updates are transmitted as packets containing the measured value of the monitored process and a time stamp representing the time when the sample was generated. The packets of each source are generated according to a Poisson process and served according to an exponentially distributed service time. We assume that the received status update packets need further processing before being used (hence, computation intensive). This is mathematically modeled by an additional server at the sink. The sink server serves the packets according to an exponentially distributed service time. We introduce two packet management policies, a preemptive policy and a blocking policy, and derive the moment generating function (MGF) of the AoI of each source under the both policies. In the both policies, the system can contain at most two packets, one at the transmitter server and one at the sink server. In the preemptive policy, a new arriving packet preempts any possible packet that is currently under service regardless of the packet’s source index. In the blocking policy, when a server is busy at the arrival instant of a packet, the arriving packet is blocked and cleared. We assume that the same preemptive/blocking policy is employed in both the transmitter and sink server. Numerical results are provided to assess the results.

see all

ISBN: 978-1-6654-0312-2
ISBN Print: 978-1-6654-3137-8
DOI: 10.1109/ITW48936.2021.9611498
OADOI: https://oadoi.org/10.1109/ITW48936.2021.9611498
Host publication: 2021 IEEE Information Theory Workshop (ITW)
Conference: IEEE Information Theory Workshop
Type of Publication: A4 Article in conference proceedings
Field of Science: 213 Electronic, automation and communications engineering, electronics
Subjects:
Funding: This research has been financially supported by the Infotech Oulu, the Academy of Finland (grant 323698), and Academy of Finland 6Genesis Flagship (grant 318927). The work of M. Leinonen has also been financially supported in part by the Academy of Finland (grant 319485).
Academy of Finland Grant Number: 318927
319485
323698
Detailed Information: 318927 (Academy of Finland Funding decision)
319485 (Academy of Finland Funding decision)
323698 (Academy of Finland Funding decision)
Copyright information: © 2021 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.