Key issues of wireless ad hoc networks are auto-configuration and flexibility. Due to mobility, wireless networks are subject to frequent splits and merges. In many situations, overlapping networks must combine to form a new single network requiring a partial or total reconfiguration. In this context, existing proposals assume that merging networks use similar routing schemes. Nevertheless, there is no guarantee that different networks implement the same routing protocols. In such a scenario, routing protocols must adapt to the changing nature of the network characteristics. The wide spectrum under which ad hoc wireless networks are used lead to the design of multiple routing protocols (e.g., proactive, reactive and adaptive). Merging of wireless networks using distinct routing protocol is thus unavoidable and leverages particular difficult problems. We propose in this paper a flexible solution that enables heterogeneous networks to efficiently cope with merging. We designed a routing translator daemon based on the neighborhood context enabling neighbor nodes using distinct protocols to interoperate. The neighborhood context is obtained from the Neighborhood Routing Protocol Discovery Protocol. Several scenarios under different assumptions show that AODV, DSR and OLSR can efficiently interoperate. We give insights on how routing must adapt and evolve in order to cope with merging. This work has been supported by CNRS and Euronetlab.