GPSR: greedy perimeter stateless routing for wireless networks
MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
Wireless sensor networks: a survey
Computer Networks: The International Journal of Computer and Telecommunications Networking
The Impact of Data Aggregation in Wireless Sensor Networks
ICDCSW '02 Proceedings of the 22nd International Conference on Distributed Computing Systems
Geographic routing without location information
Proceedings of the 9th annual international conference on Mobile computing and networking
Data-centric storage in sensornets with GHT, a geographic hash table
Mobile Networks and Applications
Data-centric routing and storage in sensor networks
Wireless sensor networks
Peer-to-Peer Systems and Applications (Lecture Notes in Computer Science)
Peer-to-Peer Systems and Applications (Lecture Notes in Computer Science)
Virtual ring routing: network routing inspired by DHTs
Proceedings of the 2006 conference on Applications, technologies, architectures, and protocols for computer communications
Dynamic address allocation for self-organised management and control in sensor networks
International Journal of Mobile Network Design and Innovation
P2P-based routing and data management using the virtual cord protocol (VCP)
Proceedings of the 9th ACM international symposium on Mobile ad hoc networking and computing
A simulation model of DYMO for ad hoc routing in OMNeT++
Proceedings of the 1st international conference on Simulation tools and techniques for communications, networks and systems & workshops
Hop ID: A Virtual Coordinate-Based Routing for Sparse Mobile Ad Hoc Networks
IEEE Transactions on Mobile Computing
Query Processing in Sensor Networks
IEEE Pervasive Computing
Hi-index | 0.00 |
We study the capabilities of virtual addressing schemes for efficient and failure tolerant routing in sensor networks. In particular, we present the Virtual Cord Protocol (VCP) that uses techniques known from peer-to-peer networks, i.e. Distributed Hash Tables (DHTs) are used to associate data items in sensor networks with particular node addresses. The addresses of nodes are dynamically maintained by the protocol to form a virtual cord. VCP uses two mechanisms for finding paths to nodes and associated data items: First, it relies on the virtual cord that always points towards the destination. Furthermore, locally available neighborhood information is exploited for greedy routing. Our simulation results show that VCP is able to find paths close to the possible shortest path with very low overhead. The routing performance of VCP, which clearly outperforms other ad hoc routing protocols such as Dynamic MANET On Demand (DYMO), is similar to other virtual addressing schemes, e.g. Virtual Ring Routing (VRR). However, we improved VCP to handle frequent node failures in an optimized way. The results presented in this paper outline the capabilities of VCP to handle such cases.