I. Akyildiz, W. Su, Y. Sankarasubramaniam, and E. Cayirci, Wireless sensor networks: a survey, Computer networks, vol.38, issue.4, pp.393-422, 2002.

H. Balakrishnan, C. L. Barrett, V. A. Kumar, M. V. Marathe, and S. Thite, The distance-2 matching problem and its relationship to the MAC-layer capacity of ad hoc wireless networks, IEEE Journal on Selected Areas in Communications, vol.22, issue.6, pp.1069-1079, 2004.

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

J. Bermond, L. Gargano, S. Pérennes, A. Rescigno, and U. Vaccaro, Optimal Time Data Gathering in Wireless Networks with Multidirectional Antennas, Theoretical Computer Science, vol.509, pp.122-139, 2013.
URL : https://hal.archives-ouvertes.fr/hal-00905187

J. Bermond, L. Gargano, and A. Rescigno, Gathering with minimum delay in sensor tree networks, Journal of interconnection Networks, vol.11, pp.1-33, 2010.
URL : https://hal.archives-ouvertes.fr/inria-00505523

J. Bermond, R. Klasing, N. Morales, S. Pérennes, and P. Reyes, Gathering radio messages in the path. Discrete Mathematics, vol.5, pp.1-28, 2013.
URL : https://hal.archives-ouvertes.fr/hal-00907494

J. Bermond, B. Li, N. Nisse, H. Rivano, and M. Yu, Data gathering and personalized broadcasting in radio grids with interference, Theoretical Computer Science, vol.562, pp.453-475, 2015.
URL : https://hal.archives-ouvertes.fr/hal-01084996

J. Bermond, D. Mazauric, V. Misra, and P. Nain, A distributed scheduling algorithm for wireless networks with constant overhead and arbitrary binary interference, SIGMETRICS 2010, 2010.
URL : https://hal.archives-ouvertes.fr/inria-00505519

J. Bermond and J. Peters, Optimal gathering in radio grids with interference, Theoretical Computer Science, vol.457, pp.10-26, 2012.
URL : https://hal.archives-ouvertes.fr/hal-00747751

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

P. Bertin, J. Bresse, and B. L. Sage, Accèss haut débit en zone rurale: une solution adhoc, vol.22, pp.16-18, 2005.

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, 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.

L. X. Bui, S. Sanghavi, and R. Srikant, Distributed link scheduling with constant overhead, IEEE/ACM Transactions on Networking, vol.17, issue.5, pp.1467-1480, 2009.

M. Campêlo, C. Huiban, and R. Sampaio, On the complexity of the flow coloring problem, Discrete Applied Mathematics, vol.197, pp.75-92, 2015.

L. Chen, S. H. Low, and J. C. Doyle, Joint congestion control and media access control design for ad hoc wireless networks, Proceedings IEEE, vol.3, pp.2212-2222, 2005.

A. Eryilmaz, A. E. Ozdaglar, D. Shah, and E. Modiano, Distributed cross-layer algorithms for the optimal control of multihop wireless networks, IEEE/ACM Transactions on Networking, vol.18, issue.2, pp.638-651, 2010.

C. Florens, M. Franceschetti, and R. J. 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.

L. Gargano and A. Rescigno, Optimal fast data gathering in sensor networks, Discrete Applied Mathematics, vol.157, pp.1858-1872, 2009.

C. Gomes and G. Huiban, Multiobjective Analysis in Wireless Mesh Networks, IEEE International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunication Systems. IEEEXplore Digital Library, pp.103-108, 2007.

A. Gupta, X. Lin, and R. Srikant, Low complexity distributed link scheduling algorithms for wireless networks, INFOCOM 2007, pp.1631-1639, 2007.

B. Hajek and G. Sasaki, Link scheduling in polynomial time, IEEE Transactions on Information Theory, vol.34, issue.5, pp.910-917, 2006.

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

R. Klasing, Z. Lotker, A. Navarra, and S. Pérennes, From balls and bins to points and vertices, Algorithmic Operations Research, vol.4, issue.2, pp.133-143, 2009.
URL : https://hal.archives-ouvertes.fr/hal-00307227

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

V. S. Kumar, M. V. Marathe, S. Parthasarathy, and A. Srinivasan, End-to-end packetscheduling in wireless ad-hoc networks, SODA '04: proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms, pp.1021-1030, 2004.

K. Menger, Zur allgemeinen Kurventheorie. Fund. Math, vol.10, pp.96-115, 1927.

R. Mazumdar, G. Sharma, and N. Shroff, Maximum weighted matching with interference constraints, pp.70-74, 2006.

Y. Revah and M. Segal, Improved bounds for data-gathering time in sensor networks, Computer Communications, vol.31, issue.17, pp.4026-4034, 2008.

L. J. Stockmeyer and V. V. Vazirani, NP-completeness of some generalizations of the maximum matching problem, Information Processing Letters, vol.15, issue.1, pp.14-19, 1982.

P. J. Wan, Multiflows in multihop wireless networks, MobiHoc '09: proceedings of the tenth ACM international symposium on Mobile ad hoc networking and computing, pp.85-94, 2009.

Y. Wang, W. Wang, X. Li, and W. Song, Interference-aware joint routing and tdma link scheduling for static wireless networks, IEEE Transactions on Parallel and Distributed Systems, vol.19, issue.12, pp.1709-1726, 2008.