pith. machine review for the scientific record. sign in

arxiv: 2604.23796 · v1 · submitted 2026-04-26 · 💻 cs.NI · cs.IT· math.IT

Recognition: unknown

Optimizing Information Freshness for Wireless Local Area Networks with Multiple APs

Ananth Ram Rajagopalan , Jiahui Ni , Vishrant Tripathi
Authors on Pith no claims yet

Pith reviewed 2026-05-08 05:03 UTC · model grok-4.3

classification 💻 cs.NI cs.ITmath.IT
keywords Age of InformationMulti-AP WLANInterference-aware schedulingLyapunov drift analysisSubmodular optimizationWireless freshnessCentralized coordinationConstant-factor approximation
0
0 comments X

The pith

Centralized multi-AP scheduling achieves constant-factor optimal Age of Information in interfering WLANs.

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

The paper shows how to minimize network-wide Age of Information when multiple access points share spectrum and their transmissions interfere with one another. It first establishes a lower bound on the best possible AoI any policy can achieve. Stationary randomized policies are then constructed that stay within a constant factor of this bound, and an online Lyapunov drift policy extends the guarantee to systems where frame lengths depend on the chosen actions. Per-frame decisions can be approximated efficiently in polynomial time by local search when the objective meets a submodularity condition. These results matter for latency-sensitive applications in dense indoor wireless networks that now rely on coordinated, software-defined WLAN architectures.

Core claim

We derive a lower bound on achievable network-wide Age of Information under arbitrary scheduling policies in multi-AP WLANs subject to co-channel and adjacent-channel interference. Stationary randomized policies are designed that attain constant-factor optimality relative to this bound. For time-varying systems we introduce a Lyapunov drift-based online policy and prove its constant-factor guarantee through a new ratio-based drift analysis. Per-frame scheduling is further shown to admit polynomial-time local-search approximations whenever the objective function is submodular.

What carries the argument

Stationary randomized policies together with ratio-based Lyapunov drift analysis that handle action-dependent frame lengths caused by interference coupling across APs.

If this is right

  • Network-wide AoI remains within a fixed constant multiple of the theoretical minimum even when transmissions from different APs interfere.
  • An online policy can be run in real time that preserves the same constant-factor guarantee for systems whose frame durations vary with the schedule.
  • Per-frame decisions admit efficient local-search approximations that scale to realistic numbers of APs and clients under the submodularity condition.
  • Simulations on realistic indoor layouts show roughly 50 percent AoI improvement over uncoordinated single-AP baselines.

Where Pith is reading between the lines

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

  • The same constant-factor framework could be applied to other wireless settings where scheduling decisions affect transmission durations, such as Wi-Fi 6/7 or 5G small cells.
  • Relaxing submodularity would require different approximation algorithms, possibly trading worst-case guarantees for average-case performance.
  • The lower bound itself could serve as a benchmark for evaluating future learning-based schedulers in multi-AP environments.

Load-bearing premise

The per-frame scheduling objective must be submodular for the local-search procedure to run in polynomial time.

What would settle it

A concrete WLAN layout and traffic pattern where the long-run average AoI under the proposed stationary randomized policy exceeds the derived lower bound by more than the stated constant factor.

Figures

Figures reproduced from arXiv: 2604.23796 by Ananth Ram Rajagopalan, Jiahui Ni, Vishrant Tripathi.

Figure 1
Figure 1. Figure 1: A WLAN with 𝐾 = 8 APs and 𝑁 = 60 users. There are three orthogonal channels available for use, so APs on the same channel, for example (1,3,8), have interfering trans￾missions. nodes served by AP 𝑘. The AP locations and channel assignments are fixed and assumed to be known to the scheduler. In conventional WLANs, nodes access the medium using dis￾tributed MAC protocols such as CSMA/CA. While effective with… view at source ↗
Figure 2
Figure 2. Figure 2: Example of the multi-AP WLAN deployment used view at source ↗
Figure 4
Figure 4. Figure 4: Example of the multi-AP WLAN deployment used view at source ↗
Figure 3
Figure 3. Figure 3: Plot of the average AoI for the 2-AP network as a view at source ↗
Figure 5
Figure 5. Figure 5: Plot of the average AoI as a function of the number view at source ↗
read the original abstract

