J. Bermond, R. Correa, and M. Yu, Optimal gathering protocols on paths under interference constraints, Discrete Mathematics, vol.309, issue.18, pp.5574-5587, 2009.
DOI : 10.1016/j.disc.2008.04.037
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.02, pp.165-183, 2006.
DOI : 10.1142/S0129626406002551
URL : https://hal.archives-ouvertes.fr/hal-00344619

J. Bermond, L. Gargano, S. Pérennes, A. A. Rescigno, and U. Vaccaro, Optimal Time Data Gathering in Wireless Networks with Omni???Directional Antennas, SIROCCO 2011, pp.306-317, 2011.
DOI : 10.1007/11599463_38
URL : https://hal.archives-ouvertes.fr/inria-00589687

J. Bermond, L. Gargano, and A. A. Rescigno, GATHERING WITH MINIMUM COMPLETION TIME IN SENSOR TREE NETWORKS, Journal of Interconnection Networks, vol.11, issue.01n02, pp.1-33, 2010.
DOI : 10.1142/S0219265910002714
URL : https://hal.archives-ouvertes.fr/hal-00535816

J. Bermond and J. Peters, Optimal gathering in radio grids with interference, Theoretical Computer Science, vol.457, pp.10-26, 2012.
DOI : 10.1016/j.tcs.2012.07.021
URL : https://hal.archives-ouvertes.fr/inria-00610038

J. Bermond and M. Yu, Optimal gathering algorithms in multi-hop radio tree networks with interferences. Ad Hoc and Sensor Wireless Networks, pp.109-128, 2010.
URL : https://hal.archives-ouvertes.fr/inria-00505517

J. Bermond, N. Nisse, P. Reyes, and H. Rivano, Minimum Delay Data Gathering in Radio Networks, 8th International Conference on Ad-Hoc, Mobile and Wireless Networks, pp.69-82, 2009.
DOI : 10.1007/978-3-642-04383-3_6
URL : https://hal.archives-ouvertes.fr/inria-00505522

P. Bertin, J. Bresse, and B. L. Sage, Accès haut débit en zone rurale: une solution "ad hoc, France Telecom R&D, vol.22, pp.16-18, 2005.

V. Bonifaci, R. Klasing, P. Korteweg, A. Marchetti-spaccamela, and L. Stougie, Data Gathering in Wireless Networks, Graphs and Algorithms in Communication Networks, pp.357-377, 2010.
DOI : 10.1007/978-3-642-02250-0_14
URL : https://hal.archives-ouvertes.fr/hal-00342958

V. Bonifaci, P. Korteweg, A. Marchetti-spaccamela, and L. 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

C. Florens, M. Franceschetti, and R. Mceliece, Lower Bounds on Data Collection Time in Sensory Networks, IEEE Journal on Selected Areas in Communications, vol.22, issue.6, pp.1110-11201858, 2004.
DOI : 10.1109/JSAC.2004.830927

C. Gomes, S. Perennes, P. Reyes, and H. Rivano, Bandwidth allocation in radio grid networks, Algotel'08, Saint Malo, 2008.
URL : https://hal.archives-ouvertes.fr/hal-00371137

R. Klasing, Z. Lotker, A. Navarra, and S. Pérennes, From Balls and Bins to Points and Vertices, Algorithmic Operations Research (AlgOR), vol.4, issue.2, pp.133-143, 2009.
DOI : 10.1007/11602613_76
URL : https://hal.archives-ouvertes.fr/hal-00307227

Y. Revah and M. Segal, Improved Algorithms for Data-Gathering Time in Sensor Networks II: Ring, Tree and Grid Topologies, International Conference on Networking and Services (ICNS '07), p.46, 2007.
DOI : 10.1109/ICNS.2007.70

Y. Revah and M. 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

Y. Revah, M. Segal, and L. Yedidsion, Real-time data gathering in sensor networks, Discrete Applied Mathematics, vol.158, issue.5, pp.543-550, 2010.
DOI : 10.1016/j.dam.2009.11.001
URL : http://doi.org/10.1016/j.dam.2009.11.001

X. Zhu, B. Tang, and H. Gupta, Delay Efficient Data Gathering in Sensor Networks, Proc. of MSN'05, pp.380-389, 2005.
DOI : 10.1007/11599463_38