PROJECT TITLE :

Protocol Sequences for the Multiple-Packet Reception Channel Without Feedback

ABSTRACT:

Consider a time-slotted Communication channel that is shared by active users transmitting to one receiver. It is assumed that the receiver has the ability of the multiple-packet reception to properly receive up to ( ) simultaneously transmitted packets. Each user accesses the channel following a deterministic binary sequence, referred to as the protocol sequence, and transmits a packet inside a channel slot if the sequence price is equal to one. If the users don't seem to be time synchronized, the relative shifts among them can cause vital fluctuation in throughput. If the throughput of each user is independent of relative shifts, then the adopted protocol sequence set is claimed to be throughput-invariant (TI). If we outline worst-case system throughput because the minimal system throughput that may be guaranteed for any set of relative shifts, then TI sequences maximize it and hence are of basic interest. This paper investigates TI sequences for . Several new results are obtained together with throughput price as a operate of the duty factors, a lower bound on the sequence period, a construction that achieves the lower bound on the sequence amount, and theorems on the intrinsic structure that establish connections with some other families of binary sequences.