TWT Acceptance and Scheduling Problem (TASP)

• TASP is a family of optimization problems in IEEE 802.11ax networks that decide transmission admissions and wake window scheduling via TWT.
• The formulations integrate admission control, sequencing, energy costs, and AoI constraints using approaches like integer programming and Lyapunov optimization.
• Algorithmic strategies such as TASPER, broadcast-TWT grouping, and dynamic interval assignment have shown improved performance in energy savings and timely throughput.

The TWT Acceptance and Scheduling Problem (TASP) denotes a family of optimization problems in IEEE 802.11ax / Wi‑Fi 6 networks that use Target Wake Time (TWT) to decide which transmissions or stations are admitted into scheduled service and how their wake windows are arranged. In the explicit formulation introduced for time-sensitive and energy-efficient Wi‑Fi networks, an access point decides, for each requested transmission opportunity, whether to accept or reject it and, if accepted, when to schedule it as a TWT Service Period (SP), with the objective of maximizing traffic throughput and energy efficiency while respecting Age of Information (AoI) constraints (Busacca et al., 30 Sep 2025). Related work develops closely aligned formulations in which “acceptance” is realized through STA grouping into broadcast TWT sessions, dynamic STA selection with interval assignment, deterministic per-client schedule synthesis, or QoS-driven provisioning for bursty video traffic (Roy et al., 2023, Karaca, 2020, Rajendran et al., 1 May 2025, Rajendran et al., 2023).

1. TWT as the scheduling substrate

TWT is an IEEE 802.11ax mechanism in which stations negotiate wake-up intervals during which they can transmit or receive, and sleep outside those intervals. In the time-sensitive formulation, TWT enables the access point to instruct Wi‑Fi stations to wake up and transmit in non-overlapping TWT Service Periods and sleep in the remaining time, thereby exposing admission and sequencing decisions at the MAC layer (Busacca et al., 30 Sep 2025). In the video-streaming study, TWT is presented as a feature introduced primarily for power saving, but also useful for scheduled access, resource allocation, and reducing contention; in a managed WLAN it can act like a quasi-TDMA schedule on top of OFDMA/MU-MIMO, although the AP still uses normal CSMA/CA during the wake windows (Rajendran et al., 2023).

The literature spans both broadcast TWT and individual TWT. In the broadcast model, STAs are partitioned into groups characterized by a TWT triplet consisting of TWT Offset (TWT-O), TWT Wake Interval (TWT-WI), and TWT Service Period (TWT-SP), and all STAs in the same group share the same TWT parameters and transmit simultaneously using OFDMA (Roy et al., 2023). In individual-TWT formulations, the AP assigns a per-client wake interval or a schedule identified by $$\langle \mathrm{WT}, \mathrm{ST}, \mathrm{offset} \rangle$$, where WT is Target Wake Duration and ST is Target Wake Interval or sleeptime (Karaca, 2020, Rajendran et al., 1 May 2025).

This suggests that TASP is best understood not as a single canonical optimization model, but as a class of admission-and-scheduling problems specialized by TWT mode, traffic model, and PHY/MAC assumptions.

2. Formal problem formulations

The explicit TASP formulation models a Wi‑Fi 6 access point that receives requests for transmissions, each specified by a source STA $m$, data size $b_j$, generation time $g_j$, hard AoI deadline $d_j$, and priority $p_j$. The decision variables are $x_j \in \{0,1\}$ for admission, $y_{ij} \in \{0,1\}$ for immediate sequencing, and $z_j$ for completion time, with dummy transmissions $\alpha$ and $m$0 used to represent the start and end of the sequence (Busacca et al., 30 Sep 2025). The resulting model is a single-machine scheduling problem in which “jobs” are TXOPs.

A representative cross-section of TWT scheduling formulations is summarized below.

Paper	Scheduling abstraction	Primary objective
Explicit TASP (Busacca et al., 30 Sep 2025)	Accept/reject TXs and order accepted TXOPs in a beacon interval	Weighted rejection cost and energy cost under AoI deadlines
Broadcast-TWT grouping (Roy et al., 2023)	Partition STAs into $m$1 groups with $m$2 and allocate OFDMA RUs/power	Weighted sum of long-term timely throughputs
JTWSA-style interval assignment (Karaca, 2020)	Select STAs to be served each epoch and assign discrete TWT intervals	Minimize long-term average energy with queue stability
Deterministic schedule synthesis (Rajendran et al., 1 May 2025)	Choose per-client $m$3 or equivalently $m$4	Maximize $m$5 under throughput and feasibility constraints
QoS-driven video provisioning (Rajendran et al., 2023)	Choose duty cycle and Multiplication Factor for one streaming client	Satisfy throughput and buffer-health requirements

