Skip to main content
SpringerLink
Log in

An Underlay Strategy for Indirect Routing

  • Published:
Wireless Networks Aims and scope Submit manuscript

Abstract

The evolution of the Internet toward ubiquity, mobility, and independence of wired infrastructure requires revising routing in large dynamic clouds. The need for frequent address updates caused by node mobility suggests decoupling the permanent node identifier from its topological address. This paper proposes Tribe, an indirect and scalable routing protocol for self-organizing networks. Tribe provides an anchor-based abstraction, where the communication is split into two phases: location of the destination node and direct communication between source and destination, associated with appropriate addressing schemes. Tribe anchor nodes play the role of rendezvous points and are responsible for translating a node's identifier into a topology-dependent address. Tribe achieves high scalability by distributing location information among all nodes in the network using peer-to-peer concepts. By managing regions of a logical addressing space, Tribe nodes route in a hop-by-hop basis with small amount of information and communication cost. A qualitative analysis of the Tribe topology and a performance evaluation of the protocol behavior are provided. Tribe raises fundamental issues and triggers a high potential for future work.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. A. Balachandran, G.M. Voelker, P. Bahl and V. Rangan, Characterizing user behavior and network performance in a public wireless LAN, in: Proceedings of ACM Sigmetrics'03 (2002) pp. 195–205.

  2. M. Balazinska and P. Castro, Characterizing mobility and network usage in a corporate wireless local-area network, in: Proceedings of 1st International Conference on Mobile Systems, Applications, and Services, San Francisco, CA (2003) pp. 303–316.

  3. L. Blazevic, L. Buttyan, S.G.S. Capkun, J.P. Hubaux and J.Y.L. Boudec, Self-organization in mobile ad-hoc networks: the approach of terminodes, IEEE Computer Communications Magazine (2001) 166–174.

  4. B.A. Chambers, The Grid Roofnet: A rooftop ad hoc wireless network, Master's Thesis, Deparment of Electrical Engineering and Computer Science at the Massachusetts Institute of Technology, MIT (2002).

  5. T.H. Cormen, C.E. Leiserson and R.L. Rivest, Introduction to Algorithms (MIT Press/McGraw-Hill, 1990).

  6. J. Eriksson, M. Faloutsos and S. Krishnamurthy, PeerNet: Pushing peer-to-peer down the stack, in: Proceedings of International Workshop on Peer-To-Peer Systems (IPTPS'03) (2003) pp. 268–277.

  7. G. Finn, Routing and addressing problems in large metropolitan-scale internetworks, Technical Report, SI Res. Rep. ISI/RR-87-180, Univ. Southern California, Los Angeles, CA (1987).

    Google Scholar 

  8. Freenet website, freenetproject.org/

  9. Gnutella website, gnutella.sourceforge.net/

  10. Grid Project, www.pdos.lcs.mit.edu/grid/

  11. J.P. Hubaux, T. Gross, J.Y.L. Boudec and M. Vetterli, Towards self-organized mobile ad hoc networks: The Terminodes project, IEEE Communications Magazine 39(1) (2001) 118–124.

    Google Scholar 

  12. B. Karp and H.T. Kung, GPSR: Greedy Perimeter Stateless Routing for wireless networks, in: Proceedings of ACM Mobicom'00 (2000) pp. 243–254.

  13. J. Li, J. Jannotti, D.S.J.D. Couto, D.R. Karger and R. Morris, A scalable location service for geographic ad hoc routing, in: Proceedings of ACM Mobicom'00 (2000) pp. 120–130.

  14. J.M. Peha, Wireless communications and coexistence for smart environments, IEEE Personal Communications 7(5) (2000) 66–68.

    Google Scholar 

  15. S. Ratnasamy, P. Francis, M. Handley, R. Karp and S. Shenker, A scalable content-addressable network, In: Proceedings of ACM Sig-comm'01 (2001).

  16. A. Rowstron and P. Druschel, Pastry: Scalable, distributed object location and routing for large-scale peer-to-peer systems, in: Proceedings of IFIP/ACM Middleware'01 (2001) pp. 329–350.

  17. M. Satyanarayanan, Pervasive computing: Vision and challenges, IEEE Personal Communications 8 (2001) 10–17.

    Google Scholar 

  18. I. Stoica, D. Adkins, S. Zhuang, S. Shenker and S. Surana, Internet indirection infrastructure, in: Proceedings of ACM Sigcomm'02 (2002) pp. 73–86.

  19. I. Stoica, R. Morris, D. Karger, M.F. Kaashoek and H. Balakrishnan, Chord: A scalable peer-to-peer lookup service for Internet applications, in: Proceedings of ACM Sigcomm'01 (2001) pp. 149–160.

  20. A.C. Viana, M.D. Amorim, S. Fdida and J.F. Rezende, Indirect routing using distributed location information, in: Proceedings of IEEE International Conference on Pervasive Computing and Communications (PERCOM'03), Dallas-Fort Worth, TX (2003) pp. 224–232.

  21. M. Weiser, Hot topics: Ubiquitous computing, IEEE Computer Communications Magazine (1993). Reprinted as Ubiquitous Computing, Nikkei Electronics, December 6 (1993) 137–143.

  22. S.-C.M. Woo and S. Singh, Scalable routing protocol for ad hoc networks, Wireless Networks 7(5) (2001) 513–529.

    Google Scholar 

  23. E. Zegura, K. Calvert and S. Bhattacharjee, How to model an internet-work, in: Proceedings of IEEE Infocom'96 (1996) pp. 594–602.

  24. B.Y. Zhao, J.D. Kubiatowicz and A.D. Joseph, Tapestry: An infrastructure for fault-tolerant wide-area location and routing, Technical Report, University of California, Berkeley, CA, UCB/CSD-01-1142, EECS (2001).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Laboratoire LIP6/CNRS, Université Pierre et Marie Curie 8, rue du Capitaine Scott 75015, Paris, France

    Aline Carneiro Viana, Marcelo Dias de Amorim & Serge Fdida

  2. GTA/COPPE/Poli – Universidade Federal do Rio de Janeiro, P.O. Box 68504, 21945-970, Rio de Janeiro, RJ, Brasil

    José Ferreira de Rezende

Authors
  1. Aline Carneiro Viana
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Marcelo Dias de Amorim
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Serge Fdida
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. José Ferreira de Rezende
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Carneiro Viana, A., Dias de Amorim, M., Fdida, S. et al. An Underlay Strategy for Indirect Routing. Wireless Networks 10, 747–758 (2004). https://doi.org/10.1023/B:WINE.0000044033.02880.b7

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/B:WINE.0000044033.02880.b7

Search

Navigation