Abstract
Consider a group of stations connected through a multiple-access channel, with the constraint that if in a time instant exactly one station transmits a message, then the message is successfully received by any other station, whereas if two or more stations simultaneously transmit their messages then a conflict occurs and all messages are lost. Let us assume that n is the number of stations and that an (arbitrary) subset A of them, \(|A|\le k\le n\), is active, that is, there are at most k stations that have a message to send over the channel. In the classical Conflict Resolution Problem, the issue is to schedule the transmissions of each station to let every active station use the channel alone (i.e., without conflict) at least once, and this requirement must be satisfied whatever might be the set of active stations A. The parameter to optimize is, usually, the worst case number of transmissions that any station has to attempt before all message transmissions are successful. In this paper we study the following question: is it possible to obtain a significant improvement on the protocols that solve the classical Conflict Resolution Problem if we allow the protocols to fail over a “small” fraction of all possible subsets of active stations? In other words, is it possible to significantly reduce the number of transmissions that must be attempted? In this paper we will show that this is indeed case. Our main technical tool is a generalization of the selectors introduced in [9]. As it turned out for selectors, we believe that our new combinatorial structures are likely to be useful also outside the present context in which they are introduced.
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
Notes
- 1.
However, see Sect. 4.1 for improvements.
References
Alon, N., Fachini, E., Körner, J.: Locally thin set families. Comb., Prob. Comput. 9, 481–488 (2000)
Biglieri, E., Györfi, L.: Multiple Access Channels, NATO Security through Science Series - D: Information and Communication Security 10 (2007)
Chlebus, B.S.: Randomized communication in radio networks. In: Pardalos, M., Rajasekaran, S., Reif, J.H., Rolim, J.D.P. (eds.) Handbook on Randomized Computing, vol. I, pp. 401–456. Kluwer Academic Publishers, Dordrecht (2001)
Chlebus, B.S., Gasieniec, L., Kowalski, D.R., Shvartsman, A.: A robust randomized algorithm to perform independent tasks. J. Discrete Algorithms 6(4), 651–665 (2008)
Chlebus, B.S., Kowalski, D.R., Pelc, A., Rokicki, M.A.: Efficient distributed communication in ad-hoc radio networks. In: Aceto, L., Henzinger, M., Sgall, J. (eds.) ICALP 2011, Part II. LNCS, vol. 6756, pp. 613–624. Springer, Heidelberg (2011)
Chrobak, M., Gasieniec, L., Rytter, W.: Fast broadcasting and gossiping in radio networks, In: Proceedings of 42nd IEEE Annual Symposium on Found. of Computer Science (FOCS 2000), pp. 575–581 (2000)
Clementi, A.E.F., Monti, A., Silvestri, R.: Selective families, superimposed codes, and broadcasting on unknown radio networks, In: Proceedings of Symposium on Discrete Algorithms (SODA 2001), pp. 709–718 (2001)
Csűrös, M., Ruszinkó, M.: Single-user tracing and disjointly superimposed codes. IEEE Trans. Inf. Theory 51(4), 1606–1611 (2005)
De Bonis, A.: A, Gasieniec, U. Vaccaro: Optimal two-stage algorithms for group testing problems. SIAM J. Comput. 34(5), 1253–1270 (2005)
Du, D.Z., Hwang, F.K.: Combinatorial Group Testing and Its Applications. World Scientific, River Edge (2000)
D’yachkov, A.G., Rykov, V.V.: Bounds on the length of disjunct codes. Problemy Peredachi Informatsii 18(3), 7–13 (1982)
Erdös, P., Frankl, P., Füredi, Z.: Families of finite sets in which no set is covered by the union of \(r\) others. Israel J. of Math. 51, 75–89 (1985)
Kowalski, D.R.: On selection problem in radio networks. In: Proceedings of the Twenty-Fourth Annual ACM Symposium on Principles of Distributed Computing (PODC 2005), pp. 158–166. ACM Press (2005)
Kautz, W.H., Singleton, R.C.: Nonrandom binary superimposed codes. IEEE Trans Inf. Theory 10, 363–377 (1964)
Komlós, J., Greenberg, A.G.: An asymptotically fast non-adaptive algorithm for conflict resolution in multiple-access channels. IEEE Trans. Inform. Theory 31(2), 302–306 (1985)
Lovàsz, L.: On the ratio of optimal integral and fractional covers. Discrete Math. 13, 383–390 (1975)
Mazumdar, A.: On almost disjunct matrices for group testing. In: Chao, K.-M., Hsu, T., Lee, D.-T. (eds.) ISAAC 2012. LNCS, vol. 7676, pp. 649–658. Springer, Heidelberg (2012)
Sümer, Ö.: Partial covering of hypergraphs. In: SODA 2005, pp. 572–581 (2005)
Porat, E., Rothschild, A.: Explicit nonadaptive combinatorial group testing schemes. IEEE Trans. Inf. Theory 57(12), 7982–7989 (2011)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer International Publishing Switzerland
About this paper
Cite this paper
De Bonis, A., Vaccaro, U. (2015). \(\epsilon \)-Almost Selectors and Their Applications. In: Kosowski, A., Walukiewicz, I. (eds) Fundamentals of Computation Theory. FCT 2015. Lecture Notes in Computer Science(), vol 9210. Springer, Cham. https://doi.org/10.1007/978-3-319-22177-9_20
Download citation
DOI: https://doi.org/10.1007/978-3-319-22177-9_20
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-22176-2
Online ISBN: 978-3-319-22177-9
eBook Packages: Computer ScienceComputer Science (R0)