HaLow Scale And RAW Windows
HaLow Scale And RAW Windows
Ada re-derives this chapter’s own numbers step by step, at full precision
ADA · CALCULATION AUDIT
HaLow Scale And RAW Windows
A smart-agriculture site spreads 2000 soil sensors across several hectares, and ordinary 2.4 GHz Wi-Fi cannot cover that range or device count from one access point. The chapter’s answer is a single HaLow access point that claims to track all 2000 stations using a 13-bit association ID and Restricted Access Window grouping. This audit asks the question that claim invites: do the addressing capacity and the RAW schedule actually support 2000 stations, or is the 8191-station ceiling just an address count?
Companion to the chapter Wi-Fi HaLow (802.11ah) for IoT — every number here comes from that chapter.
See the relationship before changing it
The figure reads from left to right. The blue card is raw groups. The middle card applies this page's rule. The green card is stations per group. Walk the arrows once: set the input, apply the rule, then read the result with its unit.
The retained audit below checks several chapter fixtures. This model keeps those stated values fixed and changes only raw groups, so the numeric fixture does not switch without explanation.
Derive the baseline in four named moves
- 1
Name the input. The chapter baseline is 20 groups.
- 2
Name the relationship. stations per group = 2,000 stations / RAW groups
- 3
Substitute with units. 2,000 / 20 = 100 stations per group
- 4
Read the result. Keep the unit beside the value. Use it only inside the technical boundary on this page.
Predict, then change raw groups
Try Predict the direction of stations per group = 2,000 stations / RAW groups. Test another raw groups, then compare stations per group.
Observe More RAW groups reduce the contenders in each scheduled window without creating more association IDs. Reset raw groups to 20 and compare stations per group.
Explain More RAW groups reduce the contenders in each scheduled window without creating more association IDs.
Check yourself
What should you do before trusting a moved-control result?
What does this small model leave out?
Derive the usable station ceiling from the 13-bit AID, then divide 2000 sensors into 20 RAW groups of 100.
The address space supports 8191 ordinary stations; each RAW window exposes only 5% of the fleet to contention, a 20× reduction from all 2000 at once.
Restricted Access Windows partition contenders in time, reducing simultaneous collision opportunities without changing the number of associated stations.
Ada: HaLow’s scale claim is not magic; it is addressing capacity plus scheduled contention. The chapter gives enough values to check both without inventing a data rate or battery-life number.
- A
13-bitAID field gives2^13 = 8192possible codes. With one code unavailable for ordinary station identity, the usable ceiling is8192 - 1 = 8191stations per AP. - The worked site has
2000soil sensors, so the association ledger uses2000 / 8191 = 0.244, or about24.4%of that address space. It leaves8191 - 2000 = 6191station identities, but address headroom is not airtime proof. - The channel-width set is
1, 2, 4, 8, 16 MHz; the widest listed channel is16 / 1 = 16times the narrowest. That is a width trade, not a universal range or throughput guarantee. - RAW grouping checks the contention pool:
2000sensors split into20groups gives2000 / 20 = 100sensors per group. - The same plan is
20separate windows because2000 / 100 = 20. During one RAW window, only100 / 2000 = 0.05, or5%, of the fleet is eligible to contend. - The scheduling reduction is
2000 / 100 = 20x: the AP has changed one large collision pool into twenty smaller pools. The release still needs measured retry, missed-window, downlink, and maintenance-update evidence.
The audit conclusion is bounded: the 13-bit AID explains the 8191 station ceiling, and 20 RAW groups of 100 sensors reduce per-window contention by 20x. Those calculations support a scale review, not an approval, until installed logs show the wake schedule and service traffic actually hold.
Every number above is taken from the chapter’s own material and re-derived step by step.
Technical boundaries: This capacity-and-grouping ledger omits PHY rate, frame airtime, RAW overhead, retry and missed-window probability, hidden nodes, downlink demand, roaming, firmware updates, and actual sleep current.