N. Alon, A. Bar-noy, N. Linial, and D. Peleg, Single round simulation on radio networks, Journal of Algorithms, vol.13, issue.2, pp.188-210, 1992.
DOI : 10.1016/0196-6774(92)90015-5
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.103.5099

R. Bar-yehuda, O. Goldreich, and A. Itai, On the time-complexity of broadcast in multi-hop radio networks: An exponential gap between determinism and randomization, Journal of Computer and System Sciences, vol.45, issue.1, pp.104-126, 1992.
DOI : 10.1016/0022-0000(92)90042-H

A. De-bonis, L. Ga¸sieniecga¸sieniec, and U. Vaccaro, Generalized Framework for Selectors with Applications in Optimal Group Testing, Proc. of 30th International Colloquium on Automata Languages and Programming, pp.81-96, 2003.
DOI : 10.1007/3-540-45061-0_8

B. Chlebus, L. Ga¸sieniecga¸sieniec, A. Lingas, and A. Pagourtzis, Oblivious gossiping in ad-hoc radio networks, Proceedings of the 5th international workshop on Discrete algorithms and methods for mobile computing and communications , DIALM '01, pp.44-51, 2001.
DOI : 10.1145/381448.381454

B. S. Chlebus, L. Ga¸sieniecga¸sieniec, A. Ostlin, and J. M. Robson, Deterministic Radio Broadcasting, Proc. of 27th International Colloquium on Automata Languages and Programming, pp.717-728, 2000.
DOI : 10.1007/3-540-45022-X_60
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.140.9644

M. Chrobak, L. Ga¸sieniecga¸sieniec, and D. Kowalski, The wake-up problem in multi-hop radio networks, Proc. of the 15th Annual ACM-SIAM Symposium on Discrete Algorithms, pp.985-993, 2004.

M. Chrobak, L. Ga¸sieniecga¸sieniec, and W. Rytter, Fast broadcasting and gossiping in radio networks, Proc. of the 41st IEEE Annual Symp. on Foundation of Computer Science, p.575, 2000.

A. E. Clementi, A. Monti, and R. Silvestri, Selective families, superimposed codes, and broadcasting on unknown radio networks, Proc. of the 12th Annual ACM-SIAM Symposium on Discrete Algorithms, pp.709-718, 2001.

A. Czumaj and W. Rytter, Broadcasting algorithms in radio networks with unknown topology, Journal of Algorithms, vol.60, issue.2, pp.115-143, 2006.
DOI : 10.1016/j.jalgor.2004.08.001

A. G. Dyachkov and V. V. Rykov, A survey of superimposed code theory, Problems Control and Inform. Theory, vol.12, issue.4, 1983.

M. Farach-colton, R. J. Fernandes, and M. A. Mosteiro, Bootstrapping a hop-optimal network in the weak sensor model, ACM Transactions on Algorithms, vol.5, issue.4, pp.1-30, 2009.
DOI : 10.1145/1597036.1597040

M. Farach-colton and M. A. Mosteiro, Initializing Sensor Networks of Non-uniform Density in the Weak Sensor Model, Proc. of 10th International Workshop on Algorithms and Data Structures, pp.565-576, 2007.
DOI : 10.1007/978-3-540-73951-7_49

M. Farach-colton and M. A. Mosteiro, Sensor Network Gossiping or How to Break the Broadcast Lower Bound, Proc. of the 18th Intl. Symp. on Algorithms and Computation, pp.232-243, 2007.
DOI : 10.1007/978-3-540-77120-3_22

A. F. Anta, M. A. Mosteiro, and C. Thraves, Deterministic communication in the weak sensor model, Proceedings of the 11th International Conference on Principles of Distributed Systems, pp.119-131, 2007.

G. H. Hardy and E. M. Wright, An introduction to the theory of numbers, Bulletin of the American Mathematical Society, vol.35, issue.6, 1979.
DOI : 10.1090/S0002-9904-1929-04793-1

P. Indyk, Explicit constructions of selectors and related combinatorial structures, with applications, Proc. of the 13th Annual ACM-SIAM Symposium on Discrete Algorithms, pp.697-704, 2002.

J. Komì-os and A. G. Greenberg, An asymptotically nonadaptive algorithm for conflict resolution in multiple-access channels, IEEE Trans. Inf. Theory, vol.31, pp.303-306, 1985.

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

F. Kuhn, T. Moscibroda, and R. Wattenhofer, Initializing newly deployed ad hoc and sensor networks, Proceedings of the 10th annual international conference on Mobile computing and networking , MobiCom '04, pp.260-274, 2004.
DOI : 10.1145/1023720.1023746
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.1.5844

E. 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

P. Levis, E. Brewer, D. Culler, D. Gay, S. Madden et al., The emergence of a networking primitive in wireless sensor networks, Communications of the ACM, vol.51, issue.7, pp.5199-106, 2008.
DOI : 10.1145/1364782.1364804

D. Liu and M. Prabhakaran, On Randomized Broadcasting and Gossiping in Radio Networks, Lecture Notes in Computer Science, vol.2387, pp.340-349, 2002.
DOI : 10.1007/3-540-45655-4_37

B. Rosser, Explicit Bounds for Some Functions of Prime Numbers, American Journal of Mathematics, vol.63, issue.1, pp.211-232, 1941.
DOI : 10.2307/2371291

J. B. Rosser and L. Schoenfeld, Approximate formulas for some functions of prime numbers, Illinois Journal of Mathematics, vol.6, issue.1, pp.64-94, 1962.