Highly dynamic Destination-Sequenced Distance-Vector routing (DSDV) for mobile computers
SIGCOMM '94 Proceedings of the conference on Communications architectures, protocols and applications
An efficient routing protocol for wireless networks
Mobile Networks and Applications - Special issue: routing in mobile communications networks
Location-aided routing (LAR) in mobile ad hoc networks
MobiCom '98 Proceedings of the 4th annual ACM/IEEE international conference on Mobile computing and networking
A distance routing effect algorithm for mobility (DREAM)
MobiCom '98 Proceedings of the 4th annual ACM/IEEE 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
LABAR: Location Area Based Ad Hoc Routing for GPS-Scarce Wide-Area Ad Hoc Networks
PERCOM '03 Proceedings of the First IEEE International Conference on Pervasive Computing and Communications
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
Routing in Ad Hoc Networks Using a Spine
IC3N '97 Proceedings of the 6th International Conference on Computer Communications and Networks
Depth First Search and Location Based Localized Routing and QoS Routing in Wireless Networks
ICPP '00 Proceedings of the Proceedings of the 2000 International Conference on Parallel Processing
LABAR: Location Area Based Ad Hoc Routing for GPS-Scarce Wide-Area Ad Hoc Networks
PERCOM '03 Proceedings of the First IEEE International Conference on Pervasive Computing and Communications
| Hi-index | 0.00 |
Wireless ad hoc networks are becoming increasingly important in today's world. The most challenging problem in conjunction with ad hoc networks is routing, i.e., the procedure in charge of determining the trajectory of packets traveling over the network. For large-scale ad hoc networks scalability of the routing approach is extremely important. One of the approaches to scale up ad hoc routing is geographical location based routing, which usuallyrequires all nodes to be aware of their exact locations. In this paper, a new routing algorithm is proposed which requires only a subset of nodes to know their exact location forming location areas around these nodes. This paper outlines the LABAR (Location Area Based Ad HocRouting) routing protocol and provides with simulation measurements on its average routing distance compared to the optimum shortest path.