M. A. Abam, M. Mark-de-berg, J. Farshi, and . Gudmundsson, Regionfault tolerant geometric spanners, 18 th Symp. on Discrete Algorithms (SODA), pp.1-10, 2007.
DOI : 10.1007/s00454-009-9137-7
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.92.3982

S. Baswana, T. Kavitha, K. Mehlhorn, and S. Pettie, New constructions of (?, ?)-spanners and purely additive spanners, 16 th Symp. on Discrete Algorithms (SODA), pp.672-681, 2005.

T. Clausen, P. Jacquet, and L. Viennot, Investigating the impact of partial topology in proactive MANET routing protocols, The 5th International Symposium on Wireless Personal Multimedia Communications, 2002.
DOI : 10.1109/WPMC.2002.1088405
URL : https://hal.archives-ouvertes.fr/inria-00471706

A. Czumaj, M. Grigni, P. Sissokho, and H. Zhao, Approximation schemes for minimum 2-edge-connected and biconnected subgraphs in planar graphs, SODA '04: Proc. of the fifteenth annual ACM-SIAM symposium on Discrete algorithms, pp.496-505, 2004.

A. Czumaj and A. Lingas, Fast approximation schemes for euclidean multiconnectivity problems, Proc. of the 27th Int. Colloquium on Automata, Languages and Programming (ICALP), pp.856-868, 2000.
DOI : 10.1007/3-540-45022-x_72
URL : http://lup.lub.lu.se/record/526600/file/623759.pdf

A. Czumaj and H. Zhao, Fault-tolerant geometric spanners, Proceedings of the nineteenth conference on Computational geometry , SCG '03, pp.207-230, 2004.
DOI : 10.1145/777792.777794
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.161.6962

M. Damian, S. Pandit, and S. Pemmaraju, Distributed Spanner Construction in Doubling Metric Spaces, Principles of Distributed Systems, pp.157-171, 2006.
DOI : 10.1007/11945529_12

M. Damian, S. Pandit, and S. Pemmaraju, Local approximation schemes for topology control, Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing , PODC '06, pp.208-217, 2006.
DOI : 10.1145/1146381.1146413
URL : http://arxiv.org/abs/0803.2174

B. Derbel, C. Gavoille, D. Peleg, and L. Viennot, On the locality of distributed sparse spanner construction, Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing, PODC '08, pp.273-282, 2008.
DOI : 10.1145/1400751.1400788
URL : https://hal.archives-ouvertes.fr/hal-00343001

G. Dobson, Worst-Case Analysis of Greedy Heuristics for Integer Programming with Nonnegative Data, Mathematics of Operations Research, vol.7, issue.4, pp.515-531, 1982.
DOI : 10.1287/moor.7.4.515

U. Feige, A threshold of ln n for approximating set cover, Journal of the ACM, vol.45, issue.4, pp.634-652, 1998.
DOI : 10.1145/285055.285059

P. Jacquet, A. Laouiti, P. Minet, and L. Viennot, Performance analysis of OLSR multipoint relay flooding in two ad hoc wireless network models, The second IFIP- TC6 NETWORKING Conference, 2002.
URL : https://hal.archives-ouvertes.fr/inria-00072327

P. Jacquet, P. Minet, P. Muhlethaler, and N. Colas-rivierre, Increasing reliability in cable-free radio LANs: Low level forwarding in HIPERLAN, Wireless Personal Communications, vol.4, issue.1, pp.65-80, 1997.
DOI : 10.1023/A:1008867232482

F. Kuhn, T. Moscibroda, T. Nieberg, and R. Wattenhofer, Fast Deterministic Distributed Maximal Independent Set Computation on Growth-Bounded Graphs, DISC, pp.273-287, 2005.
DOI : 10.1007/11561927_21
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.470.4686

F. Kuhn, T. Moscibroda, and R. Wattenhofer, On the locality of bounded growth, Proceedings of the twenty-fourth annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing , PODC '05, pp.60-68, 2005.
DOI : 10.1145/1073814.1073826

C. Levcopoulos, G. Narasimhan, and M. H. Smid, Improved Algorithms for Constructing Fault-Tolerant Spanners, Algorithmica, vol.32, issue.1, pp.144-156, 2002.
DOI : 10.1007/s00453-001-0075-x
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.26.9072

T. Lukovszki, New Results on Fault Tolerant Geometric Spanners, Proc. of the 6th Workshop on Algorithms and Data Structures, pp.193-204, 1999.
DOI : 10.1007/3-540-48447-7_20
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.40.7531

J. Mcquillan, I. Richer, and E. Rosen, The New Routing Algorithm for the ARPANET, IEEE Transactions on Communications, vol.28, issue.5, pp.711-719, 1980.
DOI : 10.1109/TCOM.1980.1094721

J. Moy, Open shortest path first (OSPF) specification. RFC 1131, Network Working Group, 1989.

J. Moy, OSPF version 2. RFC 2328, Network Working Group, 1998.
DOI : 10.17487/rfc1247

D. Peleg and A. A. Schaffer, Graph spanners, Journal of Graph Theory, vol.5, issue.1, pp.99-116, 1989.
DOI : 10.1002/jgt.3190130114

D. Peleg and J. D. Ullman, An Optimal Synchronizer for the Hypercube, SIAM Journal on Computing, vol.18, issue.4, pp.740-747, 1989.
DOI : 10.1137/0218050

S. Pettie, Low distortion spanners, 34 th Int. Colloquium on Automata, Languages and Programming (ICALP), pp.78-89, 2007.

L. A. Wolsey, An analysis of the greedy algorithm for the submodular set covering problem, Combinatorica, vol.7, issue.3, pp.385-393, 1982.
DOI : 10.1007/BF02579435

P. David and . Woodruff, Lower bounds for additive spanners, emulators, and more, 47 th Annual IEEE Symp. on Foundations of Computer Science (FOCS), pp.389-398, 2006.

J. Wu, W. Lou, and F. Dai, Extended multipoint relays to determine connected dominating sets in MANETs, IEEE Transactions on Computers, vol.55, issue.3, pp.334-347, 2006.
DOI : 10.1109/TC.2006.40

I. Unité-de-recherche and . Lorraine, Technopôle de Nancy-Brabois -Campus scientifique 615, rue du Jardin Botanique -BP 101 -54602 Villers-lès-Nancy Cedex (France) Unité de recherche INRIA Rennes : IRISA, Campus universitaire de Beaulieu -35042 Rennes Cedex (France) Unité de recherche INRIA Rhône-Alpes : 655, avenue de l'Europe -38334 Montbonnot Saint-Ismier (France) Unité de recherche, 2004.

I. De-voluceau-rocquencourt, BP 105 -78153 Le Chesnay Cedex (France) http://www.inria.fr ISSN, pp.249-6399