J. C. Bermond, R. Correa, and M. L. 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-00429084

J. C. Bermond, J. Galtier, R. Klasing, N. Morales, and S. Pérennes, Gathering in specific radio networks, Huitì emes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications (AlgoTel'06), pp.85-88
URL : https://hal.archives-ouvertes.fr/hal-00344620

J. C. 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. C. Bermond, L. Gargano, S. Pérennes, A. Rescigno, and U. Vaccaro, Optimal Time Data Gathering in Wireless Networks with Omni???Directional Antennas, Lecture Notes in Computer Science, vol.31, issue.17, pp.306-317, 2011.
DOI : 10.1007/11599463_38
URL : https://hal.archives-ouvertes.fr/inria-00589687

J. C. 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. C. Bermond, N. Nisse, P. Reyes, and H. Rivano, Minimum Delay Data Gathering in Radio Networks, Proceedings of the 8th international conference on Ad Hoc Networks and Wireless, pp.69-82, 2009.
DOI : 10.1007/978-3-642-04383-3_6
URL : https://hal.archives-ouvertes.fr/inria-00505522

J. C. Bermond and J. Peters, Efficient gathering in radio grids with interference, AlgoTel'05, Presqu'? ?le de Giens, pp.103-106

J. C. Bermond and M. L. Yu, Optimal gathering algorithms in multi-hop radio tree networks with interferences, Ad Hoc and Sensor Wireless Networks, pp.109-128, 2010.

P. Bertin, J. F. 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. M. 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-1120, 2004.
DOI : 10.1109/JSAC.2004.830927

L. Gargano and A. Rescigno, Optimally Fast Data Gathering in Sensor Networks, Proc. of MCFS'06, pp.399-411, 2006.
DOI : 10.1007/11821069_35

C. Gomes, S. Perennes, P. Reyes, and H. Rivano, Bandwidth allocation in radio grid networks, in: AlgoTel'08

R. Jain, Sensor networks: references

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.
DOI : 10.1016/j.tcs.2008.06.048
URL : https://hal.archives-ouvertes.fr/hal-00342875

P. Korteweg, Online algorithms for gathering networks, 2008.

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