Completely Irrepressible Sequences for Multiple-Packet Reception
Yijin Zhang, Yuan–Hsun Lo, Wing Shing Wong · IEEE Transactions on Vehicular Technology · 2015
In this paper, we study completely irrepressible (CI) sequences. For a slot-asynchronous communication system supporting K users with such sequences, a key feature is that each user is guaranteed to be able to send out at least one contention-free packet in one common sequence period. This is a desirable property since it provides a bounded delay guarantee for medium access control (MAC) layer contention, in contrast to random access schemes. Generalizing previous studies on CI sequences, we investigate systems endowed with multiple-packet reception (B.3) (MPR) capability γ, 2 ≤ γ2/(γ - 2) when γ ≥ 3. For γ = 2, the corresponding bound is 2K2. In contrast, the bound for the single-packet reception system (γ = 1) is 4K2. Simulation results verify our analysis and present comparative studies between CI sequences and random access in an application of group-based detection in a wireless sensor network.