Pith. sign in

REVIEW 2 cited by

Multi-AP Coordinated Spatial Reuse for Wi-Fi 8: Group Creation and Scheduling

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2305.04846 v1 pith:6MVGOGDG submitted 2023-05-08 cs.NI

classification cs.NI
keywords algorithmsmapcbuffergroupsmulti-apper-apper-groupscheduling
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
read the original abstract

Multi-Access Point Coordination (MAPC) will be a key feature in next generation Wi-Fi 8 networks. MAPC aims to improve the overall network performance by allowing Access Points (APs) to share time, frequency and/or spatial resources in a coordinated way, thus alleviating inter-AP contention and enabling new multi-AP channel access strategies. This paper introduces a framework to support periodic MAPC transmissions on top of current Wi-Fi operation. We first focus on the problem of creating multi-AP groups that can transmit simultaneously to leverage Spatial Reuse opportunities. Then, once these groups are created, we study different scheduling algorithms to determine which groups will transmit at every MAPC transmission. Two different types of algorithms are tested: per-AP, and per-Group. While per-AP algorithms base their scheduling decision on the buffer state of individual APs, per-Group algorithms do that taking into account the aggregate buffer state of all APs in a group. Obtained results -- targetting worst-case delay -- show that per-AP based algorithms outperform per-Group ones due to their ability to guarantee that the AP with a) more packets, or b) with the oldest waiting packet in the buffer is selected.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 2 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Coordinated Spatial Reuse Scheduling With Machine Learning in IEEE 802.11 MAPC Networks

    cs.NI 2025-05 conditional novelty 6.0 of 10

    A three-level hierarchical multi-armed bandit scheduler for coordinated spatial reuse in IEEE 802.11bn Wi-Fi raises aggregate throughput by about 80% over legacy random access in simulations, with a smaller real testb...

  2. Coordinated Multi-Armed Bandits for Improved Spatial Reuse in Wi-Fi

    cs.NI 2024-12 conditional novelty 5.0 of 10

    Coordinated multi-agent bandits that share rewards improve spatial reuse in simulated Wi-Fi networks, increasing mean throughput by up to 15% and minimum throughput by up to 210% over OBSS/PD SR.

Pith tools