{"id":"604d84e6-4d28-4791-bdd0-8a96ffdf8f7b","arxiv_id":"1909.00603","paper_version":1,"verdict":"CONDITIONAL","confidence":"MODERATE","novelty_score":6.0,"correctness_risk":"medium","formal_verification":"none","parameter_count":2,"one_line_summary":"A cyclic resource assignment algorithm for uplink OFDMA in 802.11ax is shown by simulation to meet 1 ms and 99.999% reliability requirements for real-time traffic, outperforming UORA.","lead":"Uplink OFDMA resource allocation in IEEE 802.11ax Wi-Fi can be scheduled by a new cyclic algorithm (CRA) that alternates random-access and deterministic polling rounds. The paper reports that CRA keeps packet delays below 1 ms with 99.999% reliability, while standard UORA cannot.","discovery_kind":"new_method","skeptic_critique":{"model":"deepseek-v4-flash","headline":"Collision-only loss model and zero late-packet estimates undermine the 99.999% reliability claim; needs a channel-error check.","rationale":"The reader's verdict is CONDITIONAL, and my stress-test pass agrees with that assessment. The most load-bearing concern is the collision-only loss model combined with zero late-packet observations. The reader identified the same weakest assumption: Section III explicitly excludes channel errors. My analysis adds the quantitative consequence: even a tiny non-zero FER breaks the 10^-5 target, and zero-count simulation results do not establish a 10^-5 bound without a confidence interval. The algorithm's design is clear and its qualitative advantage over UORA is plausible, so I would not reject the paper. However, the central claim requires either a channel-error model or an explicit statement that the reliability target applies only to collision-induced losses. The proposed test is straightforward and would settle whether the concern lands. If the test shows negligible impact, the verdict could become ACCEPT; if it shows large impact, the claim would need to be weakened to 'collision-free reliability' or the algorithm would need error-control mechanisms. Therefore CONDITIONAL is the appropriate verdict.","tokens_in":134,"tokens_out":723,"duration_ms":138605,"concrete_test":"Re-run the same scenario with a non-zero bit error model: add a per-transmission FER of 10^-5, 10^-4, and 10^-3 (e.g., from AWGN or measured indoor channel traces) and report P_late for each. If P_late increases by more than 10% at FER = 10^-5, or if the zero-P_late region disappears, the 99.999% claim fails. Also report the number of simulation trials and compute a Wilson or Clopper-Pearson upper bound for P_late whenever the observed count is zero.","verdict_should_be":"CONDITIONAL","load_bearing_attack":"The paper's 99.999% reliability claim rests on the Section III assumption that 'frames can be lost only when two or more STAs transmit in the same RU, i.e., in case of collision.' This removes all channel-induced errors, interference, and decoding failures. In a real 802.11ax link, the frame error rate (FER) at typical SNRs is rarely zero; even a per-transmission FER of 10^-5 would double the claimed PLR, and realistic indoor FERs from 10^-4 to 10^-2 would push the system far beyond the 10^-5 target. CRA only mitigates collisions; it cannot recover corrupted frames. The paper also reports P_late = 0 for STA counts below (F_max - f) * 2, with no confidence intervals or number of simulation runs. A zero estimate from a finite simulation cannot establish a 10^-5 probability: observing zero late packets in M trials only bounds the true probability to roughly 1/M at 63% confidence, and to about 2.3/M at 90% confidence. If M is not large enough, the headline 'wide range of users' may be an artifact of the collision-only model and small sample size. This is a correctness risk for the central quantitative claim, not just a stylistic issue. The algorithm concept is reasonable, but the evidence does not currently support the stated reliability target.","agreement_with_reader":"agree"},"referee_report":{"model":"deepseek-v4-flash","summary":"The paper addresses uplink OFDMA resource allocation in IEEE 802.11ax networks for real-time applications (RTA). It proposes the Cyclic Resource Assignment Algorithm (CRA), which dynamically combines random-access resource units (RUs) with a cyclically polled deterministic access phase for RTA stations that have experienced collisions. The authors evaluate CRA by simulation against the standard 802.11ax UORA scheme, measuring average delay, the probability that packet delay exceeds 1 ms, and the fraction of channel resources left for non-RTA traffic. The paper claims that CRA provides delay below 1 ms with probability 99.999% for a wide range of numbers of RTA stations, while UORA cannot meet this target except in a narrow configuration. The manuscript is a short conference-style paper with a single simulation scenario (slot duration 250 us, Fmax=18, packet arrival rate lambda=200 s^-1).","tokens_in":4799,"tokens_out":3549,"duration_ms":32956,"significance":"If the results are reliable, the contribution is of practical interest: CRA is a simple, implementable scheduling rule that can substantially improve the delay-reliability trade-off for RTA traffic in 802.11ax, a topic that is central to the IEEE 802.11 RTA TIG and follow-on standards work. The algorithm concept is reasonable, and the qualitative comparison against UORA is plausible. However, the quantitative reliability claim (the headline 99.999% figure) rests on strong modeling simplifications and limited statistical reporting, so the current evidence does not yet support the stated significance.","major_comments":[{"comment":"The assumption that \"frames can be lost only when two or more STAs transmit in the same RU, i.e., in case of collision\" is load-bearing for the central 99.999% reliability claim. The paper's stated target PLR is 10^-5 (Section I), and CRA addresses only collisions. In a real 802.11ax channel, nonzero frame error rates from noise, interference, and decoding failures are unavoidable; even a per-transmission FER on the order of 10^-5 would double the end-to-end loss probability, and realistic indoor FERs of 10^-4 to 10^-2 would make the target unachievable regardless of collision resolution. The paper provides no sensitivity analysis or discussion of this limitation. Please either incorporate a channel-error component into the model or explicitly scope the claimed reliability to collision-only losses.","section":"Section III (Problem Statement)"},{"comment":"The paper reports P_late = 0 for N < (F_max - f) * 2 without stating the number of simulation runs or any confidence intervals. Observing zero late packets in M trials only gives an upper-bound estimate of the true probability (approximately 3/M at 95% confidence), so a zero value cannot by itself establish a 10^-5 reliability level. Without knowing M, the claim of \"a wide range of users\" satisfying the 1 ms/99.999% requirement is not quantitatively supported. The authors should report the number of independent replications, provide confidence intervals, and run enough trials (at least on the order of 3.0×10^5, preferably more) so that zero observations are consistent with the target PLR.","section":"Section IV (Numerical Results), Fig. 5"},{"comment":"The simulation setup is underspecified: no simulator platform, PHY/MAC parameters beyond slot duration and F_max, generation details for saturated non-RTA flows, traffic arrival model details, or number of random seeds are given. This prevents reproduction and makes it difficult to assess whether the quantitative tail probabilities shown in Fig. 5 are sensitive to these choices. Please provide a complete and reproducible simulation configuration and, if feasible, a basic sensitivity analysis around the key parameters (slot duration, F_max, lambda, and the number of RTA stations).","section":"Section IV (Numerical Results)"}],"minor_comments":[{"comment":"The sentence \"This allows the STA using all the RU allocated for RA is in the nearest slot\" is unclear and should be rewritten, for example to \"This allows a STA to use any RU allocated for RA in the nearest slot.\"","section":"Section II (UORA description)"},{"comment":"The phrase \"In there are some collisions in the previous slot\" contains a typo and should read \"If there are some collisions in the previous slot.\"","section":"Section III (CRA description)"},{"comment":"The statement \"For UORA, lower P_late is achieved with a lower number of RUs used in random access\" is ambiguous and appears to conflict with the average-delay trend in Fig. 4, where larger f gives lower delay. Please clarify the relationship between f and P_late for UORA.","section":"Section IV (Fig. 5 discussion)"},{"comment":"Reference [4] is cited as \"(In press)\"; please update the citation to the final publication details if available.","section":"References"}],"recommendation":"major_revision","confidential_remarks":"This is a short conference paper with a useful algorithmic idea, but the headline 99.999% reliability claim is currently supported only by a collision-only simulation with no error modeling and no confidence intervals on the tail probabilities. The authors should be given the opportunity to strengthen the evidence by reporting run counts/confidence intervals and by discussing or modeling channel errors. If the statistical issues are not fixable within a revision, the claims should be weakened accordingly; the qualitative comparison with UORA is likely to survive regardless."},"author_rebuttal":null,"desk_editor":{"model":"deepseek-v4-flash","letter":"Colleague,\n\nThe paper proposes CRA, a hybrid OFDMA scheduler for 802.11ax that keeps a few random-access RUs and switches to a deterministic polling cycle when collisions are detected. That's a genuinely new combination, and it's simple enough to take seriously. The authors also do the right thing comparing against the standard UORA baseline, and they vary the f parameter rather than fitting it. For a short conference paper, the algorithmic idea is the strongest part.\n\nThe soft spots are real, and they line up with the stress-test note. First, the model assumes frames are lost only when two stations pick the same RU. That removes channel errors entirely. For a 99.999% reliability target, even a small physical-layer error rate dominates the packet loss budget. CRA only fixes collisions; it does nothing for corrupted frames. The paper should at least show how much channel error budget is left, or state the assumption as an upper-bound claim.\n\nSecond, the headline result that CRA achieves zero late packets for a range of station counts is presented with no confidence intervals, no run counts, and no simulator description. Observing zero events in a finite number of trials does not establish a 10^-5 probability. This is a load-bearing issue for the paper's main conclusion, not just a cosmetic gap. The delay and throughput curves in Fig. 4-6 are consistent with the qualitative story, but the quantitative claim needs a much more careful treatment.\n\nThird, and more minor, the paper is thin on the simulation setup. Slot duration 250 us, Fmax 18, lambda 200 s^-1 are given, but not the number of runs, the seeding, or the simulator platform. That makes the results hard to reproduce.\n\nOverall, I think the algorithm is worth pursuing and the paper is a legitimate contribution at the level of an idea, but the evidence is not yet at the level of the reliability claim. I'd send it to peer review — the idea deserves referee time — but I'd expect major revision on the simulation methodology and a clear statement about what the collision-only bound does and does not guarantee.\n\nFor you: if you work on 802.11ax scheduling, it's worth a read as a proposal. I wouldn't cite it as evidence of reliability, only as an algorithm concept.","headline":"Sensible hybrid OFDMA scheduler for real-time traffic, but the simulation evidence is too thin to support the 99.999% reliability headline.","tokens_in":5338,"tokens_out":2019,"would_cite":false,"duration_ms":16641,"reading_group":"maybe","serious_thinker":"yes","would_accept_peer_review":true},"rs_alignment":null,"lean_confirmation":null,"pith_extraction":{"msc":[],"pacs":[],"model":"deepseek-v4-flash","headline":"A collision-triggered cycling scheduler can give 802.11ax real-time uplinks 1 ms delay at 99.999% reliability.","keywords":["802.11ax","OFDMA","uplink resource allocation","real-time applications","low-latency Wi-Fi","UORA","scheduling algorithm"],"falsifier":"Run the same scenario with a non-zero per-packet channel error rate, for example $10^{-3}$ independent frame or bit errors, and count packets that exceed 1 ms. If CRA's late-packet fraction no longer stays below $10^{-5}$ for the station counts where the paper reports zero late packets, the claim holds only under a collision-only physical layer.","tokens_in":4346,"feed_emoji":"📡","tokens_out":5473,"duration_ms":325119,"temperature":0.7,"pith_summary":"The paper asks whether uplink OFDMA in 802.11ax can carry real-time applications that demand packet delivery within 1 ms with 99.999% probability. It answers yes, with a scheduling algorithm named CRA, and supports the answer with simulation comparing it against the standard UORA random-access procedure. CRA sets aside a few resource units for immediate random access and, when collisions appear, temporarily switches to deterministic round-robin assignments until the backlog clears. The paper reports that CRA keeps the late-packet fraction at zero for a wide range of traffic loads and reduces delays by orders of magnitude, while UORA cannot meet the reliability target except in narrow configurations. If the claim is right, an access-point-side scheduler alone can make Wi-Fi carry industrial and interactive real-time traffic without dedicating the entire channel.","feed_headline":"Wi-Fi scheduler hits 1 ms latency for 99.999% of packets","feed_subtitle":"A collision-triggered cycling scheme beats standard random access while sparing ordinary traffic.","key_machinery":"The central mechanism is the collision-triggered deterministic cycling of CRA. A collision in the random-access pool is treated as a signal that some station is waiting, so the AP responds by enumerating all RTA stations in a randomly shuffled cyclic order, giving each a collision-free RU in turn, and only returns to pure random access once a slot passes without collisions. The random-access pool absorbs new arrivals with zero backoff, while the deterministic cycle converts an anonymous collision into an ordered resolution that cannot keep colliding. This two-phase design is what carries the argument: it yields the 99.999% reliability plateau and the bandwidth efficiency the paper reports.","core_discovery":"CRA is a slot-by-slot resource allocation scheme operating at the access point. In every OFDMA slot the AP sets aside f of the Fmax available smallest 26-tone resource units for UORA-style random access with the OBO window set to zero, so a station with a fresh frame can transmit in the very next slot. If a slot shows no collisions, the next slot again uses only random-access units. If a collision occurs, the AP starts a deterministic cycle: it assigns the remaining Fmax-f units to stations in randomly shuffled order, one group per slot, until a collision-free slot signals that the backlog is gone. The paper's central claim is that this hybrid keeps the probability of an RTA packet exceeding 1 ms below $10^{-5}$ for station counts up to about (Fmax-f)*2, while UORA fails that target except when nearly the whole channel is used for random access. The bandwidth left for non-RTA traffic stays close to maximal because deterministic access is used only after collisions.","pith_inferences":["A natural next step is to derive a closed-form bound on the late-packet probability from the assumption that collisions are the only loss mechanism; the plateau at (Fmax-f)*2 suggests such a bound would be tight.","In a real channel with bit errors and interference, the 99.999% target would fail because CRA only removes collision losses; the algorithm would need to be paired with per-link retransmission or link adaptation to reach the same reliability.","The collision-triggered switch from contention to deterministic polling is a general pattern that could be ported to other OFDMA-based uplinks that expose a collision signal.","The use of zero OBO windows means the algorithm assumes standard UORA behavior can be configured to immediate access; a testbed would need to confirm such configurations are actually supported by 802.11ax chipsets."],"forward_implications":["CRA, being an AP-side scheduler, can meet the 1 ms / 99.999% target for uplink RTA traffic without reserving the entire channel; non-RTA throughput is only slightly reduced.","The late-packet fraction stays at zero while the number of RTA stations is below (Fmax - f)*2, then rises sharply, so capacity can be dimensioned by that threshold.","Larger f lowers average delay, because stations can often succeed immediately in random access instead of waiting for a deterministic turn.","Standard UORA is unsuitable for RTA because its late-packet fraction degrades suddenly as station count grows and only meets the target when nearly all RUs are random-access units."],"supporting_citations":[{"why":"Defines the target use cases of real-time applications in Wi-Fi.","marker":"[1]"},{"why":"Supplies the industrial automation latency and reliability requirements motivating the problem.","marker":"[2]"},{"why":"Motivates time-sensitive networking in Wi-Fi as background for RTA support.","marker":"[3]"},{"why":"Establishes the difficulty of enabling real-time applications in Wi-Fi and provides a prior approach to build on.","marker":"[4]"},{"why":"Provides the OFDMA, trigger frame, resource unit, and UORA operation model used in the simulation.","marker":"[5]"},{"why":"Supplies the RTA TIG evaluation and requirements (1 ms delay, 99.999% reliability) the paper targets.","marker":"[6]"}],"fun_headline_variants":["Collision-triggered cycling keeps Wi-Fi under 1 ms for 99.999%","New OFDMA scheme: 1 ms latency, 99.999% reliability, minimal throughput loss","CRA scheduler: real-time Wi-Fi with 99.999% reliability under 1 ms","Hybrid OFDMA allocator trims delays for real-time Wi-Fi traffic","Wi-Fi uplink: collision-triggered cycling beats UORA for low latency"],"cache_read_input_tokens":3200,"weakest_assumption_plain":"The paper assumes packets are lost only when two or more stations transmit in the same resource unit; real-world channel errors, interference, and decoding failures are absent from the model.","fun_headline_variants_meta":{"raw":{"variants":["Collision-triggered cycling keeps Wi-Fi under 1 ms for 99.999%","New OFDMA scheme: 1 ms latency, 99.999% reliability, minimal throughput loss","CRA scheduler: real-time Wi-Fi with 99.999% reliability under 1 ms","Hybrid OFDMA allocator trims delays for real-time Wi-Fi traffic","Wi-Fi uplink: collision-triggered cycling beats UORA for low latency"]},"model":"deepseek-v4-flash","effort":"low","cost_usd":0.000802,"raw_usage":{"total_tokens":3494,"prompt_tokens":884,"completion_tokens":2610,"prompt_tokens_details":{"cached_tokens":384},"prompt_cache_hit_tokens":384,"prompt_cache_miss_tokens":500,"completion_tokens_details":{"reasoning_tokens":2491}},"tokens_in":500,"tokens_out":2610,"duration_ms":17214,"temperature":1.0,"reasoning_tokens":2491,"cache_read_input_tokens":384,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-08-14T05:41:23.346764+00:00","model_set":{"reader":"deepseek-v4-flash"},"falsifier":"Run the same scenario with a non-zero per-packet channel error rate, for example $10^{-3}$ independent frame or bit errors, and count packets that exceed 1 ms. If CRA's late-packet fraction no longer stays below $10^{-5}$ for the station counts where the paper reports zero late packets, the claim holds only under a collision-only physical layer.","supporting_citations":[{"cited_title":"[Online]","cited_arxiv_id":null,"evidence_quote":"Defines the target use cases of real-time applications in Wi-Fi."},{"cited_title":"[Online]","cited_arxiv_id":null,"evidence_quote":"Supplies the industrial automation latency and reliability requirements motivating the problem."},{"cited_title":"[Online]","cited_arxiv_id":null,"evidence_quote":"Motivates time-sensitive networking in Wi-Fi as background for RTA support."},{"cited_title":"En- abling real-time applications in Wi-Fi networks,","cited_arxiv_id":null,"evidence_quote":"Establishes the difficulty of enabling real-time applications in Wi-Fi and provides a prior approach to build on."},{"cited_title":"A Tutorial on IEEE 802.11ax High Efficiency WLANs,","cited_arxiv_id":null,"evidence_quote":"Provides the OFDMA, trigger frame, resource unit, and UORA operation model used in the simulation."},{"cited_title":"[Online]","cited_arxiv_id":null,"evidence_quote":"Supplies the RTA TIG evaluation and requirements (1 ms delay, 99.999% reliability) the paper targets."}],"review_version":1}