.png){kind=icon}
.png){kind=icon}
Return
Completely Irrepressible Sequences for Multiple-Packet Reception
.png){kind=icon}
PRE
AI
DOI：10.1109/TVT.2015.2478895.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
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 (MPR) capability gamma, 2 <= gamma < K. That is, a packet transmission is successful if and only if the total number of transmissions in the channel at any point in time during its transmission is less than or equal to gamma. We investigate the minimum period L of CI sequences for MPR as L is a fundamental factor that affects the worst-case delay. The main result is that L is asymptotically upper bounded by 2K(2)/(gamma-2) when gamma >= 3. For gamma = 2, the corresponding bound is 2K(2). In contrast, the bound for the single-packet reception system (gamma = 1) is 4K(2). 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.
Keywords:
Collision channel
multiple-packet reception (MPR)
protocol sequences
time synchronization
Journal
IF:
7.1
Papers:
1.8W
Citations:
6.6W