Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Aigner, M., Ziegler, G.M.: Proofs from THE BOOK, 3rd edn. Springer, New York (2004)
Chen, C.S., Shum, K.W., Sung, C.W., Wong, W.S., Øien, G.E.: User unsuppressible protocol sequences for collision channel without feedback. In: Proc. IEEE Int. Symp. Inform. Theory and its Applications, Auckland, pp. 1213–1218 (December 2008)
Erdős, P., Frankl, P., Füredi, Z.: Family of finite sets in which no set is covered by the union of r others. Israel J. of Math. 51(1-2), 79–89 (1985)
Jimbo, M., Mishima, M., Janiszewski, S., Teymorian, A.Y., Tonchev, V.D.: On conflict-avoiding codes of length n = 4m for three active users. IEEE Trans. Inform. Theory 53, 2732–2742 (2007)
Massey, J.L., Mathys, P.: The collision channel without feedback. IEEE Trans. Inform. Theory 31(2), 192–204 (1985)
Momihara, K., Müller, M., Satoh, J., Jimbo, M.: Constant weight conflict-avoiding codes. SIAM J. Discrete Math. 21(4), 959–979 (2007)
Roedig, U., Barroso, A., Sreenan, C.J.: f-MAC: A deterministic media access control protocol without time synchronization. In: Römer, K., Karl, H., Mattern, F. (eds.) EWSN 2006. LNCS, vol. 3868, pp. 276–291. Springer, Heidelberg (2006)
Sarwate, D.V., Pursley, M.B.: Crosscorrelation properties of pseudorandom and related sequences. Proc. IEEE 68(5), 593–619 (1980)
Shum, K.W., Chen, C.S., Sung, C.W., Wong, W.S.: Shift-invariant protocol sequences for the collision channel without feedback. IEEE Trans. Inform. Theory 55, 3312–3322 (2009)
Shum, K.W., Wong, W.S., Sung, C.W., Chen, C.S.: Design and construction of protocol sequences: Shift invariance and user irrepressibility. In: IEEE Int. Symp. Inform. Theory, Seoul, pp. 1368–1372 (June 2009)
Wong, W.S.: New protocol sequences for random access channels without feedback. IEEE Trans. Inform. Theory 53(6), 2060–2071 (2007)
Yang, G.C., Kwong, W.C.: Performance analysis of optical CDMA with prime codes. IEE Electron. Lett. 31(7), 569–570 (1995)
Yang, G.Z. (ed.): Body Sensor Networks. Springer, London (2006)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Shum, K.W., Zhang, Y., Wong, W.S. (2010). User-Irrepressible Sequences. In: Carlet, C., Pott, A. (eds) Sequences and Their Applications – SETA 2010. SETA 2010. Lecture Notes in Computer Science, vol 6338. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-15874-2_7
Download citation
DOI: https://doi.org/10.1007/978-3-642-15874-2_7
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-15873-5
Online ISBN: 978-3-642-15874-2
eBook Packages: Computer ScienceComputer Science (R0)