pith. sign in

arxiv: 2604.13496 · v1 · submitted 2026-04-15 · 💻 cs.IT · math.IT

Age of Information Optimization in Distributed Sensor Networks with Half-Duplex Channels

Peng Zou , Ali Maatouk , Egemen Erbayat , Suresh Subramaniam This is my paper

Pith reviewed 2026-05-10 12:59 UTC · model grok-4.3

classification 💻 cs.IT math.IT
keywords age of informationALOHA protocolhalf-duplextransmission probabilityconvex optimizationdistributed sensor networksnetwork topology
0
0 comments X

The pith

Closed-form average Age of Information expressions enable optimal transmission probability policies for half-duplex ALOHA networks.

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

This paper derives closed-form expressions for the average Age of Information in a distributed multi-user network that uses an ALOHA-based protocol where users must alternate between transmit and receive modes under half-duplex constraints. It formulates an optimization problem over the users' transmission probabilities, proves that the problem is convex, and then uses the resulting optimality conditions to characterize optimal policies for arbitrary network graphs, obtain exact closed-form solutions for d-regular topologies, and derive tractable conditions for star topologies. A sympathetic reader would care because information freshness directly affects the quality of decisions in cooperative sensor networks, and the closed-form results make it possible to compute user-specific probabilities without solving large numerical programs for each topology.

Core claim

By modeling the network as an ALOHA-based protocol under half-duplex constraints, we derive closed-form expressions for the average AoI. The resulting optimization problem over transmission probabilities is proven convex. Leveraging the optimality conditions, we characterize optimal policies for general network graphs, obtain closed-form solutions for d-regular topologies, and derive tractable optimality conditions for star topologies.

What carries the argument

Closed-form expression for average AoI written in terms of per-user transmission probabilities under independent success and standard interference assumptions, which becomes the objective of the convex optimization.

If this is right

  • Optimal transmission probabilities can be characterized for arbitrary network graphs using the derived optimality conditions.
  • Exact closed-form solutions for the optimal probabilities exist when the network is d-regular.
  • Tractable optimality conditions suffice to determine the best probabilities in star topologies.
  • Numerical evaluation confirms that the mechanism adaptively selects user-specific probabilities across different topologies.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

  • The same convexity argument could be reused if the half-duplex constraint is replaced by a different duty-cycle model, provided the success probability expressions remain differentiable.
  • In large networks the per-user optimization could be approximated by a mean-field limit that depends only on the average degree rather than the full graph.
  • The framework may extend to other freshness metrics such as peak AoI by substituting the objective function while preserving convexity.

Load-bearing premise

Transmission success probabilities can be expressed in closed form from independent user decisions and standard interference assumptions in an ALOHA protocol with half-duplex constraints.

What would settle it

Direct measurement of long-run average AoI in a physical half-duplex ALOHA testbed whose values deviate substantially from the closed-form predictions for the same transmission probabilities would falsify the expressions.

Figures

Figures reproduced from arXiv: 2604.13496 by Ali Maatouk, Egemen Erbayat, Peng Zou, Suresh Subramaniam.

Figure 1
Figure 1. Figure 1: An illustration of data sharing structure. [PITH_FULL_IMAGE:figures/full_fig_p002_1.png] view at source ↗
Figure 3
Figure 3. Figure 3: Average AoI with respect to N for line topology with fixed p = 1. index i 1 2 3 4 5 6 7 N (Bi) 1 2 2 2 2 2 1 q ∗ i 0.36 0.35 0.34 0.34 0.34 0.35 0.36 TABLE I: Optimal q values for different indices for a line topology. Equation (21) is a univariate equation in q2 that can be solved numerically for a given N. Subsequently, q ∗ 1 can be obtained from (22). For N = 2, the network consists of a single link, an… view at source ↗
Figure 5
Figure 5. Figure 5: Four different asymmetric topologies. solution derived from CVX. However, as N becomes large, the difference becomes very small. This is because, for large N, the line topology can be approximated as a symmetric d￾regular graph. Additionally, in Table I, we list the optimal q for each node when N = 7, where N (Bi) denotes the number of neighbors for user i for a line topology. It can also be seen that the … view at source ↗
Figure 6
Figure 6. Figure 6: Normalized Average AoI for different asymmetric [PITH_FULL_IMAGE:figures/full_fig_p006_6.png] view at source ↗
read the original abstract

