A Time Slot Assignment Algorithm for a TDMA Packet Radio Network.

Abstract

An algorithm for the assignment of time slots within a Time Division Multiple Access (TDMA) scheme for an integrated voice and packet radio network is implemented in, and studied by, a computer simulation. The slot assignment scheme is applied both to a static network, where 'best path' routes ae held constant, and also to a network where the 'best path' routes are permitted to change dynamically during the simulation as communications capability at various nodes approaches saturation. The Dijkstra algorithm is used to determine and modify 'shortest distance' routes, and the sensitivity of performance to various parameters used in defining the link 'distance function' is investigated. The major conclusion is that it is possible to route in a way that reduces the average energy transmitted per message without substantially decreasing the network throughput. (Author)

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Mar 01, 1983
Accession Number
ADA128545

Entities

People

  • William Karl Tritchler

Organizations

  • Naval Postgraduate School

Tags

Communities of Interest

  • Cyber
  • Energy and Power Technologies

DTIC Thesaurus Topics

  • Bandwidth
  • Code Division Multiple Access
  • Computer Networks
  • Computer Simulations
  • Computers
  • Digital Communications
  • Electrical Engineering
  • Frequency Division Multiple Access
  • Military Communications
  • Multiple Access
  • Network Science
  • Packet Switching
  • Plastic Explosives
  • Radio Communications
  • Throughput
  • Time Division Multiple Access
  • Two Dimensional

Fields of Study

  • Computer science

Readers

  • Computational Modeling and Simulation
  • Mathematical Modeling and Probability Theory.
  • Positioning, Navigation, and Timing (PNT) Technology.