Dense indoor WLANs increasingly rely on multiple access points (APs) operating over partially overlapping spectrum to support latency-sensitive applications. In such deployments, simultaneous transmissions across APs create co-channel and adjacent-channel interference, making scheduling decisions interdependent and directly impacting information freshness. Motivated by emerging software-defined WLAN architectures that enable centralized coordination, we study the problem of minimizing network-wide Age of Information (AoI) in multi-AP WLANs. Unlike classical AoI scheduling that runs at a single AP, each scheduling decision is now coupled across APs due to interference. This leads to a new class of combinatorial AoI control problems with action-dependent time evolution. We first derive a lower bound on the achievable AoI under arbitrary scheduling policies. We then design stationary randomized policies that have constant-factor optimality guarantees relative to this bound. Building on these insights, we develop a Lyapunov drift-based online policy for systems with action-dependent frame lengths, and establish constant-factor guarantees using new ratio-based drift analysis. To enable scalable implementation, we further show that per-frame scheduling admits efficient polynomial-time local-search approximations under a submodularity assumption. Simulations using realistic WLAN layouts demonstrate about 50% AoI reduction over distributed single AP baselines.

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

1 major / 1 minor

Summary. The paper studies the problem of minimizing network-wide Age of Information (AoI) in multi-AP WLANs where scheduling decisions are coupled due to co-channel and adjacent-channel interference. It derives a lower bound on achievable AoI under arbitrary policies, designs stationary randomized policies with constant-factor optimality guarantees relative to the bound, develops a Lyapunov drift-based online policy for action-dependent frame lengths with constant-factor guarantees via new ratio-based drift analysis, and shows that per-frame scheduling admits polynomial-time local-search approximations under a submodularity assumption on the objective. Simulations on realistic WLAN layouts report approximately 50% AoI reduction compared to distributed single-AP baselines.

Significance. If the constant-factor guarantees are rigorously established and the submodularity assumption holds under the paper's interference model, the work offers a useful theoretical framework for AoI control in coordinated multi-AP systems, which is relevant for software-defined WLAN architectures supporting latency-sensitive traffic. The ratio-based drift analysis technique for variable frame lengths represents a methodological contribution that may apply beyond this setting, and the simulation results provide initial evidence of practical gains over single-AP baselines.

major comments (1)
  1. [Section developing per-frame scheduling approximations] The polynomial-time local-search approximation for per-frame scheduling is presented as enabling scalable implementation, but it is conditional on an unverified submodularity assumption for the set function capturing AoI reduction under action-dependent interference. The manuscript does not prove or empirically verify that diminishing returns hold for realistic channel overlaps, frame-length dependencies, or multi-AP interference patterns; if submodularity fails, the approximation guarantee collapses and the practical contribution is limited to the (still unverified) drift analysis.
minor comments (1)
  1. [Abstract] The abstract states that stationary randomized policies have 'constant-factor optimality guarantees' and that the online policy establishes 'constant-factor guarantees,' but does not specify the numerical factors (e.g., 2, 4). Including these constants would improve precision and allow readers to assess the tightness of the bounds.

Simulated Author's Rebuttal

1 responses · 0 unresolved

We thank the referee for the constructive feedback on our manuscript. We address the major comment regarding the submodularity assumption for the per-frame scheduling approximation below.

read point-by-point responses

  1. Referee: [Section developing per-frame scheduling approximations] The polynomial-time local-search approximation for per-frame scheduling is presented as enabling scalable implementation, but it is conditional on an unverified submodularity assumption for the set function capturing AoI reduction under action-dependent interference. The manuscript does not prove or empirically verify that diminishing returns hold for realistic channel overlaps, frame-length dependencies, or multi-AP interference patterns; if submodularity fails, the approximation guarantee collapses and the practical contribution is limited to the (still unverified) drift analysis.

    Authors: We agree that the submodularity assumption is stated without proof or empirical verification in the current manuscript, and that this limits the strength of the approximation guarantee. In the revised version, we will add an empirical verification subsection using the same realistic WLAN layouts and interference patterns from our simulations. Specifically, we will compute the set function values for AoI reduction under varying subsets of actions and check for diminishing returns across different channel overlap scenarios and frame-length dependencies. We will also include a brief discussion of the conditions (e.g., low-to-moderate adjacent-channel interference) under which submodularity is expected to hold based on the structure of the AoI objective. If the empirical check reveals cases where submodularity fails, we will explicitly note that the local-search then serves as a heuristic without the stated guarantee. Importantly, the stationary randomized policies and the Lyapunov drift-based online policy with ratio-based analysis provide constant-factor guarantees independently of the per-frame approximation; these contributions do not rely on submodularity and remain unaffected. revision: yes

