Abstract
Contention resolution over a multiple-access channel can be modeled as a k-selection problem in wireless networks, where a subset k of n network nodes want to broadcast their messages over a shared channel. This paper studies a dynamic version of this problem, which assumes that k messages arrive at an arbitrary set of k nodes (contenders) asynchronously and the message arrival pattern is determined by an on-line adversary. Under this harsh and more practical assumption, we give a randomized distributed algorithm which can guarantee any contender deliver its message in O(k + log2 n) rounds with high probability. Our proposed algorithm neither relies on collision detection, nor a global clock or any knowledge about the contenders, not even its size k. Furthermore, we do not assume the channel can provide any kind of feedback information, which makes our protocol work in simple channels, such as the channels used in wireless sensor networks.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Bender, M.A., Farach-Colton, M., He, S., Kuszmaul, B.C., Leiserson, C.E.: Adversarial contention resolution for simple channels. In: Proc. of the 17th Ann. ACM Symp. on Parallel Algorithms and Architectures, SPAA, pp. 325–332 (2005)
Capetanakis, J.: Tree algorithms for packet broadcast channels. IEEE Trans. Inf. Theory IT-25(5), 505–515 (1979)
Chlebus, B.S., Kowalski, D.R., Rokicki, M.A.: Adversarial queuing on the multiple-access channel. In: Proc. of the 25th ACM Symposium on Principles of Distributed Computing, PODC, pp. 92–101 (2006)
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, SODA, pp. 709–718 (2001)
Fernández Anta, A., Mosteiro, M.A.: Contention Resolution in Multiple-Access Channels: k-Selection in Radio Networks. In: Thai, M.T., Sahni, S. (eds.) COCOON 2010. LNCS, vol. 6196, pp. 378–388. Springer, Heidelberg (2010)
Fernández Anta, A., Mosteiro, M.A., Muñoz, J.R.: Unbounded Contention Resolution in Multiple-Access Channels. In: Peleg, D. (ed.) Distributed Computing. LNCS, vol. 6950, pp. 225–236. Springer, Heidelberg (2011)
Goldberg, L.A., Jerrum, M., Kannan, S., Paterson, M.: A bound on the capacity of backoff and acknowledgment-based protocols. SIAM Journal on Computing 33, 313–331 (2004)
Goldberg, L.A.: Design and analysis of contention-resolution protocols, EPSRC Research Grant GR/L60982, http://www.csc.liv.ac.uk/~leslie/contention.html (last modified, October 2006)
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)
Hayes, J.F.: An adaptive technique for local distribution. IEEE Trans. Comm. COM-26, 1178–1186 (1978)
Holzer, S., Pignolet, Y.A., Smula, J., Wattenhofer, R.: Time-Optimal Information Exchange on Multiple Channels. In: Proc. of the 7th ACM SIGACT/SIGMOBILE International Workshop on Foundations of Mobile Computing, FOMC, pp. 69–76 (2011)
Indyk, P.: Explicit constructions of selectors and related combinatorial structures, with applications. In: Proc. of the 13th Ann. ACM-SIAM Symp. on Discrete Algorithms, SODA, pp. 697–704 (2002)
Komlòs, J., Greenberg, A.: An asymptotically nonadaptive algorithm for conflict resolution in multiple-access channels. IEEE Trans. Inf. Theory 31, 303–306 (1985)
Kowalski, D.R.: On selection problem in radio networks. In: Proc. of 24th Ann. ACM Symp. on Principles of Distributed Computing, SPAA, pp. 158–166 (2005)
Kushilevitz, E., Mansour, Y.: An (Dlog(N/D)) lower bound for broadcast in radio networks. SIAM Journal on Computing 27(3), 702–712 (1998)
Martel, C.U.: Maximum finding on a multiple access broadcast network. Inf. Process. Lett. 52, 7–13 (1994)
Mikhailov, V., Tsybakov, B.S.: Free synchronous packet access in a broadcast channel with feedback. Problemy Peredachi Inform. 14(4), 32–59 (1978)
Mitzenmacher, M., Upfal, E.: Probability and Computing: Randomized Algorithms and Probabilistic Analysis. Cambridge University Press (2005)
Moscibroda, T., Wattenhofer, R.: Maximal independent sets in radio networks. In: Proc. of 24th Annual ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing, PODC, pp. 148–157 (2005)
Willard, D.E.: Log-logarithmic selection resolution protocols in a multiple access channel. SIAM Journal on Computing 15, 468–477 (1986)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Yu, D., Hua, QS., Dai, W., Wang, Y., Lau, F.C.M. (2012). Dynamic Contention Resolution in Multiple-Access Channels. In: Koucheryavy, Y., Mamatas, L., Matta, I., Tsaoussidis, V. (eds) Wired/Wireless Internet Communication. WWIC 2012. Lecture Notes in Computer Science, vol 7277. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-30630-3_20
Download citation
DOI: https://doi.org/10.1007/978-3-642-30630-3_20
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-30629-7
Online ISBN: 978-3-642-30630-3
eBook Packages: Computer ScienceComputer Science (R0)