On the Effect of Redundancy on the Multiple Access Broadcast Channel

Abstract

We consider strategies for transmitting packets over a multiple access broadcast channel. In the strategies considered, a message is formatted into K packets and N-K redundant packets are added to these K packets to form what we call a superpacket. We propose a simple coding scheme that sets these N packets of a superpacket into a special temporal pattern. With a superpacket constructed in this manner, it is possible to reconstruct packets which are lost through collision on the channel with the packets of other superpackets. We compare the throughput of our scheme with that of the slotted Aloha scheme. We use as our retransmission strategy the conflict resolving tree algorithm of Capetanakis.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Aug 01, 1979
Accession Number
ADA073579

Entities

People

  • Oliver Chukwudi Ibe

Organizations

  • Massachusetts Institute of Technology

Tags

Communities of Interest

  • Materials and Manufacturing Processes
  • Space

DTIC Thesaurus Topics

  • Algorithms
  • Artificial Satellites
  • Coding
  • Collisions
  • Electrical Engineering
  • Electronics Laboratories
  • Engineering
  • Equations
  • Frequency Bands
  • Information Processing
  • Military Research
  • Multiple Access
  • New York
  • Numbers
  • Probability
  • Random Variables
  • Trees (Data Structures)

Fields of Study

  • Computer science

Readers

  • Computer Networking