TY - GEN
T1 - Design and construction of protocol sequences
T2 - 2009 IEEE International Symposium on Information Theory (ISIT 2009)
AU - Shum, Kenneth W.
AU - Wong, Wing Shing
AU - Sung, Chi Wan
AU - Chen, Chung Shue
PY - 2009
Y1 - 2009
N2 - 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. © 2009 IEEE.
AB - 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. © 2009 IEEE.
UR - https://www.scopus.com/pages/publications/70449495598
UR - https://www.scopus.com/record/pubmetrics.uri?eid=2-s2.0-70449495598&origin=recordpage
U2 - 10.1109/ISIT.2009.5205912
DO - 10.1109/ISIT.2009.5205912
M3 - RGC 32 - Refereed conference paper (with host publication)
SN - 9781424443130
SP - 1368
EP - 1372
BT - IEEE International Symposium on Information Theory - Proceedings
Y2 - 28 June 2009 through 3 July 2009
ER -