Motivated by cooperative distributed networks in which users dynamically alternate between transmit and receive modes under half-duplex constraints, this paper studies the Age of Information (AoI) in a distributed multi-user network using an ALOHA-based protocol. We derive closed-form expressions for the average AoI and formulate an optimization problem over transmission probabilities. After proving the convexity of the problem, we leverage the derived optimality conditions to characterize optimal policies for general network graphs, obtain closed-form solutions for $d$-regular topologies, and derive tractable optimality conditions for star topologies. Numerical results confirm that the proposed mechanism can effectively and adaptively determine user-specific optimal transmission probabilities across varying network topologies. These findings contribute to the design of adaptive and efficient distributed networks with enhanced information freshness.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Referee Report

0 major / 2 minor

Summary. The manuscript analyzes Age of Information (AoI) in distributed multi-user sensor networks operating under an ALOHA-based protocol with half-duplex constraints. It derives closed-form expressions for average AoI, formulates an optimization problem over transmission probabilities, proves convexity of the problem, characterizes optimal policies for general network graphs, obtains closed-form solutions for d-regular topologies, derives tractable optimality conditions for star topologies, and presents numerical results demonstrating adaptive determination of user-specific transmission probabilities across topologies.

Significance. If the closed-form derivations, convexity proof, and optimality characterizations hold, the work provides a meaningful contribution to AoI optimization in half-duplex cooperative networks by supplying analytical tools that enable efficient, topology-aware policy design. The explicit closed-form results for d-regular graphs and the convexity-based optimality conditions are particular strengths that support reproducibility and practical implementation in distributed sensor systems.

minor comments (2)
  1. The abstract states that the network is modeled as a graph with per-link success probabilities, but the precise interference model (e.g., how half-duplex mode affects simultaneous transmit/receive on adjacent links) is not restated in the introduction; adding a short clarifying sentence would improve readability for readers outside the immediate subfield.
  2. In the numerical results section, the simulation parameters (e.g., packet arrival rates, channel success probabilities, and network sizes) are described but not tabulated; a compact parameter table would aid reproducibility.

Simulated Author's Rebuttal

0 responses · 0 unresolved

We thank the referee for the positive review and the recommendation for minor revision. The referee's summary accurately reflects the contributions of our manuscript, including the closed-form AoI derivations, convexity proof, and optimality characterizations across network topologies under half-duplex ALOHA constraints.

Circularity Check

0 steps flagged

No significant circularity in derivation chain

full rationale

The paper models the distributed network using standard ALOHA protocol assumptions under half-duplex constraints, derives closed-form average AoI expressions directly from per-link success probabilities and transmission decisions, formulates the optimization over transmission probabilities, proves convexity via standard techniques, and obtains optimality characterizations for general graphs, d-regular topologies, and star graphs through the resulting conditions. No step reduces by construction to a fitted input, self-definition, or self-citation chain; the expressions and policies follow from first-principles probabilistic analysis without renaming known results or smuggling ansatzes. The derivation is self-contained against external benchmarks of stochastic modeling.

Axiom & Free-Parameter Ledger

0 free parameters · 1 axioms · 0 invented entities

The central claim rests on standard domain assumptions about slotted ALOHA success probabilities and half-duplex mode alternation; no free parameters or invented entities are introduced in the abstract.

axioms (1)
  • domain assumption Users independently transmit with probability p_i in a slotted ALOHA protocol under half-duplex constraints, with success probability determined by standard interference model.
    Invoked throughout the abstract as the basis for deriving average AoI expressions.

pith-pipeline@v0.9.0 · 5430 in / 1183 out tokens · 54967 ms · 2026-05-10T12:59:01.446917+00:00 · methodology

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Reference graph

Works this paper leans on

