Fair Channel Access Scheduling in Ad Hoc Wireless Networks

The patent applies preliminary action by having nodes calculate and set backoff values before attempting channel access. The scheduling algorithm computes expected channel uses for each node based on normalized traffic and service tags, then converts these to backoff values that nodes use to wait before transmitting. This pre-calculated waiting period balances channel access opportunities among nodes, preventing unfair dominance by certain nodes while maintaining high throughput.

The patent implements preliminary action by requiring nodes to calculate and wait for a predetermined backoff period before accessing the channel, even when the channel appears free. This backoff value is computed based on the node's normalized traffic and service tags, representing the expected number of channel uses other nodes will need. By waiting this calculated period in advance, nodes prevent collisions with hidden terminals while maintaining efficient channel utilization.

The patent applies self-service by having each node independently calculate its own backoff value and the backoff values of its neighbors using the distributed scheduling algorithm. Nodes use their own normalized traffic measurements and service tags to compute expected channel uses, then convert these to backoff values without requiring centralized coordination. This self-service approach achieves fair channel access while keeping individual node complexity manageable, as each node performs local calculations based on available information.