Scalable Interference Graph Learning for Low-Latency Wi-Fi Networks using Hashing-based Evolution Strategy

Fuente: arXiv
Enregistré dans:
Détails bibliographiques
Auteurs principaux: Gu, Zhouyou, Park, Jihong, Choi, Jinho
Format: Preprint
Publié: 2025
Sujets:
Accès en ligne:
Tags: Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
_version_ 1866913175169925120
author Gu, Zhouyou
Park, Jihong
Choi, Jinho
author_facet Gu, Zhouyou
Park, Jihong
Choi, Jinho
contents Wi-Fi 7 introduces the restricted target wake time (RTWT) mechanism, which is vital for Industrial IoT (IIoT) applications requiring periodic, reliable, and low-latency communication. RTWT enables deterministic channel access by assigning scheduled transmission slots to stations (STAs), minimizing contention and interference. However, determining efficient RTWT slot assignments remains challenging in dense networks, where conventional interference graph-based models lack flexibility and scalability. To overcome this, we propose a scalable interference graph learning (IGL) framework that learns optimal interference graph representations for graph coloring-based RTWT scheduling. The IGL leverages an evolution strategy (ES) to train a neural network (NN) using a single network-wide reward, avoiding costly edge-wise feedback. Furthermore, a deep hashing function (DHF) groups interfering STAs, limiting training and inference to relevant subsets and greatly reducing complexity. Simulation results demonstrate that the proposed IGL improves slot efficiency by up to 25\%, reduces packet losses by up to 30\% in dynamic environments. Thanks to DHF, it also reduces the training and inference time of IGL by 4 and 8 times, respectively, and the online slot assignment time by 3 times in large networks.
format Preprint
id arxiv_https___arxiv_org_abs_2502_03300
institution arXiv
publishDate 2025
record_format arxiv
spellingShingle Scalable Interference Graph Learning for Low-Latency Wi-Fi Networks using Hashing-based Evolution Strategy
Gu, Zhouyou
Park, Jihong
Choi, Jinho
Signal Processing
Networking and Internet Architecture
Wi-Fi 7 introduces the restricted target wake time (RTWT) mechanism, which is vital for Industrial IoT (IIoT) applications requiring periodic, reliable, and low-latency communication. RTWT enables deterministic channel access by assigning scheduled transmission slots to stations (STAs), minimizing contention and interference. However, determining efficient RTWT slot assignments remains challenging in dense networks, where conventional interference graph-based models lack flexibility and scalability. To overcome this, we propose a scalable interference graph learning (IGL) framework that learns optimal interference graph representations for graph coloring-based RTWT scheduling. The IGL leverages an evolution strategy (ES) to train a neural network (NN) using a single network-wide reward, avoiding costly edge-wise feedback. Furthermore, a deep hashing function (DHF) groups interfering STAs, limiting training and inference to relevant subsets and greatly reducing complexity. Simulation results demonstrate that the proposed IGL improves slot efficiency by up to 25\%, reduces packet losses by up to 30\% in dynamic environments. Thanks to DHF, it also reduces the training and inference time of IGL by 4 and 8 times, respectively, and the online slot assignment time by 3 times in large networks.
title Scalable Interference Graph Learning for Low-Latency Wi-Fi Networks using Hashing-based Evolution Strategy
topic Signal Processing
Networking and Internet Architecture
url https://arxiv.org/abs/2502.03300