Distributed Dynamic Channel Access Scheduling for Ad Hoc Networks

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 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. In multihop wireless networks, the only required information for each entity is the identifiers of its neighbors one and two hops away. 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.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Mar 15, 2002
Accession Number
ADA461740

Entities

People

  • J.J. Garcia-Luna-Aceves
  • Lichun L. Bao

Organizations

  • University of California, Santa Cruz

Tags

Communities of Interest

  • Energy and Power Technologies

DTIC Thesaurus Topics

  • Ad Hoc Networks
  • Algorithms
  • Code Division Multiple Access
  • Computer Networks
  • Engineering
  • Mesh Networks
  • Multiple Access
  • Multiplexing
  • Network Topology
  • Networks
  • Probability
  • Scheduling (Production)
  • Time Division Multiple Access
  • Transmitters
  • Wireless Networks

Fields of Study

  • Computer science

Readers

  • Applied Combinatorial Optimization and Logic Circuit Design.
  • Database Systems and Applications
  • Radio communications and signal processing.