Search arXivSearch

arXiv · 2606.13759

A Tutorial on IEEE 802.11bn Multi-AP Coordination for Wi-Fi 8: From Standardization to Performance Evaluation

Abstract

The IEEE 802.11bn amendment defines significant modifications to the standard by establishing Ultra High Reliability (UHR) targets in Wireless Local Area Networks (WLANs). This is expected to deliver substantial enhancements over previous standards, including modes of operation that increase throughput, reduce the 95th percentile of the latency distribution, and decrease MAC Protocol Data Unit (MPDU) loss (all by at least 25%) compared to Extremely High Throughput (EHT) operations defined in the 802.11be amendment. A fundamental innovation for achieving these ambitious goals is the introduction of Multi-Access Point Coordination (MAPC), an unprecedented feature whereby APs will be able to coordinate among themselves to enhance spectrum utilization and advance towards reliability. This paper provides a comprehensive overview and analysis of this key framework. We begin by reviewing existing AP coordination solutions that precede the 802.11bn standard, which serve as a foundation for understanding the transition to the current framework. We then describe the technical 802.11bn MAPC framework as defined by the task group. A detailed overview of each candidate MAPC feature is provided, contextualized with the relevant state-of-the-art. Furthermore, we introduce Kom8ndor, an open-source Wi-Fi 8 simulation tool, to evaluate these candidate MAPC features and showcase their potential to achieve UHR goals. Finally, we outline the future of MAPC beyond 802.11bn, exploring promising directions such as coordination schemes beyond 802.11bn (e.g., Joint Transmission (JT)) and new ideas.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Francesc Wilhelmi, Boris Bellalta, Giovanni Geraci, Lorenzo Galati-Giordano, Francesca Meneghello, Aleksandra Kijanka, Iñaki Val, David López-Pérez. 2026-06-11. A Tutorial on IEEE 802.11bn Multi-AP Coordination for Wi-Fi 8: From Standardization to Performance Evaluation. https://arxiv.org/abs/2606.13759

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Decoding Delay Guarantees of Space Regulated Multiple Access Random Wireless Networks using Successive Interference Cancellation

This paper is focused on decoding delay guarantees in wireless networks, where messages have a given signal-to-interference-plus-noise ratio threshold $η_0$ to meet in order to be successfully decoded, and where transmissions should occur within some strict time constraints. Its main contribution consists in quantifying the worst-case transmissions decoding delays in the uplink of cellular and cell-free networks using successive interference cancellation. We show how such decoding delay guarantees can be obtained using spatial network calculus, a new tool introduced recently, and in particular spatial regulation. The results rely on the assumption of absence of fading. We nevertheless outline what this approach will lead to in the fading case for cellular networks.

cs.NI

Toward Composable Network Digital Twins: A Subgraph-Based Latency Prediction Study

Modern networks must support changing topologies, configurations, and performance objectives, motivating fast and reliable performance estimation. Network digital twins (NDTs) enable what-if analysis for performance estimation in such network scenarios, however, existing machine learning-based NDT approaches often rely on entire topology representations, which are inherently monolithic and lack reusability under topological or traffic changes in the network. This paper introduces a composable NDT approach that decomposes networks into subgraphs represented by reusable unit twins that capture subgraph structure, configuration and traffic behaviours. A lightweight composer aggregates unit twin combinations to create NDTs that predict per-route end-to-end latency through an overall topology. Evaluation across controlled synthetic topologies and diverse traffic scenarios, real-world Topology Zoo topologies, and a public NDT challenge dataset demonstrates that the composable NDTs achieve high in-distribution accuracy while remaining stable under out-of-distribution scenarios. Comparison with monolithic full topology NDTs demonstrates that our composable approach achieves reusability, while achieving comparable or superior accuracy.

cs.NI

Pattern-Aware Virtual Network Embedding Optimization for Cloud Data Centers

The network virtualization (NV) technology has enabled the sharing of multiple resources among virtual networks (VNs) in cloud data centers. One of the key challenges is to allocate resources in real-time for virtual network request (VNR), which is known as online virtual network embedding (VNE). However, the existing online VNE methods do not exploit the multi-dimensional complementary relationship among diverse VNRs, resulting in the fragmentation and waste of substrate resources. In this paper, we propose the pattern matching based online VNE approach by constructing appropriate matching rules among observed patterns to maximize resources utilization. We devise the clustering based VNRs quantization method and conduct rigorous study on the pattern combination filtering problem. Then, we utilize the column generation to solve it and construct the pattern matching rules. Based on the rules, we propose an online pattern matching VNE algorithm with linear worst-case complexity. Evaluation on a 106-server testbed using Alibaba production cluster trace dataset shows that our algorithm achieves close-to-offline performance and more accepted workloads that outperforms traditional designs by 25%-30%.

cs.NI