Constant Weight Conflict-Avoiding Codes
SIAM Journal on Discrete Mathematics
Shift-invariant protocol sequences for the collision channel without feedback
IEEE Transactions on Information Theory
Design and construction of protocol sequences: shift invariance and user irrepressibility
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 2
f-MAC: a deterministic media access control protocol without time synchronization
EWSN'06 Proceedings of the Third European conference on Wireless Sensor Networks
New Protocol Sequences for Random-Access Channels Without Feedback
IEEE Transactions on Information Theory
On Conflict-Avoiding Codes of Length n=4m for Three Active Users
IEEE Transactions on Information Theory
| Hi-index | 0.00 |
Protocol sequences are binary and periodic sequences used in multiple-access scheme for collision channel without feedback. Each user reads out the bits from the assigned protocol sequence periodically, and sends a packet whenever the bit is equal to one. It is assumed that any two or more packets overlapping in time result in a collision, and the collided packets are unrecoverable. Due to the lack of feedback and cooperation, there are some relative delay offsets between protocol sequences. We consider protocol sequences with the property, called user-irrepressibility, that each user is guaranteed to send at least one packet in each sequence period without collision, no matter what the delay offsets are. The period length is hence a measure of delay; each user need to wait no more than a period time before a successful transmission can be made. Our objective is to construct user-irrepressible sequences with sequence period as short as possible. In this paper, we present a new construction for prime number of users. A lower bound on period which is applicable in general for any number of users is also derived.