The landmark hierarchy: a new hierarchy for routing in very large networks
SIGCOMM '88 Symposium proceedings on Communications architectures and protocols
Highly dynamic Destination-Sequenced Distance-Vector routing (DSDV) for mobile computers
SIGCOMM '94 Proceedings of the conference on Communications architectures, protocols and applications
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
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
GHT: a geographic hash table for data-centric storage
WSNA '02 Proceedings of the 1st ACM international workshop on Wireless sensor networks and applications
Asymptotically optimal geometric mobile ad-hoc routing
DIALM '02 Proceedings of the 6th international workshop on Discrete algorithms and methods for mobile computing and communications
Worst-Case optimal and average-case efficient geometric ad-hoc routing
Proceedings of the 4th ACM international symposium on Mobile ad hoc networking & computing
Ad-hoc On-Demand Distance Vector Routing
WMCSA '99 Proceedings of the Second IEEE Workshop on Mobile Computer Systems and Applications
A Highly Adaptive Distributed Routing Algorithm for Mobile Wireless Networks
INFOCOM '97 Proceedings of the INFOCOM '97. Sixteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Driving the Information Revolution
Geographic routing for wireless networks
Geographic routing for wireless networks
Geographic routing without location information
Proceedings of the 9th annual international conference on Mobile computing and networking
A Location-Based Routing Method for Mobile Ad Hoc Networks
IEEE Transactions on Mobile Computing
Scalable routing strategies for ad hoc wireless networks
IEEE Journal on Selected Areas in Communications
Communication and Coordination in Wireless Sensor and Actor Networks
IEEE Transactions on Mobile Computing
Minimizing recovery overhead in geographic ad hoc routing
Computer Communications
Hole reshaping routing in large-scale mobile ad-hoc networks
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
Survey Paper: Routing protocols in ad hoc networks: A survey
Computer Networks: The International Journal of Computer and Telecommunications Networking
Bird Flight-Inspired Routing Protocol for Mobile Ad Hoc Networks
ACM Transactions on Autonomous and Adaptive Systems (TAAS)
Efficient approximation of routing holes in wireless sensor networks
Proceedings of the Second Symposium on Information and Communication Technology
| Hi-index | 0.00 |
Wireless ad hoc routing has been extensively studied and many clever schemes have been proposed over the last several years. One class of ad hoc routing is geographic routing where each intermediate node independently selects the next hop using the given location information of destination. Geographic routing, which eliminates the overhead of route request packet flooding, is scalable and suitable for large scale ad hoc networks. However, geographic routing may select the long detour paths when there are voids between a source and a destination. In this paper, we propose a novel geographic routing approach called geographic landmark routing (GLR). GLR recursively discovers the intermediate nodes called landmarks and constructs sub-paths that connect the subsequent landmarks. Simulation results on various network topologies show that GLR significantly improves the performance of geographic routing.