[. 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.02, pp.165-183, 2006.
DOI : 10.1142/S0129626406002551
URL : https://hal.archives-ouvertes.fr/hal-00344619

M. [. Busch, R. Herlihy, and . Wattenhofer, Hard-Potato routing, Proceedings of the thirty-second annual ACM symposium on Theory of computing , STOC '00, pp.278-285, 2000.
DOI : 10.1145/335305.338762

P. [. Bonifaci, A. Korteweg, L. Marchetti-spaccamela, and . Stougie, An approximation algorithm for the wireless gathering problem, Operations Research Letters, vol.36, issue.5, pp.605-608, 2008.
DOI : 10.1016/j.orl.2008.06.001

[. Bermond and J. Peters, Efficient gathering in radio grids with interference, InSeptì emes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications (AlgoTel'05) Presqu'? ?le de Giens, pp.103-106, 2005.

M. [. Florens, R. J. Franceschetti, and . Mceliece, Lower bounds on data collection time in sensory networks. Selected Areas in Communications, IEEE Journal on, vol.22, issue.6, pp.1110-1120, 2004.

]. L. Gar07 and . Gargano, Time optimal gathering in sensor networks, Structural Information and Communication Complexity, 14th International Colloquium INRIA Proceedings, pp.7-10, 2007.

S. [. Gomes, P. Pérennes, H. Reyes, and . Rivano, Bandwidth allocation in radio grid networks, 10èmes Rencontres Francophones sur les Aspects Algorithmiques de Télécommunications (AlgoTel'08), 2008.
URL : https://hal.archives-ouvertes.fr/hal-00371137

A. [. Gargano and . Rescigno, Collision-free path coloring with application to minimum-delay gathering in sensor networks, Discrete Applied Mathematics, vol.157, issue.8
DOI : 10.1016/j.dam.2009.01.015

A. [. Gargano and . Rescigno, Optimally Fast Data Gathering in Sensor Networks, MFCS, pp.399-411, 2006.
DOI : 10.1007/11821069_35

Z. [. Klasing, A. Lotker, S. Navarra, and . Pérennes, From Balls and Bins to Points and Vertices, Proceedings of the 16th Annual International Symposium on Algorithms and Computation, pp.757-766, 2005.
DOI : 10.1007/11602613_76
URL : https://hal.archives-ouvertes.fr/hal-00307227

B. [. Mansour and . Patt-shamir, Many-to-one packet routing on grids, Proceedings of the twenty-seventh annual ACM symposium on Theory of computing , STOC '95, pp.258-267, 1995.
DOI : 10.1145/225058.225136

M. [. Revah and . Segal, Improved algorithms for data-gathering time in sensor networks ii: Ring, tree and grid topologies, Networking and Services ICNS. Third International Conference on, p.46, 2007.

M. [. Revah and . Segal, Improved bounds for data-gathering time in sensor networks, Computer Communications, vol.31, issue.17, pp.314026-4034, 2008.
DOI : 10.1016/j.comcom.2008.08.006