Bounded-Contention Coding for Wireless Networks in the High SNR Regime

Article, Preprint English OPEN
Censor-Hillel, Keren; Haeupler, Bernhard; Lynch, Nancy Ann; Medard, Muriel;
  • Publisher: Springer-Verlag
  • Related identifiers: doi: 10.1007/978-3-642-33651-5_7
  • Subject: Computer Science - Distributed, Parallel, and Cluster Computing | Computer Science - Data Structures and Algorithms | Computer Science - Information Theory | Computer Science - Networking and Internet Architecture
    arxiv: Computer Science::Information Theory

Efficient communication in wireless networks is typically challenged by the possibility of interference among several transmitting nodes. Much important research has been invested in decreasing the number of collisions in order to obtain faster algorithms for communicat... View more
  • References (39)
    39 references, page 1 of 4

    [1] Noga Alon, Amotz Bar-Noy, Nathan Linial, and David Peleg. A lower bound for radio broadcast. Journal of Computer and System Sciences, 43:290-298, October 1991.

    [2] Aurore Amaudruz and Christina Fragouli. Combinatorial algorithms for wireless information flow. In SODA, 2009.

    [3] Amir Salman Avestimehr, Suhas N. Diggavi, and David N. C. Tse. Wireless network information flow: A deterministic approach. IEEE Transactions on Information Theory, 57(4):1872-1905, 2011.

    [4] Reuven Bar-Yehuda, Oded Goldreich, and Alon Itai. On the time-complexity of broadcast in multi-hop radio networks: An exponential gap between determinism and randomization. J. Comput. Syst. Sci., 45(1):104-126, 1992.

    [5] Reuven Bar-Yehuda, Amos Israeli, and Alon Itai. Multiple communication in multi-hop radio networks. SIAM Journal on Computing, 22:875-887, 1993.

    [6] Marcin Bienkowski, Marek Klonowski, Miroslaw Korzeniowski, and Dariusz R. Kowalski. Dynamic sharing of a multiple access channel. In Jean-Yves Marion and Thomas Schwentick, editors, 27th International Symposium on Theoretical Aspects of Computer Science (STACS 2010), volume 5 of Leibniz International Proceedings in Informatics (LIPIcs), pages 83-94, Dagstuhl, Germany, 2010. Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik.

    [7] Bogdan S. Chlebus, Dariusz R. Kowalski, Andrzej Pelc, and Mariusz A. Rokicki. Efficient distributed communication in ad-hoc radio networks. In Luca Aceto, Monika Henzinger, and Jiri Sgall, editors, Automata, Languages, and Programming: 38th International Colloquium (ICALP 2011, Part II), Zurich, Switzerland, July 2011, volume 6755 of Lecture Notes in Computer Science, pages 613-624, 2011.

    [8] Andrea E. F. Clementi, Angelo Monti, Francesco Pasquale, and Riccardo Silvestri. Broadcasting in dynamic radio networks. J. Comput. Syst. Sci., 75(4):213-230, 2009.

    [9] Alejandro Cornejo and Calvin Newport. Prioritized gossip in vehicular networks. In Proceedings of the 6th ACM SIGACT/SIGMOBILE International Workshop on Foundations of Mobile Computing (DIALM-POMC 2010), Cambridge, MA, September 2010.

    [10] Artur Czumaj and Wojciech Rytter. Broadcasting algorithms in radio networks with unknown topology. Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2003), page 492, 2003.

  • Related Organizations (1)
    Purdue University
    United States
  • Metrics
Share - Bookmark