Age of Information in CSMA-Based Networks With Bursty Update Traffic

Exchanging status information between closely located mobile agents is an underlying process in numerous future Cyber Physical System (CPS). Real-time updates including positions of neighboring nodes is performed when, for example, autonomous vehicles execute a cooperative maneuver, industrial robot...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:IEEE access 2022, Vol.10, p.44088-44105
Hauptverfasser: Baiocchi, Andrea, Turcanu, Ion, Vinel, Alexey
Format: Artikel
Sprache:eng
Schlagworte:
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:Exchanging status information between closely located mobile agents is an underlying process in numerous future Cyber Physical System (CPS). Real-time updates including positions of neighboring nodes is performed when, for example, autonomous vehicles execute a cooperative maneuver, industrial robots collaborate with each other on a task, or Unmanned Aerial Vehicles (UAVs) execute a mission in a swarm. For the design of networked automatic control strategies in these scenarios, it is essential to understand the performance of such Machine-to-Machine (M2M) communications from the information freshness perspective. To this end, we introduce a mathematical framework which allows characterizing the Age of Information (AoI) in networks governed by the Carrier-Sense Multiple Access (CSMA) protocol. Differently from existing work, we take into account the fact that update packets sent by mobile nodes are not necessarily periodic, since packet triggering is often coupled with agents' mobility. Our approach is based on the assumption that diverse mobility-triggered message generation patterns can be modeled by a wide class of update traffic arrival processes. We apply Discrete Markovian Arrival Process (DMAP), which is a versatile arrival model able to fit arrival patterns that are modulated by a finite state machine, including bursty traffic. We develop an accurate and efficient analytical model of nodes exchanging one-hop broadcast update messages with bursty arrivals to evaluate the moments as well as entire probability distribution of several performance metrics, including AoI. An asymptotic analysis for large networks suggests a simple way to control the update message rate to minimize the AoI. We show that the optimal update rate that minimizes the mean AoI coincides with the optimum of the wireless channel utilization. Numerical examples point out that the asymptotic theory provides accurate predictions also for small values of the number of nodes.
ISSN:2169-3536
2169-3536
DOI:10.1109/ACCESS.2022.3168321