Literature Database Entry

awad2009efficient2


Abdalkarim Awad, Reinhard German and Falko Dressler, "Efficient Service Discovery in Sensor Networks using VCP," Proceedings of 15th ACM International Conference on Mobile Computing and Networking (MobiCom 2009), Demo Session, Beijing, China, September 2009.

Abstract

We show the feasibility of efficient routing and service discovery in sensor networks using the Virtual Cord Protocol (VCP). Scalable and energy efficient data management is still a challenging topic in this domain. Recently, the advantages of virtual coordinates have been explored in comparison to solutions based on geographical positions. Due to the fact that such virtual coordinates can be assigned in an 'optimal' way, routing and data management becomes more efficient. We implemented our VCP protocol on BTnode sensor nodes to show the applicability of this protocol in a lab environment. Furthermore, we address the issue of service discovery by means of indirections as known from overlay networks.

Quick access

Authors' Version PDF (PDF on this web site)
BibTeX BibTeX

Contact

Abdalkarim Awad
Reinhard German
Falko Dressler

BibTeX reference

@inproceedings{awad2009efficient2,
    author = {Awad, Abdalkarim and German, Reinhard and Dressler, Falko},
    title = {{Efficient Service Discovery in Sensor Networks using VCP}},
    booktitle = {15th ACM International Conference on Mobile Computing and Networking (MobiCom 2009), Demo Session},
    year = {2009},
    month = {September},
    address = {Beijing, China},
    publisher = {ACM},
   }
   
   

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.