Position-based routing protocols forward packets in a greedy manner from source to destination without having to maintain routes through the network. Contention-based routing strategies improve upon position-based routing in that they do not even require to maintain neighbor tables at the nodes. This makes them very robust in highly mobile networks. However, neighbor tables are essential in the recovery mechanisms that are used when greedy routing fails. In this poster proposal we outline Contention-Based Distance-Vector Routing (CBDV), a recovery strategy for contention-based routing protocols that works when no neighbor tables are present. We describe the basic idea and give a simulative analysis of its performance.