Distributed Channel Access Scheduling for Ad Hoc Networks
In this paper, the authors present and analyze protocols for Time-Division Multiple Access (TDMA) scheduling in ad hoc networks with omni-directional antennas. These protocols use a Neighbor-aware Contention Resolution (NCR) algorithm to elect deterministically one or multiple winners in a given contention context based on the topology information within two hops. In NCR, the identifiers and the current contention context number are used to derive a randomized priority for each contender in a given contention context. A contention context corresponds to a time slot in time-division multiple access schemes, and the contenders of a given node during a contention context are those nodes one and two hops away from the node.