Literature Database Entry

dressler2010interdomain


Falko Dressler, Abdalkarim Awad and Mario Gerla, "Inter-Domain Routing and Data Replication in Virtual Coordinate Based Networks," Proceedings of IEEE International Conference on Communications (ICC 2010), Cape Town, South Africa, May 2010.

Abstract

In recent work it has been shown that the use of virtual coordinates or identifiers for efficient routing and data management has several advantages compared to the use of predefined addresses or geographical coordinates. However, these advantages only hold for single domain networks with limited mobility. In this paper, we discuss the challenges arising from using virtual coordinates for routing (to a particular sensor ID or to indexed data or resources) in ad hoc and sensor networks in multi-domain network scenarios. We show the feasibility of inter-domain routing by exploiting a concept that is central to most virtual coordinate approaches: the availability of data management operation using a DHT like mechanism. Based on the Virtual Cord Protocol (VCP), we show how inter-domain routing can be realized using appropriate indirections. Furthermore, we investigate the possibility of replicating data among different networks, or DHTs, to provide seamless data access in multidomain environments. Our simulation results clearly show that both functions can be realized with only marginal overhead.

Quick access

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

Contact

Falko Dressler
Abdalkarim Awad
Mario Gerla

BibTeX reference

@inproceedings{dressler2010interdomain,
    author = {Dressler, Falko and Awad, Abdalkarim and Gerla, Mario},
    title = {{Inter-Domain Routing and Data Replication in Virtual Coordinate Based Networks}},
    booktitle = {IEEE International Conference on Communications (ICC 2010)},
    year = {2010},
    month = {May},
    address = {Cape Town, South Africa},
    publisher = {IEEE},
    doi = {10.1109/ICC.2010.5502163},
   }
   
   

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 proceedings 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.