Routing in ad hoc networks is challenged by mobility and dynamics of mobile devices. Hence, classic routing algorithms hardly cope with partitions and constant topology changes in such networks. Existing routing algorithms are based on flooding to explore a location or known node locations. In this paper we present an approach based on additional information available in such networks that will help to reduce the network load without relying on known receiver locations.