Wireless ad hoc networks are becoming increasingly important in today's world. The most challenging problem of ad hoc networking is routing, where the trajectory of the packets traveling over the network needs to be determined. 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. In this paper, a new routing algorithm is proposed which does not require all but a subset

more »

... re all but a subset of nodes in the ad hoc network to know their exact location thus receiving the name: LABAR -Location Area Based Ad Hoc Routing. This paper outlines LABAR, and provides with performance measurements on its average routing distance compared to the optimum shortest path.