A new approach to channel access scheduling for Ad Hoc networks

  • Authors:
  • Lichun Bao;J. J. Garcia-Luna-Aceves

  • Affiliations:
  • Computer Science Department, University of California, Santa Cruz, CA;Computer Engineering Department, University of California, Santa Cruz, CA

  • Venue:
  • Proceedings of the 7th annual international conference on Mobile computing and networking
  • Year:
  • 2001

Quantified Score

Hi-index 0.00

Visualization

Abstract

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 each node to elect deterministically one or multiple winners for channel access in a given contention context (e.g., a time slot), given the identifiers of its neighbors one and two hops away. The new protocols are shown to be fair and capable of achieving maximum 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.