Voronoi diagrams—a survey of a fundamental geometric data structure
ACM Computing Surveys (CSUR)
A distance routing effect algorithm for mobility (DREAM)
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)
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
Proceedings of the twentieth annual ACM symposium on Principles of distributed computing
LANMAR: landmark routing for large scale wireless ad hoc networks with group mobility
MobiHoc '00 Proceedings of the 1st ACM international symposium on Mobile ad hoc networking & computing
Distributed distance measurement for large-scale networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Brocade: Landmark Routing on Overlay Networks
IPTPS '01 Revised Papers from the First International Workshop on Peer-to-Peer Systems
Localized Delaunay triangulation with application in ad hoc wireless networks
IEEE Transactions on Parallel and Distributed Systems
A survey on position-based routing in mobile ad hoc networks
IEEE Network: The Magazine of Global Internetworking
Hi-index | 0.00 |
We present an integrated location management and location-aided routing system for mobile ad hoc network (MANET) which organizes the MANET into a two-level routing hierarchy with the help of Voronoi diagrams. The location information of mobile nodes in a Voronoi zone is summarized using bloom filters and distributed among the location servers in the zones. In the integrated system, the destination's location is learned during routing in the overlay network of the hierarchy. Theoretical analysis and simulation results show that the proposed system reduces the routing time by about 25% over traditional location-aided routing techniques for transaction-type traffic while incurring only small management overhead and low storage requirement.