Design and construction of protocol sequences: Shift invariance and user irrepressibility
Authors:
- 1 June 2009
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1368-1372
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.Keywords
This publication has 12 references indexed in Scilit:
- Shift-Invariant Protocol Sequences for the Collision Channel Without FeedbackIEEE Transactions on Information Theory, 2009
- Constructions of Robust Protocol Sequences for Wireless Sensor and Ad hoc NetworksIEEE Transactions on Vehicular Technology, 2008
- Constant Weight Conflict-Avoiding CodesSIAM Journal on Discrete Mathematics, 2008
- New Protocol Sequences for Random-Access Channels Without FeedbackIEEE Transactions on Information Theory, 2007
- Protocol sequences for collision channelwithout feedbackElectronics Letters, 2000
- Constructions of binary constant-weight cyclic codes and cyclically permutable codesIEEE Transactions on Information Theory, 1992
- A Classical Introduction to Modern Number Theory1990
- The collision channel without feedbackIEEE Transactions on Information Theory, 1985
- Prime sequences: quasi-optimal sequences for OR channel code division multiplexingElectronics Letters, 1983
- Absch tzung der asymptotischen Dichte von SummenmengenMathematische Zeitschrift, 1953