Sciweavers

SETA
2010
Springer

User-Irrepressible Sequences

13 years 3 months ago
User-Irrepressible Sequences
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 userirrepressibility, 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 constru...
Kenneth W. Shum, Yijin Zhang, Wing Shing Wong
Added 30 Jan 2011
Updated 30 Jan 2011
Type Journal
Year 2010
Where SETA
Authors Kenneth W. Shum, Yijin Zhang, Wing Shing Wong
Comments (0)