Optimizing Information Freshness for Wireless Local Area Networks with Multiple APs
Fuente:
arXiv
Salvato in:
| Autori principali: | , , |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2026
|
| Soggetti: | |
| Accesso online: | |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866915959500963840 |
|---|---|
| author | Rajagopalan, Ananth Ram Ni, Jiahui Tripathi, Vishrant |
| author_facet | Rajagopalan, Ananth Ram Ni, Jiahui Tripathi, Vishrant |
| contents | 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2604_23796 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | Optimizing Information Freshness for Wireless Local Area Networks with Multiple APs Rajagopalan, Ananth Ram Ni, Jiahui Tripathi, Vishrant Networking and Internet Architecture Information Theory 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. |
| title | Optimizing Information Freshness for Wireless Local Area Networks with Multiple APs |
| topic | Networking and Internet Architecture Information Theory |
| url | https://arxiv.org/abs/2604.23796 |