J. Bermond, R. Corrêa, and M. Yu, Gathering Algorithms on Paths Under Interference Constraints, 6th Conference on Algorithms and Complexity, pp.115-126, 2006.
DOI : 10.1007/11758471_14

URL : https://hal.archives-ouvertes.fr/hal-00512286

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, A. A. Rescigno, and U. Vaccaro, Fast Gossiping by Short Messages, SIAM Journal on Computing, vol.27, issue.4, pp.917-941, 1998.
DOI : 10.1137/S0097539795283619

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

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, P. Korteweg, A. Marchetti-spaccamela, and L. Stougie, An Approximation Algorithm for the Wireless Gathering Problem, Lecture Notes in Computer Science, vol.4059, pp.328-338, 2006.
DOI : 10.1007/11785293_31

M. Christersson, L. Gasieniec, and A. Lingas, Gossiping with Bounded Size Messages in ad hoc Radio Networks, Proc. of ICALP'02, pp.377-389, 2002.
DOI : 10.1007/3-540-45465-9_33

M. Chrobak, L. Gasieniec, and W. Rytter, Fast broadcasting and gossiping in radio networks, Journal of Algorithms, vol.43, issue.2, pp.177-189, 2002.
DOI : 10.1016/S0196-6774(02)00004-4

M. L. Elkin and G. Kortsarz, Logarithmic inapproximability of the radio broadcast problem, Journal of Algorithms, vol.52, issue.1, pp.8-25, 2004.
DOI : 10.1016/j.jalgor.2003.11.004

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

I. Gaber and Y. Mansour, Centralized broadcast in multihop radio networks, Journal of Algorithms, vol.46, issue.1, pp.1-20, 2003.
DOI : 10.1016/S0196-6774(02)00292-4

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

L. Gasieniec and I. Potapov, Gossiping with Unit Messages in Known Radio Networks, Proceedings of the IFIP 17th World Computer Congress, pp.193-205, 2002.
DOI : 10.1007/978-0-387-35608-2_17

J. Hromkovic, R. Klasing, A. Pelc, P. Ruzicka, and W. Unger, Dissemination of Information in Commmunication Networks: Part I. Broadcasting, Gossiping, Leader Election, and Fault- Tolerance, 2004.

R. Klasing, N. Morales, and S. Pérennes, On the complexity of bandwidth allocation in radio networks, Theoretical Computer Science, vol.406, issue.3, 2008.
DOI : 10.1016/j.tcs.2008.06.048

URL : https://hal.archives-ouvertes.fr/hal-00342875

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