Greedy routing is an appealing routing mechanism because no routing table needs to be maintained. Although, it requires the establishment of an underlying coordinate system which properly supports guaranteed delivery of routing. Computation and maintenance of greedy coordinates, especially in dynamic topologies have not investigated thoroughly in the literature. In this paper we propose Greedy Zone Routing (GZR), an alternative routing architecture for wireless ad-hoc networks. Greedy Zone Routing partitions the network into zones, which are assigned geographic coordinates. Messages are routed in two levels: greedy geographic routing is performed between zones and classical tree-based routing is performed within a zone. This way, trees have a manageable size as their depths are limited by the diameter of the zones. Greedy zone routing eliminates the need of re-computing the coordinates on changes in the network topology, hence being efficient in terms of the protocol overhead. Our simulations demonstrate that, GZR produces routes with low stretch and required to maintain small routing tables, while accounting to 50% less control overheads compared to a state of the art greedy routing protocol.