Literature Database Entry

awad2009efficient


Abdalkarim Awad, Reinhard German and Falko Dressler, "Efficient Routing and Service Discovery in Sensor Networks using Virtual Cord Routing," Proceedings of 7th ACM International Conference on Mobile Systems, Applications, and Services (MobiSys 2009), Demo Session, Kraków, Poland, June 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. This problem domain is being addressed by recent Distributed Hash Table (DHT)-based approaches for data management in Wireless Sensor Networks (WSNs). In general, such solutions can be classified in three main categories: real location based, virtual location based, and location independent, whereby the most recent approaches for data management and routing in WSNs rely on virtual coordinates. Inspired by DHTs and bringing this idea down to the underlay, efficient routing paths can be maintained together with the capability to store information and data in a DHT-like system. The first solution in this field has been Virtual Ring Routing (VRR) [1]. It uses a location independent unique key to identify nodes and to organize them into a virtual ring. The problem of this protocol is that the adjacent nodes in the ring can be far away in the real network. Moreover, dead ends cannot be completely prevented. Later on, VCP has been proposed, which shows a couple of advantages compared to VRR [2]. The concept of the protocol always ensures reachability of all destinations and optimizes routes on the fly by exploiting information about physical neighbors. Using the concept of indirections, VCP also provides efficient resource and service discovery. This demo shows the applicability of VCP for efficient routing and data management in sensor networks. After evaluating the protocol using comprehensive simulation studies in previous work [2, 3], we implemented the protocol on the BTnode sensor node platform, which is based on an Atmel ATmega128 micro controller and a CC1000 radio transmitter. We show the feasibility of the protocol implementation in a small but easy to understand demo scenario.

Quick access

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

Contact

Abdalkarim Awad
Reinhard German
Falko Dressler

BibTeX reference

@inproceedings{awad2009efficient,
    author = {Awad, Abdalkarim and German, Reinhard and Dressler, Falko},
    title = {{Efficient Routing and Service Discovery in Sensor Networks using Virtual Cord Routing}},
    booktitle = {7th ACM International Conference on Mobile Systems, Applications, and Services (MobiSys 2009), Demo Session},
    year = {2009},
    month = {June},
    address = {Krak{\'{o}}w, Poland},
    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.