28 extracted references · 28 canonical work pages

  1. [1]

    Real-time status: How often should one update?,

    S. Kaul, R. Yates, and M. Gruteser, “Real-time status: How often should one update?,” in2012 Proceedings IEEE INFOCOM, pp. 2731–2735, 2012

    work page 2012

  2. [2]

    Information freshness in multihop wireless networks,

    V . Tripathi, R. Talak, and E. Modiano, “Information freshness in multihop wireless networks,”IEEE/ACM Transactions on Networking, vol. 31, no. 2, pp. 784–799, 2022

    work page 2022

  3. [3]

    Age-threshold slotted ALOHA for optimizing information freshness in mobile networks,

    F. Zhao, N. Pappas, C. Ma, X. Sun, T. Q. Quek, and H. H. Yang, “Age-threshold slotted ALOHA for optimizing information freshness in mobile networks,”IEEE Transactions on Wireless Communications, 2024

    work page 2024

  4. [4]

    Age of infor- mation optimization and state error analysis for correlated multi-process multi-sensor systems,

    E. Erbayat, A. Maatouk, P. Zou, and S. Subramaniam, “Age of infor- mation optimization and state error analysis for correlated multi-process multi-sensor systems,” inProceedings of the Twenty-fifth International Symposium on Theory, Algorithmic Foundations, and Protocol Design for Mobile Networks and Mobile Computing, pp. 331–340, 2024

    work page 2024

  5. [5]

    Minimizing age of information in spatially distributed random access wireless networks,

    N. Jones and E. Modiano, “Minimizing age of information in spatially distributed random access wireless networks,”IEEE Transactions on Networking, vol. 34, pp. 457–470, 2026

    work page 2026

  6. [6]

    Collaborative sensing in internet of things: A comprehensive survey,

    S. He, K. Shi, C. Liu, B. Guo, J. Chen, and Z. Shi, “Collaborative sensing in internet of things: A comprehensive survey,”IEEE Communications Surveys & Tutorials, vol. 24, no. 3, pp. 1435–1474, 2022

    work page 2022

  7. [7]

    Joint communication, sensing, and computation enabled 6G intelligent ma- chine system,

    Z. Feng, Z. Wei, X. Chen, H. Yang, Q. Zhang, and P. Zhang, “Joint communication, sensing, and computation enabled 6G intelligent ma- chine system,”IEEE Network, vol. 35, no. 6, pp. 34–42, 2022

    work page 2022

  8. [8]

    Collaborative optimization of the age of information under partial observability,

    A. Tahir, K. Cui, B. Alt, A. Rizk, and H. Koeppl, “Collaborative optimization of the age of information under partial observability,” in 2024 IFIP Networking Conference (IFIP Networking), pp. 555–561, IEEE, 2024

    work page 2024

  9. [9]

    End-to-end autonomous driving: Challenges and frontiers,

    L. Chen, P. Wu, K. Chitta, B. Jaeger, A. Geiger, and H. Li, “End-to-end autonomous driving: Challenges and frontiers,”IEEE Transactions on Pattern Analysis and Machine Intelligence, 2024

    work page 2024

  10. [10]

    Collaborative perception in autonomous driving: Methods, datasets, and challenges,

    Y . Han, H. Zhang, H. Li, Y . Jin, C. Lang, and Y . Li, “Collaborative perception in autonomous driving: Methods, datasets, and challenges,” IEEE Intelligent Transportation Systems Magazine, vol. 15, no. 6, pp. 131–151, 2023

    work page 2023

  11. [11]

    Collaborative perception—the missing piece in realizing fully autonomous driving,

    S. Malik, M. J. Khan, M. A. Khan, and H. El-Sayed, “Collaborative perception—the missing piece in realizing fully autonomous driving,” Sensors, vol. 23, no. 18, p. 7854, 2023

    work page 2023

  12. [12]

    Benefits of V2V communi- cation for autonomous and connected vehicles,

    S. Darbha, S. Konduri, and P. R. Pagilla, “Benefits of V2V communi- cation for autonomous and connected vehicles,”IEEE Transactions on Intelligent Transportation Systems, vol. 20, no. 5, pp. 1954–1963, 2018

    work page 1954

  13. [13]

    Cooperative perception with V2V com- munication for autonomous vehicles,

    H. Ngo, H. Fang, and H. Wang, “Cooperative perception with V2V com- munication for autonomous vehicles,”IEEE Transactions on Vehicular Technology, vol. 72, no. 9, pp. 11122–11131, 2023

    work page 2023

  14. [14]

    Cooperative perception for 3D object detection in driving scenarios using infrastruc- ture sensors,

    E. Arnold, M. Dianati, R. De Temple, and S. Fallah, “Cooperative perception for 3D object detection in driving scenarios using infrastruc- ture sensors,”IEEE Transactions on Intelligent Transportation Systems, vol. 23, no. 3, pp. 1852–1864, 2020

    work page 2020

  15. [15]

    V oI-aware scheduling schemes for multi- agent formation control,

    F. Chiariotti and M. Fabris, “V oI-aware scheduling schemes for multi- agent formation control,”IFAC-PapersOnLine, vol. 59, no. 27, pp. 13– 18, 2025

    work page 2025

  16. [16]

    Decentralized age-of-information bandits,

    A. Prasad, V . Jain, and S. Moharir, “Decentralized age-of-information bandits,” in2021 IEEE Wireless Communications and Networking Conference (WCNC), pp. 1–6, IEEE, 2021

    work page 2021

  17. [17]

    Age of information in V2V-enabled platooning systems,

    S. Zhou, S. Li, and G. Tan, “Age of information in V2V-enabled platooning systems,”IEEE Internet of Things Journal, vol. 11, no. 3, pp. 4015–4028, 2023

    work page 2023

  18. [18]

    Keep it fresh: Reducing the age of information in V2X networks,

    L. Baldesi, L. Maccari, and R. Lo Cigno, “Keep it fresh: Reducing the age of information in V2X networks,” inProceedings of the 1st ACM MobiHoc Workshop on Technologies, Models, and Protocols for Cooperative Connected Cars, pp. 7–12, 2019

    work page 2019

  19. [19]

    Information freshness in coordinate decision-making communication systems,

    S. Zhou, Z. Wang, Y . Dong, B. Tang, and G. Tan, “Information freshness in coordinate decision-making communication systems,” in GLOBECOM 2024-2024 IEEE Global Communications Conference, pp. 4156–4161, IEEE, 2024

    work page 2024

  20. [20]

    Age of information in gossip networks: A friendly introduction and literature survey,

    P. Kaswan, P. Mitra, A. Srivastava, and S. Ulukus, “Age of information in gossip networks: A friendly introduction and literature survey,”IEEE Transactions on Communications, vol. 73, no. 8, pp. 6200–6220, 2025

    work page 2025

  21. [21]

    Age of gossip from connective prop- erties via first passage percolation,

    T. J. Maranzatto and M. Michelen, “Age of gossip from connective prop- erties via first passage percolation,”IEEE Transactions on Information Theory, vol. 71, no. 11, pp. 9019–9027, 2025

    work page 2025

  22. [22]

    Version age-optimal cached status updates in a gossiping network with energy harvesting sensor,

    E. Delfani and N. Pappas, “Version age-optimal cached status updates in a gossiping network with energy harvesting sensor,”IEEE Transactions on Communications, vol. 73, no. 4, pp. 2344–2360, 2025

    work page 2025

  23. [23]

    Age of information for frame slotted aloha,

    J. Wang, J. Yu, X. Chen, L. Chen, C. Qiu, and J. An, “Age of information for frame slotted aloha,”IEEE Transactions on Communications, vol. 71, no. 4, pp. 2121–2135, 2023

    work page 2023

  24. [24]

    Age- threshold slotted aloha for optimizing information freshness in mobile networks,

    F. Zhao, N. Pappas, C. Ma, X. Sun, T. Q. S. Quek, and H. H. Yang, “Age- threshold slotted aloha for optimizing information freshness in mobile networks,”IEEE Transactions on Wireless Communications, vol. 23, no. 11, pp. 17236–17251, 2024

    work page 2024

  25. [25]

    Analysis of slotted aloha with an age threshold,

    O. T. Yavascan and E. Uysal, “Analysis of slotted aloha with an age threshold,”IEEE Journal on Selected Areas in Communications, vol. 39, no. 5, pp. 1456–1470, 2021

    work page 2021

  26. [26]

    Modern random access: An age of information perspective on irregular repetition slotted aloha,

    A. Munari, “Modern random access: An age of information perspective on irregular repetition slotted aloha,”IEEE Transactions on Communi- cations, vol. 69, no. 6, pp. 3572–3585, 2021

    work page 2021

  27. [27]

    Boyd and L

    S. Boyd and L. Vandenberghe,Convex optimization. Cambridge univer- sity press, 2004

    work page 2004

  28. [28]

    CVX: Matlab software for disciplined convex programming, version 2.2

    M. Grant and S. Boyd, “CVX: Matlab software for disciplined convex programming, version 2.2.” https://cvxr.com/cvx, 2020

    work page 2020