Three types of collision-free channel access protocols for ad hoc networks are presented. These protocols are derived from a novel approach to contention resolution that allows contending entities to elect one or multiple winners for channel access in any given contention context (e.g., a time slot) in a distributed fashion. The only required information for each entity is the identifiers of its neighbors one and two hops away in the wireless network. The new protocols are shown to be fair and capable of achieving maximal utilization of the channel bandwidth. The delay and throughput characteristics of the contention resolution algorithms are analyzed, and the performance of the three types of channel access protocols is studied by simulations and compared with that of optimal static scheduling algorithms. (C) 2002 Published by Elsevier Science (USA). References: 30
展开▼
