Age of Information (AoI) is a metric often used to represent the freshness of the information exchanged between a sensing source and a receiver. We consider a system where these two nodes are connected through an error-prone time-slotted channel, and a relay node is also present to assist the transmission. We consider both the sensor and the relay as intermittently and independently active nodes, whose activity rate may be adjusted, resulting in different levels of freshness and corresponding energy costs. To this end, the activity pattern can either follow a Bernoulli random process or a periodic duty cycle with adjustable duration. After computing the expected AoI and the complete Peak Age of Information (PAoI) distribution for both cases, we consider a fully distributed game theoretic duty cycle optimization, in which the two nodes independently tune their own activity rate, finding a balance between freshness and cost. The equilibrium of the resulting game is found to be both efficient from the perspective of the resulting performance and computationally lightweight for a distributed robust control implementation.

Strategic Age of Information Aware Interaction Over a Relay Channel

Chiariotti, Federico
;
Badia, Leonardo
2024

Abstract

Age of Information (AoI) is a metric often used to represent the freshness of the information exchanged between a sensing source and a receiver. We consider a system where these two nodes are connected through an error-prone time-slotted channel, and a relay node is also present to assist the transmission. We consider both the sensor and the relay as intermittently and independently active nodes, whose activity rate may be adjusted, resulting in different levels of freshness and corresponding energy costs. To this end, the activity pattern can either follow a Bernoulli random process or a periodic duty cycle with adjustable duration. After computing the expected AoI and the complete Peak Age of Information (PAoI) distribution for both cases, we consider a fully distributed game theoretic duty cycle optimization, in which the two nodes independently tune their own activity rate, finding a balance between freshness and cost. The equilibrium of the resulting game is found to be both efficient from the perspective of the resulting performance and computationally lightweight for a distributed robust control implementation.
File in questo prodotto:
File Dimensione Formato  
2024_TCOM.pdf

accesso aperto

Tipologia: Published (publisher's version)
Licenza: Creative commons
Dimensione 1.99 MB
Formato Adobe PDF
1.99 MB Adobe PDF Visualizza/Apri
Pubblicazioni consigliate

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/11577/3503848
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 0
  • ???jsp.display-item.citation.isi??? ND
social impact