Coping with mobility and dynamism is one of the biggest challenges in ad hoc networks. An essential requirement for such networks is a service that can establish communication sessions between mobile nodes whose location is unknown. A location service for ad hoc networks is a distributed algorithm that allows any source node s to know the location of any destination node t, simply by knowing t’s network identiﬁer. A location service has a locality aware lookup algorithm if the cost of locating destination t from source s is proportional to the cost of the minimal cost path between s and t. A location service has a locality aware publish algorithm if the cost of updating the location service due to a node moving from x to y is proportional to the distance between x and y. In this paper we present LLS, the ﬁrst location service for the Unit Disk Graph model whose lookup and publish algorithms have worst case locality guarantees and average case locality awareness eﬃciency for any source destination pair.