J. C. Bermond, R. Correa, and M. L. Yu, Optimal gathering protocols on paths under interference constraints, vol.309, pp.5574-5587, 2009.
URL : https://hal.archives-ouvertes.fr/inria-00168162

J. Bermond, J. Galtier, R. Klasing, N. Morales, and S. Pérennes, Hardness and approximation of gathering in static radio networks, Parallel Processing Letters, vol.16, issue.2, pp.165-183, 2006.
URL : https://hal.archives-ouvertes.fr/hal-00344619

L. Gasieniec, On efficient gossiping in radio networks, Proc. Int. Conference on Theoretical Computer ScienceColloquium on structural information and communication complexity, vol.5869, pp.2-14, 2009.

L. Gasieniec and I. Potapov, Gossiping with unit messages in known radio networks, Proc. 2nd IFIP Int. Conference on Theoretical Computer Science, pp.193-205, 2002.

R. Klasing, N. Morales, and S. Pérennes, On the complexity of bandwidth allocation in radio networks, Theoretical Computer Science, vol.406, issue.3, pp.225-239, 2008.
URL : https://hal.archives-ouvertes.fr/hal-00342875