Dariusz R. Kowalski
ABSTRACT
A selection problem is among the basic communication primitives in networks. In this problem at most k participating stations have to broadcast successfully their messages. This problem is especially important in packet radio networks, where simultaneous transmissions of many neighbors result in interference among delivered messages. This work focuses on a single-hop radio networks with n-stations, also called a multiple access channel, and considers both static and dynamic versions of the selection problem. We construct a family of efficient oblivious deterministic protocols based on selectors, one of them with selection time cO(klog(n/k)), and the second explicit construction with selection time cO(k polylog n). The first construction matches the lower bound Ω(klog(n/k)) on deterministic oblivious selection, while the second one is the first known explicit construction better than Θ(k2). In the dynamic case we introduce the model of dynamic requests, called k-streams, which generalizes the static model and the dynamic requests with at most k participants. We prove that each oblivious deterministic protocol has latency Ω(k2/log k), and on the other hand we prove the existence of the oblivious deterministic protocol with latency cO(k2log n). In view of the existence of the randomized oblivious protocol with expected latency cO(klog(n/k)), this shows that randomization is substantially better than determinism for dynamic setting. Selection problem can be applied to implement other communication primitives --- we demonstrate it in the example of broadcast problem in multi-hop ad-hoc radio networks. In particular, we design an adaptive deterministic protocol broadcasting in time cO(nlog D) in every D-hop radio network of n-stations.
- N. Abramson, Development of the Alohanet, IEEE Trans. on Information Theory 31 (1985) 119--123.Google Scholar
Digital Library
- N. Alon, A. Bar-Noy, N. Linial, and D. Peleg, A lower bound for radio broadcast, Journal of Computer and System Sciences, 43 (1991) 290--298. Google ScholarDigital Library
- H. Attiya, F.E. Fich, and Y. Kaplan, Lower bounds for adaptive collect and related objects. Proc., 23rd ACM Symposium on Principles of Distributed Computing (PODC), 2004, pp. 60--69. Google ScholarDigital Library
- R. Bar-Yehuda, O. Goldreich, and A. Itai, On the time complexity of broadcast in radio networks: an exponential gap between determinism and randomization, Journal of Computer and System Sciences, 45 (1992) 104--126. Google ScholarDigital Library
- J. Capetanakis, Tree algorithms for packet broadcast channels, IEEE Trans. Inf. Theory, IT-25, 5 (1979) 505--515.Google ScholarDigital Library
- B.S. Chlebus, Randomized communication in radio networks, a chapter in "Hand on Randomized Computing," P.M. Pardalos, S. Rajasekaran, J.H. Reif, and J.D.P. Rolim, (Eds.), Kluwer Academic Publishers, 2001, vol. I, pp. 401--456.Google Scholar
- B.S. Chlebus, L. Gasieniec, A. Gibbons, A. Pelc, and W. Rytter, Deterministic broadcasting in unknown radio networks, Distributed Computing, 15 (2002) 27--38. Google ScholarDigital Library
- B.S. Chlebus, and D.R. Kowalski, A better wake-up in radio networks, in Proc., 23rd ACM Symposium on Principles of Distributed Computing (PODC), 2004, pp. 266--274. Google ScholarDigital Library
- M. Chrobak, L. Gasieniec, and D.R. Kowalski, The wake-up problem in multi-hop radio networks, in Proc., 15th ACM-SIAM Symposium on Discrete Algorithms (SODA), 2004, pp. 985--993. Google ScholarDigital Library
- M. Chrobak, L. Gasieniec, and W. Rytter, Fast broadcasting and gossiping in radio networks, Journal of Algorithms, 43 (2002) 177--189. Google ScholarDigital Library
- A. Clementi, A. Monti, and R. Silvestri, Distributed multi-broadcast in unknown radio networks, in Proc., 20th ACM Symposium on Principles of Distributed Computing (PODC), 2001, pp. 255--264. Google ScholarDigital Library
- A.E.F. Clementi, A. Monti, and R. Silvestri, Selective families, superimposed codes, and broadcasting on unknown radio networks, in Proc., 12th ACM-SIAM Symposium on Discrete Algorithms (SODA), 2001, pp. 709--718. Google ScholarDigital Library
- R. Cole, R. Hariharan, and P. Indyk, Tree pattern matching and subset matching in deterministic cO(nlog3 n)-time, in Proc., 10th ACM-SIAM Symposium on Discrete Algorithms (SODA), 1999, pp. 709--718. Google ScholarDigital Library
- A. Czumaj, and W. Rytter, Broadcasting algorithms in radio networks with unknown topology, in Proc., 44th IEEE Symposium on Foundations of Computer Science (FOCS), 2003, pp. 492--501. Google ScholarDigital Library
- A. De Bonis, L. Gasieniec, and U. Vaccaro, Generalized framework for selectors with applications in optimal group testing, in Proc., 30th International Colloquium on Automata, Languages and Programming (ICALP), 2003, pp. 81--96. Google ScholarDigital Library
- D.Z. Du, and F.K. Hwang, "Combinatorial Group Testing and its Applications," World Scientific, 2000.Google Scholar
- A.G. Dyachkov, and V.V. Rykov, A survey of superimposed code theory, Problems of Control and Information Theory, 12 (1983) 1--13.Google Scholar
- P. Erdös, P. Frankl, and Z. Füredi, Families of finite sets in which no set is covered by the union of r others, Israel Journal of Mathematics, 51 (1985) 79--89.Google Scholar
- Z. Füredi, On r-cover free families, Journal of Combinatorial Theory (A), 72 (1996) 172--173. Google ScholarDigital Library
- L. Gasieniec, A. Pelc, and D. Peleg, The wakeup problem in synchronous broadcast systems, SIAM Journal on Discrete Mathematics, 14 (2001) 207--222. Google ScholarDigital Library
- L. Gasieniec, T. Radzik, and Q. Xin, Faster deterministic gossiping in directed ad-hoc radio networks, in Proc., 9th Scandinavian Workshop on Algorithm Theory (SWAT), LNCS 3111, 2004, pp. 397--407.Google ScholarCross Ref
- L.A. Goldberg, P. MacKenzie, M. Paterson, and A. Srinivasan, Contention resolution with constant expected delay, J. ACM, 47 (2000) 1048--1096. Google ScholarDigital Library
- A.G. Greenberg, and S. Winograd, A lower bound on the time needed in the worst case to resolve conflicts deterministically in multiple access channels, J. ACM, 32 (1985) 589--596. Google ScholarDigital Library
- J. Håstad, T. Leighton, and B. Rogoff, Analysis of backoff protocols for multiple access channels, SIAM J. on Computing, 25 (1996) 740--774. Google ScholarDigital Library
- J.F. Hayes, An adaptive technique for local distribution, IEEE Trans. Commun., COM-26 (1978) 1178--1186.Google Scholar
- P. Indyk, Explicit constructions of selectors and related combinatorial structures, with applications, in Proc., 13th ACM-SIAM Symposium on Discrete Algorithms (SODA), 2002, pp. 697--704. Google ScholarDigital Library
- T. Jurdziński, M. Kutylowski, and J. Zatopiański, Efficient algorithms for leader election in radio networks, in Proc., 21st ACM Symposium on Principles of Distributed Computing (PODC), 2002, pp. 51--57. Google ScholarDigital Library
- T. Jurdziński, and G. Stachowiak, Probabilistic algorithms for the wakeup problem in single-hop radio networks, in Proc., 13th International Symposium on Algorithms and Computation (ISAAC), 2002, LNCS 2518, pp. 535--549. Springer-Verlag, Heidelberg. Google ScholarDigital Library
- W.H. Kautz, and R.R.C. Singleton, Nonrandom binary superimposed codes, IEEE Trans. on Information Theory, 10 (1964) 363--377.Google ScholarDigital Library
- J. Komlós, and A.G. Greenberg, An asymptotically nonadaptive algorithm for conflict resolution in multiple-access channels, IEEE Trans. on Information Theory, 31 (1985) 303--306. Google ScholarDigital Library
- D.R. Kowalski, and A. Pelc, Deterministic broadcasting time in radio networks of unknown topology, in Proc., 43rd IEEE Symposium of Foundations of Computer Science (FOCS), Vancouver, Canada, 2002, pp. 63--72. Google ScholarDigital Library
- D.R. Kowalski, and A. Pelc, Deterministic broadcasting time in radio networks of unknown topology, in Proc., 22nd ACM Symposium on Principles of Distributed Computing (PODC), 2003, pp. 73--82. ACM Press, New York. Google ScholarDigital Library
- E. Kushilevitz, and Y. Mansour, An Ω(D log (N/D)) lower bound for broadcast in radio networks, SIAM Journal on Computing, 27 (1998) 702--712. Google ScholarDigital Library
- C.U. Martel, Maximum finding on a multiple access broadcast network, Information Processing Letters, 52 (1994) 7--13. Google ScholarDigital Library
- R.M. Metcalfe, and D.R. Boggs, Ethernet: distributed packet switching for local computer networks, Communications of the ACM, 19 (1976) 395--404. Google ScholarDigital Library
- P. Raghavan, and E. Upfal, Stochastic contention resolution with short delays, SIAM J. on Computing, 28 (1998) 709--719. Google ScholarDigital Library
- B.S. Tsybakov, and V.A. Mikhailov, Free synchronous packet access in a broadcast channel with feedback, Prob. Inf. Transmission, 14:4 (1978) 259--280.Google Scholar
- D.E. Willard, Log-logarithmic selection resolution protocols in a multiple access channel, SIAM J. on Computing, 15 (1986) 468--477. Google ScholarDigital Library
Index Terms
- On selection problem in radio networks
Recommendations
Scalable wake-up of multi-channel single-hop radio networks
We consider single-hop radio networks with multiple channels as a model of wireless networks. There are n stations connected to b radio channels that do not provide collision detection. A station uses all the channels concurrently and independently. ...
Exploiting Spontaneous Transmissions for Broadcasting and Leader Election in Radio Networks
PODC '17: Proceedings of the ACM Symposium on Principles of Distributed ComputingWe study two fundamental communication primitives: broadcasting and leader election in the classical model of multi-hop radio networks with unknown topology and without collision detection mechanisms. It has been known for almost 20 years that in ...
Randomized broadcast in radio networks with collision detection
PODC '13: Proceedings of the 2013 ACM symposium on Principles of distributed computingWe present a randomized distributed algorithm that in radio networks with collision detection broadcasts a single message in O(D + log6 n) rounds, with high probability. This time complexity is most interesting because of its optimal additive dependence ...
Comments