Literature Database Entry

awad2008p2pbased

Abdalkarim Awad, Reinhard German and Falko Dressler, "P2P-based Routing and Data Management using the Virtual Cord Protocol (VCP)," Proceedings of 9th ACM International Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc 2008), Poster Session, Hong Kong, China, May 2008, pp. 443–444.

Abstract

We present Virtual Cord Protocol (VCP), a virtual relative position based routing protocol for sensor networks that also provides methods for data management as known from standard DHT services. Self-organizing and cooperative algorithms are thought to be the optimal solution to overcome the inherent resource limitations in sensor networks. On an abstract level, DHT techniques offer O(1) complexity data lookup. Unfortunately, they usually rely on underlayer routing techniques. The key contributions of VCP are the independence of real location information by relying on relative positions of neighboring nodes, successors and predecessors in the cord are always in their vicinity, and the high scalability because only information about direct neighbors are needed for routing. Furthermore, VCP inherently prevents dead-ends and it is easy to be implemented.

Quick access

Original Version PDF (free download, provided by ACM Author-Izer)
Original Version DOI (at publishers web site)
Authors' Version PDF (PDF on this web site)
BibTeX BibTeX

Contact

Abdalkarim Awad
Reinhard German
Falko Dressler

BibTeX reference

@inproceedings{awad2008p2pbased,
    author = {Awad, Abdalkarim and German, Reinhard and Dressler, Falko},
    doi = {10.1145/1374618.1374678},
    title = {{P2P-based Routing and Data Management using the Virtual Cord Protocol (VCP)}},
    pages = {443--444},
    publisher = {ACM},
    isbn = {978-1-60558-073-9},
    address = {Hong Kong, China},
    booktitle = {9th ACM International Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc 2008), Poster Session},
    month = {5},
    year = {2008},
   }
   
   

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.

Last modified: 2024-04-18