Three types of collision-free channel access protocols for adhoc networks are presented. These protocols are derivedfrom a novel approach to contention resolution that allowseach node to elect deterministically one or multiple winnersfor channel access in a given contention context (e.g., a timeslot), given the identifiers of its neighbors one and two hopsaway. The new protocols are shown to be fair and capableof achieving maximum utilization of the channel bandwidth.The delay and...