S. Ratnasamy, P. Francis, M. Handley, R. Karp, and S. Shenker, A scalable content-addressable network, Proceedings of ACM SIGCOMM'01, 2001.

I. Stoica, R. Morris, D. Liben-nowell, D. R. Karger, M. F. Kaashoek et al., Chord: a scalable peer-to-peer lookup protocol for internet applications, IEEE/ACM Transactions on Networking, vol.11, issue.1, pp.17-32, 2003.
DOI : 10.1109/TNET.2002.808407

A. Rowstron and P. Druschel, Pastry: Scalable, distributed object location and routing for large-scale peerto-peer systems, Proceedings of IFIP/ACM Middle- ware'01, 2001.

L. Blazevic, L. Buttyan, S. G. Capkun, J. P. Hubaux, and J. Y. Boudec, Self organization in mobile ad hoc networks: the approach of Terminodes, IEEE Communications Magazine, vol.39, issue.6, 2001.
DOI : 10.1109/35.925685

J. Li, J. Jannotti, D. S. Couto, D. R. Karger, and R. Morris, A scalable location service for geographic ad hoc routing, Proceedings of the 6th annual international conference on Mobile computing and networking , MobiCom '00, 2000.
DOI : 10.1145/345910.345931

Y. Xue, B. Li, and K. Nahrstedt, A scalable location management scheme in mobile ad-hoc networks, Proceedings of IEEE Conference on Local Computer Networks (LCN), 2001.

B. Chen and R. Morris, L+: Scalable landmark routing and address lookup for multi-hop wireless networks, " tech. rep., Massachusetts Institute of Technology, 2002.

J. Eriksson, M. Faloutsos, and S. Krishnamurthy, Scalable ad hoc routing: the case for dynamic addressing, IEEE INFOCOM 2004, 2004.
DOI : 10.1109/INFCOM.2004.1356997

A. C. Viana, M. D. Amorim, S. Fdida, and J. F. Rezende, Indirect routing using distributed location information, Proceedings of the First IEEE International Conference on Pervasive Computing and Communications, 2003. (PerCom 2003)., pp.747-758, 2004.
DOI : 10.1109/PERCOM.2003.1192745
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.12.59

A. C. Viana, M. D. Amorim, S. Fdida, and J. F. Rezende, Self-organization in spontaneous networks: the approach of DHT-based routing protocols, Ad Hoc Networks Journal, 2005.
DOI : 10.1016/j.adhoc.2004.08.006
URL : https://hal.archives-ouvertes.fr/hal-01153128

J. P. Hubaux, T. Gross, J. Y. Boudec, and M. Vetterli, Toward self-organized mobile ad hoc networks: the terminodes project, IEEE Communications Magazine, vol.39, issue.1, pp.118-124, 2001.
DOI : 10.1109/35.894385

J. Eriksson, M. Faloutsos, and S. Krishnamurthy, PeerNet: Pushing Peer-to-Peer Down the Stack, Proceedings of International Workshop on Peer-To-Peer Systems (IPTPS'03, 2003.
DOI : 10.1007/978-3-540-45172-3_25

P. F. Tsuchiya, The landmark hierarchy: a new hierarchy for routing in very large networks, Proceedings of ACM SIGCOMM'88, 1988.

P. F. Tsuchiya, Landmark routing: Architecture, algorithms and issues, tech. rep., MTR-87W00174, MITRE Corporation, 1987.

J. Broch, D. A. Maltz, D. B. Johnson, Y. Hu, and J. Jetcheva, A performance comparison of multi-hop wireless ad hoc network routing protocols, Proceedings of the 4th annual ACM/IEEE international conference on Mobile computing and networking , MobiCom '98, 1998.
DOI : 10.1145/288235.288256

S. Ni, Y. Tseng, Y. Chen, and J. Sheu, The broadcast storm problem in a mobile ad hoc network, Proceedings of the 5th annual ACM/IEEE international conference on Mobile computing and networking , MobiCom '99, pp.152-162, 1999.
DOI : 10.1145/313451.313525

I. Stoica, D. Adkins, S. Zhuang, S. Shenker, and S. Surana, Internet indirection infrastructure, Proceedings of ACM SIGCOMM'02, 2002.
DOI : 10.1145/964725.633033
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.11.9240

C. E. Perkins and P. Bhagwat, Highly dynamic destination sequenced distance-vector routing (dsdv) for mobile computers, Proceedings of ACM SIGCOMM'94, 1994.

F. T. Leighton, Introduction to parallel algorithms and architectures: array, trees, hypercubes, 1991.

E. Oh and J. Chen, Parallel routing in hypercube networks with faulty nodes, IEEE International Conference on Parallel and Distributed Systems (ICPADS '01), pp.338-345, 2001.

M. Schlosser, M. Sintek, S. Decker, and W. Nejdl, Hypercup -hypercubes, ontologies, and efficient search on peerto-peer networks, " in Agents and Peer-to-Peer Computing: A Promising Combination of Paradigms, LNCS, vol.2530, pp.112-124, 2003.

M. A. Jimenez-montano, C. R. De-la-mora-basanez, and T. Poeschel, On the hypercube structure of the genetic code, Proceedings of Bioinformatics and Genome Research, pp.445-459, 1994.

D. Wang, A low-cost fault-tolerant structure for the hypercube, Journal of Supercomputing, vol.20, issue.3, 2001.

R. Friedman, S. Manor, and K. Guo, Scalable stability detection using logical hypercube, tech. rep, 1999.

J. Slack, Visualization of embedded binary trees in the hypercube, " tech. rep., Final Report of the Project for Information Visualization, 2003.

Y. Saad, Data communication in hypercubes, Journal of Parallel and Distributed Computing, vol.6, issue.1, 1985.
DOI : 10.1016/0743-7315(89)90045-2

A. C. Viana, M. D. Amorim, S. Fdida, and J. F. Rezende, Indirect routing using distributed location information, Proceedings of the First IEEE International Conference on Pervasive Computing and Communications, 2003. (PerCom 2003)., 2003.
DOI : 10.1109/PERCOM.2003.1192745
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.12.59