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-00429084

J. C. Bermond, A. Gargano, U. Rescigno, and . Vaccaro, Fast gossiping by short messages, SIAM Journal of Comuting, vol.27, issue.4, pp.917-941, 1998.

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

V. Bonifaci, R. Klasing, P. Korteweg, L. Stougie, and A. Marchetti-spaccamela, Data Gathering in Wireless Networks chapter, Graphs and Algorithms in Communication Networks, pp.357-377, 2009.

V. Bonifaci, R. Klasing, P. Korteweg, L. Stougie, and A. Marchetti-spaccamela, Data Gathering in Wireless Networks chapter, Graphs and Algorithms in Communication Networks, pp.357-377, 2009.

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

F. Manne and Q. Xin, Optimal gossiping with unit size in known topology radio networks, Proc. Workshop on Combinatorial and algorithmic aspects of networking, vol.4235, pp.125-134, 2006.