H. Balakrishnan, C. L. Barret, V. S. 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.
DOI : 10.1109/JSAC.2004.830909

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

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

[. Bermond, R. Corrêa, and M. Yu, Optimal gathering protocols on paths under interference constraints, Discrete Mathematics, vol.309, issue.18, 2009.
DOI : 10.1016/j.disc.2008.04.037
URL : https://hal.archives-ouvertes.fr/inria-00429084

[. Bermond, J. Galtier, R. Klasing, N. Morales, and S. Perennes, 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

[. Bermond, J. Galtier, R. Klasing, N. Morales, and S. Pérennes, Hardness and approximation of gathering in static radio networks, Research Report, vol.5936, 2006.
URL : https://hal.archives-ouvertes.fr/hal-00344619

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

F. Jean-claude-bermond, N. Guinand, P. Nisse, H. Reyes, and . Rivano, Minimum delay data gathering in closed half-duplex grid. On-going work and discussions, 2009.

J. Bermond, L. Gargano, and S. Perennes, Optimal sequential gossiping by short messages, Discrete Applied Mathematics, vol.86, issue.2-3, pp.145-155, 1998.
DOI : 10.1016/S0166-218X(98)00022-5
URL : http://doi.org/10.1016/s0166-218x(98)00022-5

[. Bermond, L. Gargano, and A. A. Rescigno, Gathering with Minimum Delay in Tree Sensor Networks, Lecture Notes in Computer Science, vol.5058, pp.262-276, 2008.
DOI : 10.1007/978-3-540-69355-0_22
URL : https://hal.archives-ouvertes.fr/inria-00505523

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
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.35.5704

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

]. G. Bia00 and . Bianchi, Performance analysis of the IEEE 802

. Bkk-+-09a-]-v, R. Bonifaci, P. Klasing, L. Korteweg, A. Stougie et al., Graphs and Algorithms in Communication Networks, chapter Data Gathering in Wireless Networks, 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.
DOI : 10.1016/j.orl.2008.06.001

V. Bonifaci, P. Korteweg, A. Marchetti-spaccamela, and L. Stougie, Minimizing Average Flow Time in Sensor Data Gathering, ALGOSENSORS, pp.18-29, 2008.
DOI : 10.1287/opre.16.3.687

J. Bermond, N. Nisse, P. Reyes, and H. Rivano, Fast data gathering in radio grid networks, 11èmes Rencontres Francophones sur les Aspects Algorithmiques de Télécommunications, 2009.
URL : https://hal.archives-ouvertes.fr/inria-00376040

J. 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, 2009.
DOI : 10.1007/978-3-642-04383-3_6
URL : https://hal.archives-ouvertes.fr/inria-00505522

]. B. Bol01 and . Bollobás, Random Graphs, 2001.

]. C. Bor08 and . Bordenave, Eigenvalues of euclidean random matrices. Random Struct, Algorithms, vol.33, issue.4, pp.515-532, 2008.

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

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

