Combining Virtual and Physical Structures for Self-organized Routing

  • Thomas Fuhrmann
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4124)


Our recently proposed scalable source routing (SSR) protocol combines source routing in the physical network with Chord-like routing in the virtual ring that is formed by the address space. Thereby, SSR provides self-organized routing in large unstructured networks of resource-limited devices. Its ability to quickly adapt to changes in the network topology makes it suitable not only for sensor-actuator networks but also for mobile ad-hoc networks. Moreover, SSR directly provides the key-based routing semantics, thereby making it an efficient basis for the scalable implementation of self-organizing, fully decentralized applications.

In this paper we review SSR’s self-organizing features and demonstrate how the combination of virtual and physical structures leads to emergence of stability and efficiency. In particular, we focus on SSR’s resistance against node churn. Following the principle of combining virtual and physical structures, we propose an extension that stabilizes SSR in face of heavy node churn. Simulations demonstrate the effectiveness of this extension.


Cluster Head Destination Node Intermediate Node Address Space Distribute Hash Table 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Cramer, C., Fuhrmann, T.: Self-Stabilizing Ring Networks on Connected Graphs. Technical Report 2005-05, University of Karlsruhe (TH), Fakultaet fuer Informatik (March 2005)Google Scholar
  2. 2.
    Du, S., Khan, A., PalChaudhuri, S., Post, A., Saha, A.K., Druschel, P., Johnson, D.B., Riedi, R.: Self-Organizing Hierarchical Routing for Scalable Ad Hoc Networking. Technical Report TR04-433, Department of Computer Science, Rice University, Houston, TX, USA (2004)Google Scholar
  3. 3.
    Eriksson, J., Faloutsos, M., Krishnamurty, S.: PeerNet: Pushing Peer-to-Peer Down the Stack. In: Kaashoek, M.F., Stoica, I. (eds.) IPTPS 2003. LNCS, vol. 2735. Springer, Heidelberg (2003)CrossRefGoogle Scholar
  4. 4.
    Fonseca, R., Ratnasamy, S., Zhao, J., Ee, C.T., Culler, D., Shenker, S., Stoica, I.: Beacon Vector Routing: Scalable Point-to-Point Routing in Wireless Sensornets. In: Proceedings of 2nd Symposium on Networked Systems Design and Implementation, Boston, MA, U.S. (May 2005)Google Scholar
  5. 5.
    Ford, B.: Unmanaged Internet Protocol. ACM SIGCOMM Computer Communications Review 34(1), 93–98 (2004)CrossRefGoogle Scholar
  6. 6.
    Fuhrmann, T.: Scalable routing for networked sensors and actuators. In: Proceedings of the Second Annual IEEE Communications Society Conference on Sensor and Ad Hoc Communications and Networks (September 2005)Google Scholar
  7. 7.
    Fuhrmann, T., Kutzner, K., Di, P., Cramer, C.: Scalable Routing for Hybrid MANETs (submitted)Google Scholar
  8. 8.
    Gummadi, K., Gummadi, R., Gribble, S., Ratnasamy, S., Shenker, S., Stoica, I.: The Impact of DHT Routing Geometry on Resilience and Proximity. In: Proceedings of the SIGCOMM 2003 conference, pp. 381–394. ACM Press, New York (2003)Google Scholar
  9. 9.
    Charlie Hu, Y., Das, S.M., Pucha, H.: Exploiting the synergy between peer-to-peer and mobile ad hoc networks. In: Proceedings of HotOS-IX: Ninth Workshop on Hot Topics in Operating Systems, Lihue, Kauai, Hawaii (May 2003)Google Scholar
  10. 10.
    Johnson, D.B., Maltz, D.A.: Dynamic Source Routing in Ad Hoc Wireless Networks. Mobile Computing 353, 153–181 (1996)CrossRefGoogle Scholar
  11. 11.
    Karp, B., Kung, H.T.: GPSR: Greedy Perimeter Stateless Routing for Wireless Networks. In: Sixth Annual ACM/IEEE International Conference on Mobile Computing and Networking (Mobicom 2000), Boston, MA, pp. 243–254 (August 2000)Google Scholar
  12. 12.
    Pei, G., Gerla, M., Hong, X.: Lanmar: Landmark routing for large scale wireless ad hoc networks with group mobility. In: Proceedings of IEEE/ACM MobiHOC 2000, Boston, MA, U.S., pp. 11–18 (August 2000)Google Scholar
  13. 13.
    Perkins, C.E., Royer, E.M.: Ad hoc On-Demand Distance Vector Routing. In: Proceedings of the 2nd IEEE Workshop on Mobile Computing Systems and Applications, New Orleans, LA, USA, pp. 90–100 (February 1999)Google Scholar
  14. 14.
    Pucha, H., Das, S.M., Hu, Y.C.: Ekta: An Efficient DHT Substrate for Distributed Applications in Mobile Ad Hoc Networks. In: Proceedings of the 6th IEEE Workshop on Mobile Computing Systems and Applications (WMCSA 2004), English Lake District, UK (December 2004)Google Scholar
  15. 15.
    Stoica, I., Morris, R., Karger, D., Kaashoek, M.F., Balakrishnan, H.: Chord: A Scalable Peer-to-peer Lookup Service for Internet Applications. In: Proceedings of the SIGCOMM 2001 conference, pp. 149–160. ACM Press, New York (2001)Google Scholar
  16. 16.
    Viana, A.C., de Amorim, M.D., Fdida, S.: An Underlay Strategy for Indirect Routing. Wireless Networks 10, 747–758 (2004)CrossRefGoogle Scholar
  17. 17.
    Zahn, T., Schiller, J.: MADPastry: A DHT Substrate for Practicably Sized MANETs. In: 5th Workshop on Applications and Services in Wireless Networks (ASWN 2005), Paris, France (June 2005)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Thomas Fuhrmann
    • 1
  1. 1.System Architecture GroupUniversität Karlsruhe (TH)KarlsruheGermany

Personalised recommendations