A New Approach to 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 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.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Jan 01, 2001
Accession Number
ADA461671

Entities

People

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

Organizations

  • University of California, Santa Cruz

Tags

Communities of Interest

  • Energy and Power Technologies
  • Ground and Sea Platforms

DTIC Thesaurus Topics

  • Abstracts
  • Ad Hoc Networks
  • Algorithms
  • Bandwidth
  • Code Division Multiple Access
  • Collisions
  • Computer Networks
  • Mesh Networks
  • Multiple Access
  • Multiplexing
  • Network Topology
  • Networks
  • Probability
  • Simulations
  • Throughput
  • Time Division Multiple Access
  • Wireless Networks

Fields of Study

  • Computer science

Readers

  • Computer Networking