Literature Database Entry

dressler2013framework


Falko Dressler and Mario Gerla, "A Framework for Inter-Domain Routing in Virtual Coordinate based Mobile Networks," ACM/Springer Wireless Networks (WINET), vol. 19 (7), pp. 1611-1626, October 2013.

Abstract

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 previous paper, 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 this paper, we extend 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 a intra and on a inter-domain level.

Quick access

Original Version DOI (at publishers web site)
Authors' Version PDF (PDF on this web site)
BibTeX BibTeX

Contact

Falko Dressler
Mario Gerla

BibTeX reference

@article{dressler2013framework,
    author = {Dressler, Falko and Gerla, Mario},
    title = {{A Framework for Inter-Domain Routing in Virtual Coordinate based Mobile Networks}},
    journal = {ACM/Springer Wireless Networks (WINET)},
    pages = {1611-1626},
    volume = {19},
    number = {7},
    year = {2013},
    month = {October},
    publisher = {Springer},
    doi = {10.1007/s11276-013-0554-4},
   }
   
   

Copyright notice

Links to final or draft versions of papers are presented here to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted or distributed for commercial purposes without the explicit permission of the copyright holder.

The following applies to all papers listed above that have IEEE copyrights: Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.

The following applies to all papers listed above that are in submission to IEEE conference/workshop proceeedings or journals: This work has been submitted to the IEEE for possible publication. Copyright may be transferred without notice, after which this version may no longer be accessible.

The following applies to all papers listed above that have ACM copyrights: ACM COPYRIGHT NOTICE. Permission to make digital or hard copies of part or all of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, to republish, to post on servers, or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from Publications Dept., ACM, Inc., fax +1 (212) 869-0481, or permissions@acm.org.

The following applies to all SpringerLink papers listed above that have Springer Science+Business Media copyrights: The original publication is available at www.springerlink.com.

This page was automatically generated using BibDB and bib2web.