In the broadcast-TWT formulation, the network consists of a single AP, $m$6 STAs, and $m$7 OFDMA resource units. The joint optimization ranges over per-slot RU assignment $m$8, per-slot power $m$9, and group membership sets $b_j$0, with acceptance interpreted as assigning each STA to one of a fixed number of broadcast TWT groups and scheduling interpreted as choosing the TWT triplet plus intra-window RU/power allocation (Roy et al., 2023).

In the dynamic individual-TWT formulation, the AP selects a TWT wake-up interval $b_j$1 for each STA from a discrete set $b_j$2, subject to a limit of at most $b_j$3 STAs per interval; STAs not selected remain asleep for the whole epoch (Karaca, 2020). In the deterministic-scheduling formulation, the optimization is over WT and ST allocations, or equivalently Active Airtime (AA) and Multiplication Factor (MF), with schedules discretized into candidate configurations (Rajendran et al., 1 May 2025).

3. Objective functions, constraints, and performance metrics

The explicit TASP objective is a weighted minimization of rejection cost and energy cost:

$b_j$4

where $b_j$5 controls the trade-off between admission quality and energy efficiency, and priority and energy costs are normalized to $b_j$6 (Busacca et al., 30 Sep 2025). The central hard-timing constraint is $b_j$7, so accepted transmissions must complete before their AoI deadlines; the release-time constraint is $b_j$8; and the sequencing constraints enforce a single ordered chain of accepted transmissions from $b_j$9 to $g_j$0 (Busacca et al., 30 Sep 2025).

Other formulations change both the objective and the meaning of feasibility. In the broadcast-TWT/OFDMA model, the key metric is timely throughput, defined as the number of packets delivered successfully before their deadlines at a decision instant, and the global objective is the weighted sum $g_j$1 subject to RU exclusivity, periodic wake constraints, per-STA average power limits, and a partition of STAs into TWT groups (Roy et al., 2023). In the dynamic interval-assignment model, the objective is to minimize long-term average energy consumption while maintaining network stability, with a discrete TWT-interval choice and an occupancy constraint $g_j$2 for each interval (Karaca, 2020).

The deterministic schedule-synthesis work uses a proportional-fair throughput objective,

$g_j$3

subject to minimum-throughput guarantees for protected clients, comparison constraints relative to CSMA/CA, an uplink/downlink balancing condition, a round-robin style feasibility relation, standard-compliant WT values, and an overlap-threshold mechanism introduced through a pseudo client (Rajendran et al., 1 May 2025). The video-streaming study does not formulate a full mathematical TASP, but it makes the acceptance conditions explicit in heuristic form: the duty cycle must provide sufficient average throughput for the video bitrate, the chosen MF must avoid buffer underrun by stabilizing service for bursts, and the schedule must satisfy the standard’s TWT-SP cap of $g_j$4 (Rajendran et al., 2023).

A recurring pattern is that throughput is often operationalized through admission quality, timely delivery, or guaranteed service, whereas energy is modeled either through wake/sleep transitions and transmit costs or through average per-epoch consumption. This suggests that TASP is inherently multi-objective, even when the formal objective is written as a single weighted scalarization.

4. Algorithmic solution strategies

Because the explicit TASP is NP-hard, the principal algorithmic proposal is TASPER (TASP Efficient Resolver), a heuristic inspired by BALAS and extended to incorporate energy-awareness. TASPER casts scheduling as best-path search in a decision graph whose vertices are $g_j$5, all feasible TXs, and $g_j$6, and whose edge weights are bi-dimensional,

$g_j$7

A transmission $g_j$8 is feasible after current time $g_j$9 only if $d_j$0. To control complexity, TASPER sorts candidate TXs by latest start time $d_j$1, restricts expansion to a neighborhood of size $d_j$2, applies dominance pruning over partial paths, and selects the next “dominant TX” by highest $d_j$3 value, breaking ties by shortest completion time. Its stated complexity is $d_j$4, which becomes effectively linear in the number of TXs / STAs when $d_j$5 is fixed (Busacca et al., 30 Sep 2025).

The broadcast-TWT/OFDMA work uses a two-level decomposition. The inner resource-allocation problem is handled by a drift-plus-penalty policy with real queues for packets and virtual queues for average-power constraints; per block, the algorithm minimizes a Lyapunov-drift upper bound, searches over a finite power set for each STA-RU pair, and then uses the Hungarian algorithm for optimal RU assignment. The outer problem assigns STAs to one of $d_j$6 groups using a greedy incremental-gain rule $d_j$7 (Roy et al., 2023).

The dynamic individual-TWT algorithm, JTWSA, derives from Lyapunov optimization. It ranks STAs by

$d_j$8

selects the top $d_j$9 STAs, admits only those satisfying $p_j$0, and assigns them to intervals in batches of size $p_j$1; otherwise it sets $p_j$2, meaning that the STA effectively sleeps through the epoch (Karaca, 2020).

