CRT Sequences for Medium Access Control

摘要

This paper considers a protocol-sequence-based media access control (MAC) scheme, where each user is assigned with a periodic binary protocol sequence and accesses the channel according to the sequence pattern. A user sends a packet if the sequence value is one and keeps silent if the sequence value is zero. It is assumed that any two or more packets overlapping in time result in a collision, and the collided packets are lost. The Hamming cross-correlation that counts the overlapping ones of the sequences become important in determining the throughput performance. In this paper, we investigate a family of protocol sequences whose construction are based on the Chinese remainder theorem (CRT), and hence the sequences are called CRT sequences. We study the general order Hamming cross-correlation of CRT sequences and establish a geometric way to find out the values.