Routing with guaranteed delivery in ad hoc wireless networks
DIALM '99 Proceedings of the 3rd international workshop on Discrete algorithms and methods for mobile computing and communications
GPSR: greedy perimeter stateless routing for wireless networks
MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
Worst-Case optimal and average-case efficient geometric ad-hoc routing
Proceedings of the 4th ACM international symposium on Mobile ad hoc networking & computing
Geometric ad-hoc routing: of theory and practice
Proceedings of the twenty-second annual symposium on Principles of distributed computing
Geographic routing without location information
Proceedings of the 9th annual international conference on Mobile computing and networking
On the effect of localization errors on geographic face routing in sensor networks
Proceedings of the 3rd international symposium on Information processing in sensor networks
Path Vector Face Routing: Geographic Routing with Local Face Information
ICNP '05 Proceedings of the 13TH IEEE International Conference on Network Protocols
On delivery guarantees of face and combined greedy-face routing in ad hoc and sensor networks
Proceedings of the 12th annual international conference on Mobile computing and networking
Scalable logical coordinates framework for routing in wireless sensor networks
ACM Transactions on Sensor Networks (TOSN)
Geographic routing made practical
NSDI'05 Proceedings of the 2nd conference on Symposium on Networked Systems Design & Implementation - Volume 2
Topology preserving maps from virtual coordinates for wireless sensor networks
LCN '10 Proceedings of the 2010 IEEE 35th Conference on Local Computer Networks
Virtual coordinates with backtracking for void traversal in geographic routing
ADHOC-NOW'06 Proceedings of the 5th international conference on Ad-Hoc, Mobile, and Wireless Networks
Routing techniques in wireless sensor networks: a survey
IEEE Wireless Communications
Hi-index | 0.24 |
Convex Subspace Routing (CSR) is a novel approach for routing in sensor networks using anchor-based virtual coordinates. Unlike geographical routing schemes that require physical location information of nodes, obtaining which is often difficult, error-prone and costly, the Virtual Coordinate (VC) based schemes simply characterize each node by a vector of shortest hop distances to a selected subset of nodes known as anchors. Even though VC based routing (VCR) schemes benefits from having connectivity information implicitly embedded within the VCs, VCs lack the directional information available with physical coordinates. The major issues affecting routing using VCs are addressed. Due to local minima problem in the virtual space, the VCR schemes rely on backtracking or hill climbing techniques to overcome the local minima. Convex Subspace Routing, in contrast, avoids using anchors that cause local minima. It dynamically selects subsets of anchors that define subspaces to provide convex distance functions from source to destination. Consequently, it is less sensitive to anchor placement and over anchoring, and does not require tracking route history for backtracking, resulting in shorter packet lengths and energy efficient operation. Three techniques for selection of convex subspaces are proposed and evaluated. Performance evaluation for several different network topologies indicates that CSR significantly outperforms the existing VCR scheme, Logical Coordinate Routing (LCR), while being competitive with geographic coordinate based Greedy Perimeter Stateless Routing (GPSR), even though latter makes use of node location information.