Start of funding 01.01.2010

Support for inter-domain routing and data replication in virtual coordinate based networks

PD Dr.-Ing. habil Falko Dressler
Friedrich-Alexander-University of Erlangen-Nuremberg
Lehrstuhl für Informatik 7

Prof. Dr. Mario Gerla
University of California, Los Angeles (UCLA)
Computer Science Department



Recently, it has been shown that virtual coordinate based routing techniques are able to overcome several problems in ad hoc networks. They are independent of known geographic locations and less prone to routing failures. Additionally, some of the proposed solutions are exploiting the concept of Distributed Hash Tables (DHTs) to support data management. A typical example is the Virtual Cord Protocol (VCP). However, it is unclear how to integrate multiple networks or network domains in the concept of virtual address identifiers. We propose a solution for inter-domain routing in virtual coordinate based protocols by exploiting the available DHT. Together with appropriate indirections, efficient inter-domain routing becomes possible. The collaborative study should establish a scientific link between the two research groups and provide novel insight into the applicability of virtual coordinate based network protocols in the case of mobile multi-domain environments. Derived solutions are important building blocks for efficient vehicular information sharing systems as well as for mobile sensor network applications.

Final report:
Routing is considered to be one the most challenging problems in MANETs. It has been shown that the use of virtual coordinates or identifiers for efficient routing and data management has several advantages compared to classical topology control techniques based on pre-defined addresses or geographical coordinates. However, these advantages only hold for single domain networks with limited mobility. In a first step, we discussed the challenges arising from using virtual coordinates for routing (to a particular destination ID or to indexed data or resources) in mobile networks in multi-domain network scenarios. We developed a solution by managing data with a Distributed Hash Table (DHT) scheme. Based on our Virtual Cord Protocol (VCP), we then implemented inter-domain routing using appropriate indirections. That approach, however, was still limited in finding efficient routes over multiple transit networks. In a final step, we extended that work by defining a framework for optimized inter-domain routing. In particular, we investigate the use of Ant Colony Optimization (ACO) for optimizing routes between multiple network domains. We show how distributed routing tables can be created and maintained and we outline a heuristic for finding candidate routes. Simulation experiments confirm the efficiency of the selected routes both on an intra and on an inter-domain level.