Circularity Check

0 steps flagged

No significant circularity; derivation is self-contained

full rationale

The paper first derives an explicit lower bound on network-wide AoI under arbitrary policies. It then constructs stationary randomized policies whose performance is bounded by a constant factor relative to that lower bound, using a newly introduced ratio-based drift analysis. A Lyapunov-based online policy receives analogous constant-factor guarantees via the same analysis technique. The per-frame scheduling approximation is presented strictly under an explicit submodularity assumption on the objective; the paper does not claim to prove submodularity holds in the multi-AP interference setting. No equation or claim reduces by construction to a fitted parameter, a self-referential definition, or a load-bearing self-citation. All central results are therefore independent of their own outputs and remain conditional on the stated assumption.

Axiom & Free-Parameter Ledger

0 free parameters · 1 axioms · 0 invented entities

Review performed on abstract only; no explicit free parameters, axioms, or invented entities are identifiable from the provided text. The submodularity assumption is noted as a domain assumption for the approximation result.

axioms (1)
  • domain assumption submodularity assumption for per-frame scheduling
    Invoked to obtain polynomial-time local-search approximation.

pith-pipeline@v0.9.0 · 5523 in / 1206 out tokens · 32502 ms · 2026-05-08T05:03:00.032894+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

36 extracted references · 21 canonical work pages

  1. [1]

    Warehouse automation and private wireless networks

    Nokia. Warehouse automation and private wireless networks. White paper, Nokia, December 2021. URL https://scg-mmh.s3.amazonaws.com/pdfs/nokia_ wp_warehouse_automation_and_private_wireless_networks_121521.pdf. Ac- cessed: 2026-04-17

    2021

  2. [2]

    Warehouse deployment: A comparative measurement study of commercial wi-fi and cbrs systems

    Vanlin Sathya, Lyutianyang Zhang, Mohit Goyal, and Mehmet Yavuz. Warehouse deployment: A comparative measurement study of commercial wi-fi and cbrs systems. In2023 International Conference on Computing, Networking and Commu- nications (ICNC), pages 242–248, 2023. doi: 10.1109/ICNC57223.2023.10074584

    work page doi:10.1109/icnc57223.2023.10074584 2023

  3. [3]

    Qubit Allocation for Dis- tributed Quantum Computing,

    Vishrant Tripathi, Igor Kadota, Ezra Tal, Muhammad Shahir Rahman, Alexander Warren, Sertac Karaman, and Eytan Modiano. Wiswarm: Age-of-information- based wireless networking for collaborative teams of uavs. InIEEE INFOCOM 2023 - IEEE Conference on Computer Communications, pages 1–10, 2023. doi: 10.1109/INFOCOM53939.2023.10228860

    work page doi:10.1109/infocom53939.2023.10228860 2023

  4. [4]

    Shah, Aidin Ferdowsi, Jeffrey H

    Biplav Choudhury, Vijay K. Shah, Aidin Ferdowsi, Jeffrey H. Reed, and Y. Thomas Hou. Aoi-minimizing scheduling in uav-relayed iot networks. In2021 IEEE 18th International Conference on Mobile Ad Hoc and Smart Systems (MASS), pages 117–126, 2021. doi: 10.1109/MASS52906.2021.00023

    work page doi:10.1109/mass52906.2021.00023 2021

  5. [5]

    Future networking challenges: The case of mobile augmented reality

    Tristan Braud, Farshid Hassani Bijarbooneh, Dimitris Chatzopoulos, and Pan Hui. Future networking challenges: The case of mobile augmented reality. In2017 IEEE 37th International Conference on Distributed Computing Systems (ICDCS), pages 1796–1807. IEEE, 2017

    2017

  6. [6]

    Can my wifi handle the metaverse? a performance evaluation of meta’s flagship virtual reality hardware

    Matthijs Jansen, Jesse Donkervliet, Animesh Trivedi, and Alexandru Iosup. Can my wifi handle the metaverse? a performance evaluation of meta’s flagship virtual reality hardware. InCompanion of the 2023 ACM/SPEC international conference on performance engineering, pages 297–303, 2023

    2023

  7. [7]

    Towards aoi-aware smart iot systems

    Hasan Burhan Beytur, Sajjad Baghaee, and Elif Uysal. Towards aoi-aware smart iot systems. In2020 International Conference on Computing, Networking and Communications (ICNC), pages 353–357, 2020. doi: 10.1109/ICNC47757.2020. 9049792

    work page doi:10.1109/icnc47757.2020 2020

  8. [8]

    Abd-Elmagid, Nikolaos Pappas, and Harpreet S

    Mohamed A. Abd-Elmagid, Nikolaos Pappas, and Harpreet S. Dhillon. On the role of age of information in the internet of things.IEEE Communications Magazine, 57(12):72–77, 2019. doi: 10.1109/MCOM.001.1900041

    work page doi:10.1109/mcom.001.1900041 2019

  9. [9]

    Yates, C

    Yin Sun, Elif Uysal-Biyikoglu, Roy D. Yates, C. Emre Koksal, and Ness B. Shroff. Update or wait: How to keep your data fresh.IEEE Transactions on Information Theory, 63(11):7492–7508, 2017. doi: 10.1109/TIT.2017.2735804

    work page doi:10.1109/tit.2017.2735804 2017

  10. [10]

    Bedewy, Yin Sun, and Ness B

    Ahmed M. Bedewy, Yin Sun, and Ness B. Shroff. Minimizing the age of informa- tion through queues.IEEE Transactions on Information Theory, 65(8):5215–5232,

  11. [11]

    doi: 10.1109/TIT.2019.2912159

    work page doi:10.1109/tit.2019.2912159 2019

  12. [12]

    Optimizing age-of-information in a multi- class queueing system

    Longbo Huang and Eytan Modiano. Optimizing age-of-information in a multi- class queueing system. In2015 IEEE International Symposium on Information Theory (ISIT), pages 1681–1685, 2015. doi: 10.1109/ISIT.2015.7282742

    work page doi:10.1109/isit.2015.7282742 2015

  13. [13]

    Scheduling policies for minimizing age of information in broadcast wireless networks.IEEE/ACM Transactions on Networking, 26(6):2637–2650, 2018

    Igor Kadota, Abhishek Sinha, Elif Uysal-Biyikoglu, Rahul Singh, and Eytan Modiano. Scheduling policies for minimizing age of information in broadcast wireless networks.IEEE/ACM Transactions on Networking, 26(6):2637–2650, 2018. doi: 10.1109/TNET.2018.2873606

    work page doi:10.1109/tnet.2018.2873606 2018

  14. [14]

    Scheduling algorithms for minimizing age of information in wireless broadcast networks with random arrivals.IEEE Transactions on Mobile Computing, 19(12):2903–2915, 2020

    Yu-Pin Hsu, Eytan Modiano, and Lingjie Duan. Scheduling algorithms for minimizing age of information in wireless broadcast networks with random arrivals.IEEE Transactions on Mobile Computing, 19(12):2903–2915, 2020. doi: 10.1109/TMC.2019.2936199

    work page doi:10.1109/tmc.2019.2936199 2020

  15. [15]

    A whittle index approach to minimizing functions of age of information.IEEE/ACM Transactions on Networking, 32(6): 5144–5158, 2024

    Vishrant Tripathi and Eytan Modiano. A whittle index approach to minimizing functions of age of information.IEEE/ACM Transactions on Networking, 32(6): 5144–5158, 2024. doi: 10.1109/TNET.2024.3452006

    work page doi:10.1109/tnet.2024.3452006 2024

  16. [16]

    Optimizing information freshness in wireless networks under general interference constraints.IEEE/ACM Transactions on Networking, 28(1):15–28, 2020

    Rajat Talak, Sertac Karaman, and Eytan Modiano. Optimizing information freshness in wireless networks under general interference constraints.IEEE/ACM Transactions on Networking, 28(1):15–28, 2020. doi: 10.1109/TNET.2019.2946481

    work page doi:10.1109/tnet.2019.2946481 2020

  17. [17]

    Optimizing age of information in networks with large and small updates

    Zhuoyi Zhao, Vishrant Tripathi, and Igor Kadota. Optimizing age of information in networks with large and small updates. In2025 23rd International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOpt), pages 1–8. IEEE, 2025

    2025

  18. [18]

    Software-defined networking-enabled het- erogeneous wireless networks and applications convergence.IEEE Access, 8: Rajagopalan et al

    Hamada Alshaer and Harald Haas. Software-defined networking-enabled het- erogeneous wireless networks and applications convergence.IEEE Access, 8: Rajagopalan et al. 66672–66692, 2020. doi: 10.1109/ACCESS.2020.2986132

    work page doi:10.1109/access.2020.2986132 2020

  19. [19]

    Diego Kreutz, Fernando M. V. Ramos, Paulo Esteves Veríssimo, Christian Esteve Rothenberg, Siamak Azodolmolky, and Steve Uhlig. Software-defined network- ing: A comprehensive survey.Proceedings of the IEEE, 103(1):14–76, 2015. doi: 10.1109/JPROC.2014.2371999

    work page doi:10.1109/jproc.2014.2371999 2015

  20. [20]

    A review on design and implementation of software-defined wlans.IEEE Systems Journal, 14(2):2601–2614, 2020

    Khalid Ibrahim Qureshi, Lei Wang, Liang Sun, Chunsheng Zhu, and Lei Shu. A review on design and implementation of software-defined wlans.IEEE Systems Journal, 14(2):2601–2614, 2020. doi: 10.1109/JSYST.2019.2960400

    work page doi:10.1109/jsyst.2019.2960400 2020

  21. [21]

    Rflow+: An sdn-based wlan monitoring and management framework

    RhongHo Jang, DongGyu Cho, Youngtae Noh, and DaeHun Nyang. Rflow+: An sdn-based wlan monitoring and management framework. InIEEE INFOCOM 2017 - IEEE Conference on Computer Communications, pages 1–9, 2017. doi: 10.1109/INFOCOM.2017.8056995

    work page doi:10.1109/infocom.2017.8056995 2017

  22. [22]

    Fontes, Samira Afzal, Samuel H

    Ramon R. Fontes, Samira Afzal, Samuel H. B. Brito, Mateus A. S. Santos, and Christian Esteve Rothenberg. Mininet-wifi: Emulating software-defined wire- less networks. In2015 11th International Conference on Network and Service Management (CNSM), pages 384–389, 2015. doi: 10.1109/CNSM.2015.7367387

    work page doi:10.1109/cnsm.2015.7367387 2015

  23. [23]

    A survey on multi-ap coordination approaches over emerging wlans: Future directions and open challenges.IEEE Communications Surveys & Tutorials, 26(2):858–889, 2023

    Shikhar Verma, Tiago Koketsu Rodrigues, Yuichi Kawamoto, Mostafa M Fouda, and Nei Kato. A survey on multi-ap coordination approaches over emerging wlans: Future directions and open challenges.IEEE Communications Surveys & Tutorials, 26(2):858–889, 2023

    2023

  24. [24]

    Enabling reliable latency in wi-fi 8 through multi-ap joint scheduling

    David Nunez, Pasquale Imputato, Stefano Avallone, Malcolm Smith, and Boris Bellalta. Enabling reliable latency in wi-fi 8 through multi-ap joint scheduling. IEEE Open Journal of the Communications Society, 2025

    2025

  25. [25]

    Beyond wi-fi 7: Spatial reuse through multi-ap coordination.Computer Networks, 239:110160, 2024

    Pasquale Imputato, Stefano Avallone, Malcolm Smith, David Nunez, and Boris Bellalta. Beyond wi-fi 7: Spatial reuse through multi-ap coordination.Computer Networks, 239:110160, 2024

    2024

  26. [26]

    Anti-interference technology for wi-fi networking

    MediaTek. Anti-interference technology for wi-fi networking. White paper, MediaTek Inc., August 2025. URL https://www.mediatek. com/hubfs/MediaTek%20Assets/Pdfs/White_Papers/Wi-Fi%20Anti- Interference%20_%20Whitepaper%20(5th%20August).pdf?hsLang=en. Re- lease Date: 25 August 2025. Accessed: 2026-04-17

    2025

  27. [27]

    Ap coordination and full- duplex enabled multi-band operation for the next generation wlan: Ieee 802.11 be (eht)

    Mao Yang, Bo Li, Zhongjiang Yan, and Yuan Yan. Ap coordination and full- duplex enabled multi-band operation for the next generation wlan: Ieee 802.11 be (eht). In2019 11th international conference on wireless communications and signal processing (WCSP), pages 1–7. IEEE, 2019

    2019

  28. [28]

    Optimum multiap coordination in wi-fi with overlay time-sliced scheduling.IEEE Transactions on Networking, 34:989–1004, 2025

    Shivam V Vatsa, GP Anusha, Vishal Sevani, Purushothaman Saravanan, Rahul Nair, Rishabh Roy, SVR Anand, Joy Kuri, and Anurag Kumar. Optimum multiap coordination in wi-fi with overlay time-sliced scheduling.IEEE Transactions on Networking, 34:989–1004, 2025

    2025

  29. [29]

    Age of information: An introduction and survey.IEEE Journal on Selected Areas in Communications, 39(5):1183–1210, 2021

    Roy D Yates, Yin Sun, D Richard Brown, Sanjit K Kaul, Eytan Modiano, and Sennur Ulukus. Age of information: An introduction and survey.IEEE Journal on Selected Areas in Communications, 39(5):1183–1210, 2021

    2021

  30. [30]

    Springer Nature, 2022

    Yin Sun, Igor Kadota, Rajat Talak, and Eytan Modiano.Age of information: A new metric for information freshness. Springer Nature, 2022

    2022

  31. [31]

    PIAS: Practical Information-Agnostic Flow Scheduling for Commodity Data Centers,

    Igor Kadota, Abhishek Sinha, and Eytan Modiano. Scheduling algorithms for optimizing age of information in wireless networks with throughput constraints. IEEE/ACM Transactions on Networking, 27(4):1359–1372, 2019. doi: 10.1109/TNET. 2019.2918736

    work page doi:10.1109/tnet 2019

  32. [32]

    CVX: Matlab software for disciplined convex programming, version 2.2

    Michael Grant and Stephen Boyd. CVX: Matlab software for disciplined convex programming, version 2.2. https://cvxr.com/cvx, March 2014

    2014

  33. [33]

    Optimizing age of information with correlated sources.IEEE/ACM Transactions on Networking, 32(6):4660–4675, 2024

    Vishrant Tripathi and Eytan Modiano. Optimizing age of information with correlated sources.IEEE/ACM Transactions on Networking, 32(6):4660–4675, 2024. doi: 10.1109/TNET.2024.3427658

    work page doi:10.1109/tnet.2024.3427658 2024

  34. [34]

    Michael J. Neely. Dynamic optimization and learning for renewal systems.IEEE Transactions on Automatic Control, 58(1):32–46, 2013. doi: 10.1109/TAC.2012. 2204831

    work page doi:10.1109/tac.2012 2013

  35. [35]

    Dynamic Ideas, Belmont, MA, 2005

    Dimitris Bertsimas and Robert Weismantel.Optimization over Integers. Dynamic Ideas, Belmont, MA, 2005

    2005

  36. [36]

    Batson and Daniel A

    Jon Lee, Vahab S. Mirrokni, Viswanath Nagarajan, and Maxim Sviridenko. Non- monotone submodular maximization under matroid and knapsack constraints. STOC ’09, page 323–332, New York, NY, USA, 2009. Association for Computing Machinery. ISBN 9781605585062. doi: 10.1145/1536414.1536459. URL https: //doi.org/10.1145/1536414.1536459. Appendices A Proof of Lemm...

    work page doi:10.1145/1536414.1536459 2009