Completely Irrepressible Sequences for Multiple-Packet Reception

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 desi...

Full description

Saved in:
Bibliographic Details
Published in:IEEE transactions on vehicular technology 2016-08, Vol.65 (8), p.6803-6809
Main Authors: Zhang, Yijin, Lo, Yuan-Hsun, Wong, Wing Shing
Format: Article
Language:English
Subjects:
Asymptotic properties
Channels
Collision channel
Delay
Delays
Hamming weight
Media Access Protocol
multiple-packet reception (MPR)
Packet transmission
protocol sequences
Random access
Receivers
Remote sensors
Sequences
Simulation
time synchronization
Upper bound
Wireless sensor networks
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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 ≤ γ
ISSN:0018-9545
1939-9359
DOI:10.1109/TVT.2015.2478895