A Protocol for Topology-Dependent Transmission Scheduling in Wireless Networks

Abstract

A new channel access protocol for ad-hoc networks based on topology-dependent transmission scheduling, named collision-avoidance time allocation (CATA), is introduced. CATA allows nodes to contend for and reserve time slots by means of a distributed reservation and handshake mechanism. Contention is limited among nodes within two hops of one another, which provides a very efficient spatial reuse of the bandwidth available. CATA ensures that no collisions occur in successfully reserved time slots, even when hidden terminals exist. Reservations in CATA support unicasting, multicasting and broadcasting simultaneously, and adapt to dynamic service time. The throughput achieved by CATA is analyzed for the case of a fully-connected network topology. Numerical results show that CATA can achieve very high throughput.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Jan 01, 1999
Accession Number
ADA461712

Entities

People

  • J.J. Garcia-Luna-Aceves
  • Zhenyu Tang

Organizations

  • University of California, Santa Cruz

Tags

DTIC Thesaurus Topics

  • Ad Hoc Networks
  • Broadcasting
  • Collision Avoidance
  • Collisions
  • Computer Access Control
  • Data Transmission
  • Engineering
  • Markov Chains
  • Mesh Networks
  • Multiple Access
  • Networks
  • Probability
  • Radio Equipment
  • Scheduling (Production)
  • Terminals
  • Throughput
  • Topology

Fields of Study

  • Computer science

Readers

  • Computer Networking