[. Bermond and M. Yu, Optimal Gathering Algorithms in Multi-hop Radio Tree-Networks ith Interferences, In ADHOC-NOW Lecture Notes in Computer Science, vol.5198, pp.204-217, 2008.
DOI : 10.1007/978-3-540-85209-4_16

L. [. Christersson, A. Gasieniec, and . Lingas, Gossiping with Bounded Size Messages in ad hoc Radio Networks, Proceedings of 29th International Colloquium on Automata, Languages and Programming, pp.377-389, 2002.
DOI : 10.1007/3-540-45465-9_33

L. [. Chrobak, W. Gasieniec, and . 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
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.20.9292

]. F. Chu97 and . Chung, Spectral graph theory, CBMS Regional Conference Series in Mathematics. Published for the Conference Board of the Mathematical Sciences, 1997.

L. [. Chung and . Lu, Complex graphs and networks, CBMS Regional Conference Series in Mathematics. Published for the Conference Board of the Mathematical Sciences, 2006.
DOI : 10.1090/cbms/107

S. [. Chen, J. C. Low, and . Doyle, Joint congestion control and media access control design for wireless ad-hoc networks, IEEE INFOCOM, 2005.

]. S. Col02 and . Coleri, PEDAMACS: power efficient and delay aware, 2002.

O. [. Chlamtac and . Weinstein, The wave expansion approach to broadcasting in multihop radio networks, IEEE Transactions on Communications, vol.39, issue.3, pp.426-433, 1991.
DOI : 10.1109/26.79285

O. Dousse, M. Franceschetti, D. Tse, and P. Thiran, Closing the gap in the capacity of random wireless networks, IEEE ISIT, 2004.

G. [. Elkin and . 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

[. Erdös and A. Rényi, On random graphs, I, p.290, 1959.

P. Erdös, Graph theory and probability. Canad, J. Math, vol.11, pp.34-38, 1959.

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.
DOI : 10.1109/JSAC.2004.830927

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

J. [. Füredi and . Komlós, The eigenvalues of random symmetric matrices, Combinatorica, vol.67, issue.3, pp.233-241, 1981.
DOI : 10.1007/BF02579329

]. J. Gal04 and . Galtier, Optimizing the IEEE 802.11b performance using slow congestion window decrease, Proc. 16th ITC Specialist Seminar on Performance Evaluation of Wireless and Mobile Systems, pp.165-176, 2004.

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

J. [. Greenberg and . Goodman, Sharp approximate models of deflection routing in mesh networks, IEEE Transactions on Communications, vol.41, issue.1, pp.210-223, 1993.
DOI : 10.1109/26.212380

G. [. Gomes and . Huiban, Multiobjective Analysis in Wireless Mesh Networks, 2007 15th International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunication Systems, 2007.
DOI : 10.1109/MASCOTS.2007.41

P. [. Gupta and . Kumar, Critical power for asymptotic connectivity in wireless networks Stochastic Analysis, Control, Optimization and Applications, honor of W.H. Fleming, pp.547-566, 1998.

P. [. Gupta and . Kumar, The capacity of wireless networks, IEEE Transactions on Information Theory, vol.46, issue.2, pp.388-404, 2000.
DOI : 10.1109/18.825799

Y. [. Gaber and . 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

I. [. Gasieniec and . Potapov, Gossiping with Unit Messages in Known Radio Networks
DOI : 10.1007/978-0-387-35608-2_17

C. Gomes, S. Pérennes, and H. Rivano, Bottleneck Analysis for Routing and Call Scheduling in Multi-Hop Wireless Networks, 2008 IEEE Globecom Workshops, 2008.
DOI : 10.1109/GLOCOMW.2008.ECP.78
URL : https://hal.archives-ouvertes.fr/inria-00282200

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

]. L. Gr06a, A. A. Gargano, and . Rescigno, Optimally fast data gathering in sensor networks, MFCS, pp.399-411, 2006.

]. L. Gr06b, A. A. Gargano, and . Rescigno, Optimally fast data gathering in sensor networks, MFCS, pp.399-411, 2006.

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

C. [. Horn and . Johnson, Matrix analysis, 1990.

]. J. Hkp-+-05, R. Hromkovic, A. Klasing, P. Pelc, W. Ruzicka et al., Dissemination of Information in Communication Networks: Part I. Broadcasting, Gossiping, Leader Election, and Fault-Tolerance, 2005.

K. Jain, J. Padhye, V. N. Padmanabhan, and L. Qiu, Impact of interference on multihop wireless network performance, MobiCom'03, pp.66-80, 2003.

R. Klasing, Z. Lotker, A. Navarra, and S. 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

N. [. Klasing, S. Morales, and . 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

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

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

]. L. Lov07 and . Lovasz, Eigenvalues of graphs, 2007.

]. M. Mah00 and . Mahdian, The strong chromatic index of graphs, 2000.

S. [. Méheut, H. Pérennes, and . Rivano, Evaluation stochastique et simulation des réseaux radio, Research report, vol.5989, 2006.

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

G. [. Mazumar, N. Sharma, and . Shroff, Maximum weighted matching with interference constraints, 2006.

]. M. Pen03 and . Penrose, Random geometric graphs, volume 5 of Oxford Studies in Probability, 2003.

]. T. Rap96 and . Rappaport, Wireless Communications: Principles and Practices, 1996.

M. [. Revah and . Segal, Improved Lower Bounds for Data-Gathering Time in Sensor Networks, International Conference on Networking and Services (ICNS '07), p.76, 2007.
DOI : 10.1109/ICNS.2007.71

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

F. [. Rivano, F. Theoleyre, and . Valois, A framework for the capacity evaluation of multihop wireless networks, Ad Hoc and Sensor Wireless networks (AHSWN), 2009.
URL : https://hal.archives-ouvertes.fr/hal-00371161

V. [. Stockmeyer and . Vazirani, NP-completeness of some generalizations of the maximum matching problem, Information Processing Letters, vol.15, issue.1, pp.14-19, 1982.
DOI : 10.1016/0020-0190(82)90077-1

R. [. Schmid and . Wattenhofer, Algorithmic models for sensor networks, Proceedings 20th IEEE International Parallel & Distributed Processing Symposium, 2006.
DOI : 10.1109/IPDPS.2006.1639417
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.395.7506

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

]. Wan09b and . Wan, Multiflows in multihop wireless networks, ACM MobiHoc, 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.
DOI : 10.1109/TPDS.2008.53