Random Access Transmission Algorithms for Data Local Area Networks

Abstract

The objective of this research is to address some of the fundamental issues that arise in the modeling, analysis and design of interconnected wire and radio Local Area Networks (LANs). In the case of wire LANs, the individual LANs are interconnected through store-and-forward devices, which relay packets between adjacent LANs and route them to their final destination. In radio networks, we are concerned with multi-hop packet radio networks that consist of a collection of interconnected local clusters; a local cluster is a single-hop network in which the (possibly mobile) users are within transmission range of each other. The local cluster interconnection is provided by relay nodes that belong to the intersection of two or more local clusters, or by special bridge nodes if local clusters are disjoint. The focus of the research is on the mutual impact of interconnection and access protocols, possible network architectures for interconnecting devices and backbone networks, routing policies, and flow and network-access control for congestion prevention and performance optimization. Keywords: Single-hop random access networks, Dynamically adaptive transmissions.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Oct 24, 1989
Accession Number
ADA216443

Entities

People

  • P. Papantoni-kazakos

Tags

Communities of Interest

  • C4I

DTIC Thesaurus Topics

  • Algorithms
  • Classification
  • Command And Control
  • Computer Access Control
  • Computer Networks
  • Computing System Architectures
  • Congestion
  • Contracts
  • Control Systems
  • Corporations
  • Local Area Networks
  • Multiple Access
  • Multiplexing
  • Network Architecture
  • Networks
  • Spine
  • Topology

Fields of Study

  • Computer science

Readers

  • Computer Networking