I. Abraham, C. Gavoille, and D. Malkhi, On space-stretch trade-offs, Proceedings of the eighteenth annual ACM symposium on Parallelism in algorithms and architectures , SPAA '06, pp.207-216, 2006.
DOI : 10.1145/1148109.1148144
URL : https://hal.archives-ouvertes.fr/hal-00371404

B. Awerbuch, Complexity of network synchronization, Journal of the ACM, vol.32, issue.4, pp.804-823, 1985.
DOI : 10.1145/4221.4227

B. Awerbuch, B. Berger, L. J. Cowen, and D. Peleg, Fast Distributed Network Decompositions and Covers, Journal of Parallel and Distributed Computing, vol.39, issue.2, pp.105-114, 1996.
DOI : 10.1006/jpdc.1996.0159

S. Baswana and T. Kavitha, Faster Algorithms for Approximate Distance Oracles and All-Pairs Small Stretch Paths, 2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06), pp.591-602, 2006.
DOI : 10.1109/FOCS.2006.29
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.132.8386

B. Bollobás, D. Coppersmith, and M. Elkin, Sparse Distance Preservers and Additive Spanners, 14 th Symp. on Discrete Algorithms (SODA), pp.414-423, 2003.
DOI : 10.1137/S0895480103431046

©. Copyright and . Siam, Unauthorized reproduction of this article is prohibited

T. Clausen, P. Jacquet, A. Laouiti, P. Muhlethaler, L. Qayyum et al., Optimized link state routing protocol, IEEE INMIC, 2001.
DOI : 10.17487/rfc3626
URL : https://hal.archives-ouvertes.fr/inria-00471712

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

D. Coppersmith and M. Elkin, Sparse source-wise and pair-wise distance preservers, 16 th Symp. on Discrete Algorithms (SODA), pp.660-669, 2005.

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

D. Dubhashi, A. Mai, A. Panconesi, J. Radhakrishnan, and A. Srinivasan, Fast distributed algorithms for (weakly) connected dominating sets and linear-size skeletons, Journal of Computer and System Sciences, vol.71, issue.4, pp.467-479, 2005.
DOI : 10.1016/j.jcss.2005.04.002
URL : http://doi.org/10.1016/j.jcss.2005.04.002

M. Elkin, Computing almost shortest paths, ACM Transactions on Algorithms, vol.1, issue.2, pp.283-323, 2005.
DOI : 10.1145/1103963.1103968
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.131.5986

M. Elkin, A near-optimal distributed fully dynamic algorithm for maintaining sparse spanners, Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing, PODC '07, pp.195-204, 2007.
DOI : 10.1145/1281100.1281128

M. Elkin and D. Peleg, $(1 + \epsilon,\beta)$-Spanner Constructions for General Graphs, SIAM Journal on Computing, vol.33, issue.3, pp.608-631, 2004.
DOI : 10.1137/S0097539701393384

M. Elkin and J. Zhang, Efficient algorithms for constructing (1 + , ?)-spanners in the distributed and streaming models, 23 rd Annual ACM Symp. on Principles of Distributed Computing (PODC), pp.160-168, 2004.

A. M. Farley, A. Proskurowski, D. Zappala, and K. Windisch, Spanners and message distribution in networks, Discrete Applied Mathematics, vol.137, issue.2, pp.159-171, 2004.
DOI : 10.1016/S0166-218X(03)00259-2

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 and L. Viennot, Remote-spanners: What to know beyond neighbors, 2009 IEEE International Symposium on Parallel & Distributed Processing, 2008.
DOI : 10.1109/IPDPS.2009.5161041
URL : https://hal.archives-ouvertes.fr/inria-00329347

P. Jacquet, A. Laouiti, P. Minet, and L. Viennot, Performance of Multipoint Relaying in Ad Hoc Mobile Routing Protocols, 2002.
DOI : 10.1007/3-540-47906-6_31

©. Copyright and . Siam, Unauthorized reproduction of this article is prohibited

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

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

D. Peleg and E. Upfal, A trade-off between space and efficiency for routing tables, Journal of the ACM, vol.36, issue.3, pp.510-530, 1989.
DOI : 10.1145/65950.65953

S. Pettie, Low distortion spanners, 34 th Int. Colloquium on Automata, Languages and Programming (ICALP), pp.78-89, 2007.
DOI : 10.1145/1644015.1644022
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.109.4356

M. Thorup and U. Zwick, Compact routing schemes, Proceedings of the thirteenth annual ACM symposium on Parallel algorithms and architectures , SPAA '01, pp.1-10, 2001.
DOI : 10.1145/378580.378581

M. Thorup and U. Zwick, Approximate distance oracles, Journal of the ACM, vol.52, issue.1, pp.1-24, 2005.
DOI : 10.1145/1044731.1044732
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.295.4480

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