Directed diffusion: a scalable and robust communication paradigm for sensor networks
MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
A scalable location service for geographic ad hoc routing
MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
GPSR: greedy perimeter stateless routing for wireless networks
MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
TAG: a Tiny AGgregation service for ad-hoc sensor networks
ACM SIGOPS Operating Systems Review - OSDI '02: Proceedings of the 5th symposium on Operating systems design and implementation
Geometric ad-hoc routing: of theory and practice
Proceedings of the twenty-second annual symposium on Principles of distributed computing
The design of an acquisitional query processor for sensor networks
Proceedings of the 2003 ACM SIGMOD international conference on Management of data
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
Proceedings of the 1st international conference on Embedded networked sensor systems
Efficient Hop ID based Routing for Sparse Ad Hoc Networks
ICNP '05 Proceedings of the 13TH IEEE International Conference on Network Protocols
Beacon vector routing: scalable point-to-point routing in wireless sensornets
NSDI'05 Proceedings of the 2nd conference on Symposium on Networked Systems Design & Implementation - Volume 2
Geographic routing without planarization
NSDI'06 Proceedings of the 3rd conference on Networked Systems Design & Implementation - Volume 3
S4: small state and small stretch routing protocol for large wireless sensor networks
NSDI'07 Proceedings of the 4th USENIX conference on Networked systems design & implementation
Hi-index | 0.00 |
Since the effectiveness of the routing scheme directly affects resource (e.g. energy, bandwidth, and memory) usage in wireless sensor networks, research works on routing protocols have received considerable attention recently. In this paper, we propose a location-free point-to-point routing scheme, called virtual domain and coordinate routing (VDCR), in wireless sensor networks. VDCR applies the concepts of the virtual domain and the virtual coordinate to design its distributed assignment protocol and the location-free routing protocol. That is, the assignment protocol assigns each sensor node the virtual coordinate to represent the location in a network and the virtual domain to maintain the information about the existing shortest path that has been established during the coordinate assignment. Our VDCR is able to efficiently discover the routing path based on the assigned domains and coordinates. The simulations show that the routing path of VDCR is shorter than ABVCap by 62%-70%. Besides, VDCR require 63%-89% preprocess overhead of ABVCap. For realistic network topologies with obstacles, VDCR can improve the routing path by 64% and up to 96%, compared with GPSR that requires physical location information.