Accession Number:

ADA056550

Title:

Multiple-Coupled Random Access Techniques for Packet Radio Networks

Personal Author(s):

Corporate Author:

MASSACHUSETTS INST OF TECH CAMBRIDGE ELECTRONIC SYSTEMS LAB

Report Date:

1978-06-01

Abstract:

The random accessing problem for packet radio networks is considered. The contention resolving tree algorithm of Capetanakis is applied to a model in which packets are transmitted by terminals and received by repeaters, with the possibility of geometries in which more than one repeater hears a single terminal. It is shown that naive applications of the tree algorithm of this multiple-coupled random access problem lead to algorithms which deadlock. A deadlock-free algorithm, restricted-entry algorithm for the multiple-coupled random access problem, is developed. The deadlock-free property is proved. An algorithm describing how new terminals join the network is presented.

Descriptive Note:

Technical rept.

Supplementary Note:

DOI: 10.21236/ADA056550

Pages:

0066

Communities Of Interest:

Distribution Statement:

Approved for public release; distribution is unlimited.

Contract Number:

N00014-75-C-1183

Contract Number 2:

ARPA ORDER-3045

File Size:

4.59MB