H. Attiya and J. Welch, Distributed Computing, 2004.
DOI : 10.1002/0471478210

R. Bar-yehuda, O. Goldreich, and A. Itai, On the time-complexity of broadcast in radio networks: an exponential gap between determinism randomization, Proceedings of the sixth annual ACM Symposium on Principles of distributed computing , PODC '87, pp.45-104, 1992.
DOI : 10.1145/41840.41849

M. A. Bender, M. Farach-colton, S. He, B. C. Kuszmaul, and C. E. Leiserson, Adversarial contention resolution for simple channels, Proceedings of the 17th annual ACM symposium on Parallelism in algorithms and architectures , SPAA'05, pp.325-332, 2005.
DOI : 10.1145/1073970.1074023

J. Capetanakis, Tree algorithms for packet broadcast channels, IEEE Transactions on Information Theory, vol.25, issue.5, pp.505-515, 1979.
DOI : 10.1109/TIT.1979.1056093

B. S. Chlebus, L. Gasieniec, D. R. Kowalski, and T. Radzik, On the Wake-Up Problem in Radio Networks, Proceedings, 32nd International Colloquium on Automata, Languages and Programming (ICALP), pp.347-359, 2005.
DOI : 10.1007/11523468_29

B. S. Chlebus, D. R. Kowalski, and M. A. Rokicki, Adversarial queuing on the multiple-access channel, Proceedings, 25th ACM Symposium on Principles of Distributed Computing (PODC), pp.92-101, 2006.

A. E. Clementi, A. Monti, and R. Silvestri, Selective families, superimposed codes, and broadcasting on unknown radio networks, Proceedings, 12th Annual ACM-SIAM Symp. on Discrete Algorithms (SODA), pp.709-718, 2001.

J. Czyzowicz, L. Gasieniec, D. R. Kowalski, and A. Pelc, Consensus and Mutual Exclusion in a Multiple Access Channel, Proceedings, 23rd International Symposium on Distributed Computing, pp.512-526, 2009.
DOI : 10.1109/TPDS.2010.162

L. Gasieniec, A. Pelc, and D. Peleg, The Wakeup Problem in Synchronous Broadcast Systems, SIAM Journal on Discrete Mathematics, vol.14, issue.2, pp.207-222, 2001.
DOI : 10.1137/S0895480100376022

L. A. Goldberg, M. Jerrum, S. Kannan, and M. Paterson, A Bound on the Capacity of Backoff and Acknowledgment-Based Protocols, SIAM Journal on Computing, vol.33, issue.2, pp.313-331, 2004.
DOI : 10.1137/S0097539700381851

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, Journal of the ACM, vol.32, issue.3, pp.589-596, 1985.
DOI : 10.1145/3828.214125

T. Jurdzinski, M. Kutylowski, and J. Zatopianski, Efficient algorithms for leader election in radio networks, Proceedings of the twenty-first annual symposium on Principles of distributed computing , PODC '02, pp.51-57, 2002.
DOI : 10.1145/571825.571833

T. Jurdzi´nskijurdzi´nski and G. Stachowiak, Probabilistic algorithms for the wakeup problem in single-hop radio networks, Proceedings, 13th International Symposium on Algorithms and Computation (ISAAC), pp.535-549, 2002.

D. R. Kowalski, On selection problem in radio networks, Proceedings of the twenty-fourth annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing , PODC '05, pp.158-166, 2005.
DOI : 10.1145/1073814.1073843

Y. Kushilevitz and Y. Mansour, An $\Omega(D\log (N/D))$ Lower Bound for Broadcast in Radio Networks, SIAM Journal on Computing, vol.27, issue.3, pp.702-712, 1998.
DOI : 10.1137/S0097539794279109

N. A. Lynch, Distributed Algorithms, 1996.

K. Nakano and S. Olariu, Uniform leader election protocols for radio networks, IEEE Transactions on Parallel and Distributed Systems, vol.13, issue.5, pp.516-526, 2002.
DOI : 10.1109/TPDS.2002.1003864

B. S. Tsybakov and V. A. Mikhailov, Free synchronous packet access in a broadcast channel with feedback, Prob. Inf. Transmission, vol.14, pp.259-280, 1977.

D. E. Willard, Log-Logarithmic Selection Resolution Protocols in a Multiple Access Channel, SIAM Journal on Computing, vol.15, issue.2, pp.468-477, 1986.
DOI : 10.1137/0215032