Intelligent Channel Allocation for IEEE 802.11be Multi-Link Operation: When MAB Meets LLM
- URL: http://arxiv.org/abs/2506.04594v1
- Date: Thu, 05 Jun 2025 03:19:57 GMT
- Title: Intelligent Channel Allocation for IEEE 802.11be Multi-Link Operation: When MAB Meets LLM
- Authors: Shumin Lian, Jingwen Tong, Jun Zhang, Liqun Fu,
- Abstract summary: WiFi 7 introduces Multi-Link Operation (MLO), a groundbreaking feature that enables devices to establish multiple simultaneous connections.<n>MLO presents significant challenges in channel allocation, particularly in dense network environments.<n>This paper addresses the dynamic channel allocation problem in dense WiFi 7 networks with MLO capabilities.
- Score: 12.374227618092602
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: WiFi networks have achieved remarkable success in enabling seamless communication and data exchange worldwide. The IEEE 802.11be standard, known as WiFi 7, introduces Multi-Link Operation (MLO), a groundbreaking feature that enables devices to establish multiple simultaneous connections across different bands and channels. While MLO promises substantial improvements in network throughput and latency reduction, it presents significant challenges in channel allocation, particularly in dense network environments. Current research has predominantly focused on performance analysis and throughput optimization within static WiFi 7 network configurations. In contrast, this paper addresses the dynamic channel allocation problem in dense WiFi 7 networks with MLO capabilities. We formulate this challenge as a combinatorial optimization problem, leveraging a novel network performance analysis mechanism. Given the inherent lack of prior network information, we model the problem within a Multi-Armed Bandit (MAB) framework to enable online learning of optimal channel allocations. Our proposed Best-Arm Identification-enabled Monte Carlo Tree Search (BAI-MCTS) algorithm includes rigorous theoretical analysis, providing upper bounds for both sample complexity and error probability. To further reduce sample complexity and enhance generalizability across diverse network scenarios, we put forth LLM-BAI-MCTS, an intelligent algorithm for the dynamic channel allocation problem by integrating the Large Language Model (LLM) into the BAI-MCTS algorithm. Numerical results demonstrate that the BAI-MCTS algorithm achieves a convergence rate approximately $50.44\%$ faster than the state-of-the-art algorithms when reaching $98\%$ of the optimal value. Notably, the convergence rate of the LLM-BAI-MCTS algorithm increases by over $63.32\%$ in dense networks.
Related papers
- Graph Neural Networks for Resource Allocation in Multi-Channel Wireless Networks [15.680699077140453]
We propose an enhanced WMMSE algorithm to solve the JCPA problem in multi-channel wireless networks.<n>We then introduce JCPGNN-M, a graph neural network-based solution that enables simultaneous multi-channel allocation for each user.<n>We show that JCPGNN-M achieves better data rate compared to eWMMSE.
arXiv Detail & Related papers (2025-06-04T10:34:05Z) - Multi-Objective Routing Optimization Using Coherent Ising Machine in Wireless Multihop Networks [4.4727509471456495]
Coherent Ising Machines (CIM) is a quantum-inspired algorithm for multi-objective routing optimization in wireless networks.<n> CIM demonstrates strong scalability across diverse network topologies without requiring topology-specific adjustments.<n>Our results show that CIM provides feasible and near-optimal solutions for networks containing hundreds of nodes and thousands of edges.
arXiv Detail & Related papers (2025-03-10T23:59:50Z) - Satellite Federated Edge Learning: Architecture Design and Convergence Analysis [47.057886812985984]
This paper introduces a novel FEEL algorithm, named FEDMEGA, tailored to mega-constellation networks.
By integrating inter-satellite links (ISL) for intra-orbit model aggregation, the proposed algorithm significantly reduces the usage of low data rate and intermittent GSL.
Our proposed method includes a ring all-reduce based intra-orbit aggregation mechanism, coupled with a network flow-based transmission scheme for global model aggregation.
arXiv Detail & Related papers (2024-04-02T11:59:58Z) - Intelligent multicast routing method based on multi-agent deep
reinforcement learning in SDWN [4.521033397097599]
Multicast communication technology is widely applied in wireless environments with a high device density.
This paper proposes a new multicast routing method based on multiagent deep reinforcement learning (MADRL-MR) in a software-defined wireless networking (SDWN) environment.
Simulation experiments show that MADRL-MR outperforms existing algorithms in terms of throughput, delay, packet loss rate, etc.
arXiv Detail & Related papers (2023-05-12T14:05:03Z) - Distributed Multi-Agent Deep Q-Learning for Fast Roaming in IEEE
802.11ax Wi-Fi Systems [8.057006406834466]
Wi-Fi 6, IEEE 802.11ax, was be approved as the next sixth-generation (6G) technology of wireless local area networks (WLANs)
In this paper, we propose a multi-agent deep Q-learning for fast roaming (MADAR) algorithm to effectively minimize the latency during the station roaming for Smart Warehouse in Wi-Fi 6 system.
arXiv Detail & Related papers (2023-03-25T04:39:59Z) - Multi-agent Reinforcement Learning with Graph Q-Networks for Antenna
Tuning [60.94661435297309]
The scale of mobile networks makes it challenging to optimize antenna parameters using manual intervention or hand-engineered strategies.
We propose a new multi-agent reinforcement learning algorithm to optimize mobile network configurations globally.
We empirically demonstrate the performance of the algorithm on an antenna tilt tuning problem and a joint tilt and power control problem in a simulated environment.
arXiv Detail & Related papers (2023-01-20T17:06:34Z) - Learning to Beamform in Heterogeneous Massive MIMO Networks [48.62625893368218]
It is well-known problem of finding the optimal beamformers in massive multiple-input multiple-output (MIMO) networks.
We propose a novel deep learning based paper algorithm to address this problem.
arXiv Detail & Related papers (2020-11-08T12:48:06Z) - Iterative Algorithm Induced Deep-Unfolding Neural Networks: Precoding
Design for Multiuser MIMO Systems [59.804810122136345]
We propose a framework for deep-unfolding, where a general form of iterative algorithm induced deep-unfolding neural network (IAIDNN) is developed.
An efficient IAIDNN based on the structure of the classic weighted minimum mean-square error (WMMSE) iterative algorithm is developed.
We show that the proposed IAIDNN efficiently achieves the performance of the iterative WMMSE algorithm with reduced computational complexity.
arXiv Detail & Related papers (2020-06-15T02:57:57Z) - Communication-Efficient Distributed Stochastic AUC Maximization with
Deep Neural Networks [50.42141893913188]
We study a distributed variable for large-scale AUC for a neural network as with a deep neural network.
Our model requires a much less number of communication rounds and still a number of communication rounds in theory.
Our experiments on several datasets show the effectiveness of our theory and also confirm our theory.
arXiv Detail & Related papers (2020-05-05T18:08:23Z) - Rethinking Differentiable Search for Mixed-Precision Neural Networks [83.55785779504868]
Low-precision networks with weights and activations quantized to low bit-width are widely used to accelerate inference on edge devices.
Current solutions are uniform, using identical bit-width for all filters.
This fails to account for the different sensitivities of different filters and is suboptimal.
Mixed-precision networks address this problem, by tuning the bit-width to individual filter requirements.
arXiv Detail & Related papers (2020-04-13T07:02:23Z) - Channel Assignment in Uplink Wireless Communication using Machine
Learning Approach [54.012791474906514]
This letter investigates a channel assignment problem in uplink wireless communication systems.
Our goal is to maximize the sum rate of all users subject to integer channel assignment constraints.
Due to high computational complexity, machine learning approaches are employed to obtain computational efficient solutions.
arXiv Detail & Related papers (2020-01-12T15:54:20Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.