A scalable location service for geographic ad hoc routing
MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
Capacity of Ad Hoc wireless networks
Proceedings of the 7th annual international conference on Mobile computing and networking
Distributed Algorithms
GHT: a geographic hash table for data-centric storage
WSNA '02 Proceedings of the 1st ACM international workshop on Wireless sensor networks and applications
Data-centric storage in sensornets
ACM SIGCOMM Computer Communication Review
Geographic routing for wireless networks
Geographic routing for wireless networks
Towards resilient geographic routing in WSNs
Proceedings of the 1st ACM international workshop on Quality of service & security in wireless and mobile networks
Location verification and trust management for resilient geographic routing
Journal of Parallel and Distributed Computing
Aligned virtual coordinates for greedy geometric routing in WSNs
International Journal of Sensor 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
Hi-index | 0.00 |
Homeland defense applications will use large-scale ad-hoc networks of small devices. Routing is a crucial problem, for naive means do not scale well. Geographic Routing (GR) (Karp 2000; Giordano, Stojmenovic, and Blazevic 2003) offers hope for scalability, under the assumption that every device knows its geographic coordinates, e.g., through GPS. This solution is unsuitable though when there is no easy means of establishing a device's physical location indoors. To address this limitation we propose Virtual Geographic Routing where we construct a virtual coordinate space and use GR within it. This paper describes VGR, compares the characteristics of paths VGR identifies with those that GR identifies, then presents theoretical and empirical evidence for its scalability.