Construction of Short Protocol Sequences with Worst-Case Throughput Guarantee

TL;DR

This paper introduces a new method for constructing protocol sequences that guarantees worst-case throughput, using Chinese remainder theorem, resulting in shorter sequences and reduced implementation complexity.

Contribution

A novel construction of protocol sequences based on Chinese remainder theorem that guarantees worst-case throughput and shortens sequence length compared to existing methods.

Findings

Sequence period is significantly shorter than existing protocols.

Hamming crosscorrelation is concentrated around the mean.

Implementation complexity and waiting time are reduced.

Abstract

Protocol sequences are used in channel access for the multiple-access collision channel without feedback. A new construction of protocol sequences with a guarantee of worst-case system throughput is proposed. The construction is based on Chinese remainder theorem. The Hamming crosscorrelation is proved to be concentrated around the mean. The sequence period is much shorter than existing protocol sequences with the same throughput performance. The new construction reduces the complexity in implementation and also shortens the waiting time until a packet can be sent successfully.