Highly dynamic Destination-Sequenced Distance-Vector routing (DSDV) for mobile computers
SIGCOMM '94 Proceedings of the conference on Communications architectures, protocols and applications
Using name-based mappings to increase hit rates
IEEE/ACM Transactions on Networking (TON)
A distance routing effect algorithm for mobility (DREAM)
MobiCom '98 Proceedings of the 4th annual ACM/IEEE international conference on Mobile computing and networking
A performance comparison of multi-hop wireless ad hoc network routing protocols
MobiCom '98 Proceedings of the 4th annual ACM/IEEE international conference on Mobile computing and networking
Ad Hoc mobility management with uniform quorum systems
IEEE/ACM Transactions on Networking (TON)
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
Location-aided routing (LAR) in mobile ad hoc networks
Wireless Networks
Scalable routing protocol for ad hoc networks
Wireless Networks
Geographical Region Summary Service for geographical routing
ACM SIGMOBILE Mobile Computing and Communications Review
CarNet: a scalable ad hoc wireless network system
EW 9 Proceedings of the 9th workshop on ACM SIGOPS European workshop: beyond the PC: new challenges for the operating system
GHT: a geographic hash table for data-centric storage
WSNA '02 Proceedings of the 1st ACM international workshop on Wireless sensor networks and applications
Mobility modeling in wireless networks: categorization, smooth movement, and border effects
ACM SIGMOBILE Mobile Computing and Communications Review
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
A Scalable Location Management Scheme in Mobile Ad-Hoc Networks
LCN '01 Proceedings of the 26th Annual IEEE Conference on Local Computer Networks
Towards realistic mobility models for mobile ad hoc networks
Proceedings of the 9th annual international conference on Mobile computing and networking
Hierarchical location service for mobile ad-hoc networks
ACM SIGMOBILE Mobile Computing and Communications Review
Locating mobile nodes with EASE: learning efficient routes from encounter histories alone
IEEE/ACM Transactions on Networking (TON)
On the scalability of rendezvous-based location services for geographic wireless ad hoc routing
Computer Networks: The International Journal of Computer and Telecommunications Networking
A survey on position-based routing in mobile ad hoc networks
IEEE Network: The Magazine of Global Internetworking
HLLS: A History information based Light Location Service for MANETs
Computer Networks: The International Journal of Computer and Telecommunications Networking
| Hi-index | 0.00 |
A location service is an essential prerequisite for geographic routing protocols for MANETs. We present VHLS, a new distributed location service protocol, that features a dynamic location server selection mechanism and adapts to network traffic workload, minimizing the overall location service overhead. We demonstrate that the ratio of location queries to updates is an important performance parameter in such protocols. Our analysis and simulations show that VHLS provides better query success rates, location service quality, and geographic routing performance than the GLS and GHLS protocols. VHLS also scales well as the network size and traffic workload increases.