Please use this identifier to cite or link to this item:
Title: Virtual cord protocol (VCP): a flexible DHT-like routing service for sensor networks
Authors: Awad, Abdalkarim
Dressler, Falko
Sommer, Christoph
German, Reinhard
Keywords: Wireless Sensor Networks (WSNs);Virtual Cord Protocol (VCP)
Issue Date: 2008
Abstract: Efficient data management techniques are needed in Wireless Sensor Networks (WSNs) to counteract issues related to limited resources, e.g. energy, memory, bandwidth, as well as limited connectivity. Self-organizing and cooperative algorithms are thought to be the optimal solution to overcome these limitations. On an abstract level, structured peer-to-peer protocols provide O(1) complexity for storing and retrieving data in the network. However, they rely on underlayer routing techniques. In this paper, we present the Virtual Cord Protocol (VCP), a virtual relative position based efficient routing protocol that also provides means for data management, e.g. insert, get, and delete, as known from typical Distributed Hash Table (DHT) services. The key contributions of this protocol are independence of real location information by relying on relative positions of neighboring nodes, short virtual paths because successors and predecessors are in their vicinity, and high scalability because only information about direct neighbors is needed for routing. Furthermore, VCP inherently prevents deadends and it is easy to be implemented
Appears in Collections:Fulltext Publications

Files in This Item:
File Description SizeFormat
29e2249db1eb2dcfe67d75642fbbe576bb4a.pdf1.22 MBAdobe PDFView/Open
Show full item record

Page view(s)

Last Week
Last month
checked on Jun 27, 2024


checked on Jun 27, 2024

Google ScholarTM


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.