Advertisement

Contention resolution on a fading channel

  • Jeremy T. Fineman
  • Seth Gilbert
  • Fabian Kuhn
  • Calvin Newport
Article
  • 35 Downloads

Abstract

In this paper, we study upper and lower bounds for contention resolution on a single hop fading channel; i.e., a channel where receive behavior is determined by a signal to interference and noise ratio equation. The best known previous solution solves the problem in this setting in \(O(\log ^2{n}/\log \log {n})\) rounds, with high probability in the system size n. We describe and analyze an algorithm that solves the problem in \(O(\log {n} + \log {R})\) rounds, where R is the ratio between the longest and shortest link, and is a value upper bounded by a polynomial in n for most feasible deployments. We complement this result with an \(\varOmega (\log {n})\) lower bound that proves the bound tight for reasonable R. We note that in the classical radio network model (which does not include signal fading), high probability contention resolution requires \(\varOmega (\log ^2{n})\) rounds. Our algorithm, therefore, affirms the conjecture that the spectrum reuse enabled by fading should allow distributed algorithms to achieve a significant improvement on this \(\log ^2{n}\) speed limit. In addition, we argue that the new techniques required to prove our upper and lower bounds are of general use for analyzing other distributed algorithms in this increasingly well-studied fading channel setting.

Keywords

Contention resolution Leader election Wireless channel Wireless algorithms SINR model 

Notes

Acknowledgements

This research was support in part by the following grants: NSF CCF 1314633, NSF CCF 1320279, NUS FRC T1 251RES1404 and ERC Grant No. 336495 (ACDC).

References

  1. 1.
    Abramson, N.: The ALOHA system: another alternative for computer communications. In: Proceedings of the Fall Joint Computer Conference (1970)Google Scholar
  2. 2.
    Bar-Yehuda, R., Goldreich, O., Itai, A.: On the time complexity of broadcast in radio networks: an exponential gap between determinism and randomization. In: Proceedings of the International Symposium on Principles of Distributed Computing (1987)Google Scholar
  3. 3.
    Chlamtac, I., Kutten, S.: On broadcasting in radio networks: problem analysis and protocol design. In: Proceedings of the Conference on Computer Communication (1985)Google Scholar
  4. 4.
    Daum, S., Gilbert, S., Kuhn, F., Newport, C.: Broadcast in the ad hoc SINR model. In: Proceedings of the International Symposium on Distributed Computing (2013)Google Scholar
  5. 5.
    Daum, S., Kuhn, F., Newport, C.: Efficient symmetry breaking in multi-channel radio networks. In: Proceedings of the International Symposium on Distributed Computing (2012)Google Scholar
  6. 6.
    Gallager, R.: A perspective on multiaccess channels. IEEE Trans. Inf. Theory 31(2), 124–142 (1985)MathSciNetCrossRefzbMATHGoogle Scholar
  7. 7.
    Gasieniec, L., Pelc, A., Peleg, D.: The wakeup problem in synchronous broadcast systems. SIAM J. Discrete Math. 14(2), 207–222 (2001)MathSciNetCrossRefzbMATHGoogle Scholar
  8. 8.
    Goussevskaia, O., Moscibroda, T., Wattenhofer, R.: Local broadcasting in the physical interference model. In: Proceedings of the International Workshop on the Foundations of Mobile Computing. ACM (2008)Google Scholar
  9. 9.
    Greenberg, A., Winograd, S.: A lower bound on the time needed in the worst case to resolve conflicts deterministically in multiple access channels. J. ACM 32(3), 589–596 (1985)MathSciNetCrossRefzbMATHGoogle Scholar
  10. 10.
    Hajek, B., van Loon, T.: Decentralized dynamic control of a multiaccess broadcast channel. IEEE Trans. Autom. Control 27(3), 559–569 (1982)CrossRefzbMATHGoogle Scholar
  11. 11.
    Halldorsson, M.M., Mitra, P.: Distributed connectivity of wireless networks. In: Proceedings of the ACM Conference on Distributed Computing (2012)Google Scholar
  12. 12.
    Halldorsson, M.M., Mitra, P.: Towards tight bounds for local broadcasting. In: Proceedings of the International Workshop on the Foundations of Mobile Computing. ACM (2012)Google Scholar
  13. 13.
    Jurdzinski, T., Kowalski, D.: Distributed backbone structure for algorithms in the SINR model of wireless networks. In: Proceedings of the International Conference on Distributed Computing (2012)Google Scholar
  14. 14.
    Jurdzinski, T., Kowalski, D.R., Rozanski, M., Stachowiak, G.: On the impact of geometry on ad hoc communication in wireless networks. In: Proceedings of the ACM Conference on Distributed Computing (2014)Google Scholar
  15. 15.
    Jurdziński, T., Stachowiak, G.: Probabilistic algorithms for the wakeup problem in single-hop radio networks. In: Bose, P., Morin, P. (eds.) Algorithms and Computation. ISAAC 2002. Lecture Notes in Computer Science, vol 2518. Springer, BerlinGoogle Scholar
  16. 16.
    Jurdzinski, T., Stachowiak, G.: The cost of synchronizing multiple-access channels. In: Proceedings of the ACM Conference on Distributed Computing (2015)Google Scholar
  17. 17.
    Kaplan, M.: A sufficient condition for non-ergodicity of a Markov chain. IEEE Trans. Inf. Theory 25, 470–471 (1979)CrossRefzbMATHGoogle Scholar
  18. 18.
    Komlos, J., Greenberg, A.: An asymptotically nonadaptive algorithm for conflict resolution in multiple-access channels. IEEE Trans. Inf. Theory 31(2), 302–306 (1985)MathSciNetCrossRefzbMATHGoogle Scholar
  19. 19.
    Moscibroda, T., Wattenhofer, R.: The complexity of connectivity in wireless networks. In: Proceedings of the IEEE International Conference on Computer Communications (2006)Google Scholar
  20. 20.
    Newport, C.: Radio network lower bounds made easy. In: Proceedings of the International Symposium on Distributed Computing (2014)Google Scholar
  21. 21.
    Roberts, L.G.: ALOHA packet system with and without slots and capture. ACM SIGCOMM Comput. Commun. Rev. 5(2), 28–42 (1975)CrossRefGoogle Scholar
  22. 22.
    Scheideler, C., Richa, A., Santi, P.: An \(O(\log {n})\) dominating set protocol for wireless ad-hoc networks under the physical interference model. In: Proceedings of the International Symposium on Mobile Ad Hoc Networking and Computing (2008)Google Scholar
  23. 23.
    Willard, D.E.: Log-logarithmic selection resolution protocols in a multiple access channel. SIAM J. Comput. 15(2), 468–477 (1986)MathSciNetCrossRefzbMATHGoogle Scholar

Copyright information

© Springer-Verlag GmbH Germany, part of Springer Nature 2018

Authors and Affiliations

  • Jeremy T. Fineman
    • 1
  • Seth Gilbert
    • 2
  • Fabian Kuhn
    • 3
  • Calvin Newport
    • 1
  1. 1.Georgetown UniversityWashingtonUSA
  2. 2.National University of SingaporeSingaporeSingapore
  3. 3.University of FreiburgFreiburgGermany

Personalised recommendations