Unbounded Contention Resolution in Multiple-Access Channels

  • Antonio Fernández Anta
  • Miguel A. Mosteiro
  • Jorge Ramón Muñoz
Part of the Lecture Notes in Computer Science book series (LNCS, volume 6950)


A frequent problem in settings where a unique resource must be shared among users is how to resolve the contention that arises when all of them must use it, but the resource allows only for one user each time. The application of efficient solutions for this problem spans a myriad of settings such as radio communication networks or databases. For the case where the number of users is unknown, recent work has yielded fruitful results for local area networks and radio networks, although either a (possibly loose) upper bound on the number of users needs to be known [7], or the solution is suboptimal [2], or it is only implicit [11] or embedded [6] in other problems, with bounds proved only asymptotically. In this paper, under the assumption that collision detection or information on the number of contenders is not available, we present a novel protocol for contention resolution in radio networks, and we recreate a protocol previously used for other problems [11,6], tailoring the constants for our needs. In contrast with previous work, both protocols are proved to be optimal up to a small constant factor and with high probability for big enough number of contenders. Additionally, the protocols are evaluated and contrasted with the previous work by extensive simulations. The evaluation shows that the complexity bounds obtained by the analysis are rather tight, and that both protocols proposed have small and predictable complexity for many system sizes (unlike previous proposals).


Radio Network Time Slot Local Area Network Medium Access Control Protocol Collision Detection 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Balador, A., Movaghar, A., Jabbehdari, S.: History based contention window control in ieee 802.11 mac protocol in error prone channel. Journal of Computer Science 6, 205–209 (2010)CrossRefGoogle Scholar
  2. 2.
    Bender, M.A., Farach-Colton, M., He, S., Kuszmaul, B.C., Leiserson, C.E.: Adversarial contention resolution for simple channels. In: 17th Ann. ACM Symp. on Parallel Algorithms and Architectures, pp. 325–332 (2005)Google Scholar
  3. 3.
    Capetanakis, J.: Tree algorithms for packet broadcast channels. IEEE Trans. Inf. Theory IT-25(5), 505–515 (1979)MathSciNetCrossRefzbMATHGoogle Scholar
  4. 4.
    Chlebus, B.S.: Randomized communication in radio networks. In: Pardalos, P.M., Rajasekaran, S., Reif, J.H., Rolim, J.D.P. (eds.) Handbook on Randomized Computing, vol. 1, pp. 401–456. Kluwer Academic Publishers, Dordrecht (2001)CrossRefGoogle Scholar
  5. 5.
    Clementi, A., Monti, A., Silvestri, R.: Selective families, superimposed codes, and broadcasting on unknown radio networks. In: Proc. of the 12th Ann. ACM-SIAM Symp. on Discrete Algorithms, pp. 709–718 (2001)Google Scholar
  6. 6.
    Farach-Colton, M., Mosteiro, M.A.: Sensor network gossiping or how to break the broadcast lower bound. In: Tokuyama, T. (ed.) ISAAC 2007. LNCS, vol. 4835, pp. 232–243. Springer, Heidelberg (2007)CrossRefGoogle Scholar
  7. 7.
    Fernández Anta, A., Mosteiro, M.A.: Contention resolution in multiple-access channels: k-selection in radio networks. Discrete Mathematics, Algorithms and Applications 2(4), 445–456 (2010)MathSciNetCrossRefzbMATHGoogle Scholar
  8. 8.
    Fernández Anta, A., Mosteiro, M.A., Muñoz, J.R.: Unbounded Contention Resolution in Multiple-Access Channels. arXiv:1107.0234v1 [cs.DC] (July 2011)Google Scholar
  9. 9.
    Gerèb-Graus, M., Tsantilas, T.: Efficient optical communication in parallel computers. In: 4th Ann. ACM Symp. on Parallel Algorithms and Architectures, pp. 41–48 (1992)Google Scholar
  10. 10.
    Greenberg, A., Winograd, S.: A lower bound on the time needed in the worst case to resolve conflicts deterministically in multiple access channels. Journal of the ACM 32, 589–596 (1985)MathSciNetCrossRefzbMATHGoogle Scholar
  11. 11.
    Greenberg, R.I., Leiserson, C.E.: Randomized routing on fat-trees. Advances in Computing Research 5, 345–374 (1989)Google Scholar
  12. 12.
    Gusella, R.: A measurement study of diskless workstation traffic on an ethernet. IEEE Transactions on Communications 38(9), 1557–1568 (1990)CrossRefGoogle Scholar
  13. 13.
    Hayes, J.F.: An adaptive technique for local distribution. IEEE Trans. Comm. COM-26, 1178–1186 (1978)CrossRefGoogle Scholar
  14. 14.
    Indyk, P.: Explicit constructions of selectors and related combinatorial structures, with applications. In: Proc. of the 13th Ann. ACM-SIAM Symp. on Discrete Algorithms, pp. 697–704 (2002)Google Scholar
  15. 15.
    Komlòs, J., Greenberg, A.: An asymptotically nonadaptive algorithm for conflict resolution in multiple-access channels. IEEE Trans. Inf. Theory 31, 303–306 (1985)MathSciNetzbMATHGoogle Scholar
  16. 16.
    Kowalski, D.R.: On selection problem in radio networks. In: Proc. 24th Ann. ACM Symp. on Principles of Distributed Computing, pp. 158–166 (2005)Google Scholar
  17. 17.
    Kushilevitz, E., Mansour, Y.: An Ω(Dlog(N/D)) lower bound for broadcast in radio networks. SIAM Journal on Computing 27(3), 702–712 (1998)MathSciNetCrossRefzbMATHGoogle Scholar
  18. 18.
    Leland, W.E., Taqqu, M.S., Willinger, W., Wilson, D.V.: On the self-similar nature of ethernet traffic (extended version). IEEE/ACM Transactions on Networking 2, 1–15 (1994)CrossRefGoogle Scholar
  19. 19.
    Martel, C.U.: Maximum finding on a multiple access broadcast network. Inf. Process. Lett. 52, 7–13 (1994)CrossRefGoogle Scholar
  20. 20.
    Mikhailov, V., Tsybakov, B.S.: Free synchronous packet access in a broadcast channel with feedback. Problemy Peredachi Inform 14(4), 32–59 (1978)MathSciNetzbMATHGoogle Scholar
  21. 21.
    Mitzenmacher, M., Upfal, E.: Probability and Computing: Randomized Algorithms and Probabilistic Analysis. Cambridge University Press, Cambridge (2005)CrossRefzbMATHGoogle Scholar
  22. 22.
    Nakano, K., Olariu, S.: A survey on leader election protocols for radio networks. In: Proc. of the 6th Intl. Symp. on Parallel Architectures, Algorithms and Networks (2002)Google Scholar
  23. 23.
    Willard, D.E.: Log-logarithmic selection resolution protocols in a multiple access channel. SIAM Journal on Computing 15, 468–477 (1986)MathSciNetCrossRefzbMATHGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2011

Authors and Affiliations

  • Antonio Fernández Anta
    • 1
  • Miguel A. Mosteiro
    • 2
    • 3
  • Jorge Ramón Muñoz
    • 3
  1. 1.Institute IMDEA NetworksMadridSpain
  2. 2.Department of Computer ScienceRutgers UniversityPiscatawayUSA
  3. 3.LADyR, GSyC, Universidad Rey Juan CarlosMóstolesSpain

Personalised recommendations