Advertisement

User-Irrepressible Sequences

  • Kenneth W. Shum
  • Yijin Zhang
  • Wing Shing Wong
Part of the Lecture Notes in Computer Science book series (LNCS, volume 6338)

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.

Keywords

Protocol sequences conflict-avoiding codes collision channel without feedback 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Aigner, M., Ziegler, G.M.: Proofs from THE BOOK, 3rd edn. Springer, New York (2004)Google Scholar
  2. 2.
    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)Google Scholar
  3. 3.
    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)CrossRefGoogle Scholar
  4. 4.
    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)CrossRefMathSciNetGoogle Scholar
  5. 5.
    Massey, J.L., Mathys, P.: The collision channel without feedback. IEEE Trans. Inform. Theory 31(2), 192–204 (1985)zbMATHCrossRefMathSciNetGoogle Scholar
  6. 6.
    Momihara, K., Müller, M., Satoh, J., Jimbo, M.: Constant weight conflict-avoiding codes. SIAM J. Discrete Math. 21(4), 959–979 (2007)zbMATHCrossRefMathSciNetGoogle Scholar
  7. 7.
    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)CrossRefGoogle Scholar
  8. 8.
    Sarwate, D.V., Pursley, M.B.: Crosscorrelation properties of pseudorandom and related sequences. Proc. IEEE 68(5), 593–619 (1980)CrossRefGoogle Scholar
  9. 9.
    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)CrossRefMathSciNetGoogle Scholar
  10. 10.
    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)Google Scholar
  11. 11.
    Wong, W.S.: New protocol sequences for random access channels without feedback. IEEE Trans. Inform. Theory 53(6), 2060–2071 (2007)CrossRefMathSciNetGoogle Scholar
  12. 12.
    Yang, G.C., Kwong, W.C.: Performance analysis of optical CDMA with prime codes. IEE Electron. Lett. 31(7), 569–570 (1995)CrossRefGoogle Scholar
  13. 13.
    Yang, G.Z. (ed.): Body Sensor Networks. Springer, London (2006)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2010

Authors and Affiliations

  • Kenneth W. Shum
    • 1
  • Yijin Zhang
    • 1
  • Wing Shing Wong
    • 1
  1. 1.Department of Information Engineeringthe Chinese University of Hong KongShatinHong Kong

Personalised recommendations