Design and construction of protocol sequences: shift invariance and user irrepressibility

  • Authors:

  • Kenneth W. Shum;Wing Shing Wong;Chi Wan Sung;Chung Shue Chen

  • Affiliations:

  • Dept. of Information Engineering, The Chinese University of Hong Kong, Shatin, Hong Kong;Dept. of Information Engineering, The Chinese University of Hong Kong, Shatin, Hong Kong;Dept. of Electronic Engineering, City University of Hong Kong, Kowloon, Hong Kong;Centrum Wiskunde & Informatica, Amsterdam, The Netherlands

  • Venue:
  • ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 2
  • Year:
  • 2009

Quantified Score

Hi-index 0.06

Visualization

Abstract

Protocol sequences are used for channel access in the collision channel without feedback. Each user is assigned a deterministic zero-one pattern, called protocol sequence. The zeros and ones in a protocol sequence are read out periodically, and a packet is sent if and only if it is one. A collision occurs if two or more users transmit at the same time. Due to the lack of feedback from the receiver and cooperation among users, the beginning of the protocol sequences cannot be synchronized and relative delay offsets are incurred. We study the design of protocol sequences from two different perspectives. Under the first one, called shift invariance, we aim at minimizing the fluctuation of throughput due to relative delay offsets. As for the second one, called user irrepressibility, we want to guarantee that each user can send at least one packet successfully in each period. For both design criteria, we derive a lower bound on sequence period and give an optimal construction that achieves this lower bound.