Two heuristic families are more empirical. The video-streaming work uses a two-stage procedure: first increase duty cycle in 5% increments until the throughput target is met, then vary MF to reduce throughput fluctuation and avoid buffer underruns (Rajendran et al., 2023). The deterministic schedule-synthesis work replaces an analytically unknown throughput function with lookup-table-based discrete search over sampled AA/MF values, then introduces a pseudo client and an overlap-threshold parameter $p_j$3 to relax strict round-robin structure while accounting for overlap loss (Rajendran et al., 1 May 2025).

5. Complexity, guarantees, and reported performance

The explicit TASP is stated to be NP-hard. The paper gives two reasons: the formulation is a Mixed Integer Quadratic Constrained Programming problem, and even without the energy term and energy-related constraint the residual problem reduces to the single-machine Job Interval Selection Problem, which is itself NP-hard (Busacca et al., 30 Sep 2025).

By contrast, two earlier TWT variants come with Lyapunov-style performance guarantees. For the broadcast-TWT/OFDMA formulation, the DPP-based resource-allocation routine solves the per-slot assignment optimally, satisfies average power constraints, ensures mean-rate stability for real and virtual queues, and achieves

$p_j$4

so throughput approaches optimality as $p_j$5 increases, at the cost of slower convergence of queue and power averages (Roy et al., 2023). For JTWSA, if the arrival-rate vector lies in the interior of the capacity region, the long-term average energy is within $p_j$6 of optimum while queue sizes scale as $p_j$7, making the energy-delay trade-off explicit (Karaca, 2020).

Empirical results are correspondingly heterogeneous. In ns-3-based evaluation, TASPER achieves up to 24.97% lower mean transmission rejection cost and up to 14.86% more energy savings than ShortestFirst in a large-scale scenario; compared with HSA, it reduces energy consumption by 34% and mean rejection cost by 26%. On the IIoT testbed with 10 commercial TWT-compatible stations, the paper reports that TASPER admits more transmissions than the best baseline strategy without violating any AoI deadline (Busacca et al., 30 Sep 2025). The broadcast-TWT/OFDMA study reports that DPP-RA and Greedy RA outperform RR-RA, that channel-aware and buffer-aware methods outperform channel-only or buffer-unaware baselines, and that the advantage of smarter grouping and RU/power allocation becomes more visible in denser systems (Roy et al., 2023). JTWSA stabilizes the network up to arrival rate around 2, whereas the random benchmark becomes unstable around 1, and larger $p_j$8 decreases energy consumption while increasing average queue size (Karaca, 2020). For video streaming, a 30% duty cycle with MF = 8 satisfies the reported QoS requirements under peak background congestion, while overall system throughput does not deteriorate (Rajendran et al., 2023). In testbed experiments on deterministic scheduling, TWT-based scheduling usually improves system throughput compared to pure CSMA/CA, although not universally, and the authors explicitly report that larger MF values can degrade throughput (Rajendran et al., 1 May 2025).

6. Scope boundaries, misconceptions, and open directions

A central boundary condition in the literature is that not every TWT scheduling paper solves a full acceptance-and-scheduling problem. The video-streaming study explicitly does not formulate a full mathematical TASP with a global integer program, explicit acceptance test, or formal proof of feasibility; it is a single-flow, QoS-driven heuristic study (Rajendran et al., 2023). The deterministic-scheduling paper similarly does not use the term TASP explicitly, but it still maps naturally to a TASP-style formulation through per-client schedule choice under feasibility, fairness, throughput-guarantee, and overlap constraints (Rajendran et al., 1 May 2025). Conversely, the 2025 TASP paper defines the term explicitly and places admission, sequencing, energy, and AoI within one integrated model (Busacca et al., 30 Sep 2025).

Another recurring misconception is that TWT automatically yields contention-free deterministic access. The measurement-driven streaming study is explicit that, although TWT can reduce contention and act like a quasi-TDMA schedule, the AP still uses normal CSMA/CA during wake windows (Rajendran et al., 2023). The experimental deterministic-scheduling work reinforces a similar point from another direction: schedule quality depends on parameters such as WT, ST, MF, offset, and overlap threshold, and empirical throughput may deteriorate when MF is too large (Rajendran et al., 1 May 2025).

Across the surveyed works, open directions are defined largely by what current formulations omit. The video-streaming study states plans to analyze different application classes and QoS requirements, determine suitable TWT schedules per application, and extend the framework to broader scheduling/resource-allocation problems (Rajendran et al., 2023). The explicit TASP formulation already targets TSN and IIoT settings with AoI-constrained traffic (Busacca et al., 30 Sep 2025), while the broadcast-TWT formulation incorporates heterogeneous traffic flows, deadline-aware timely throughput, and OFDMA resource allocation (Roy et al., 2023). This suggests an emerging convergence between AoI-aware admission control, deadline-aware RU/power scheduling, and experimentally calibrated deterministic TWT configuration within a single research agenda for Wi‑Fi 6.