For the use in the Internet domain, distributed hash tables (DHTs) have proven to be an efficient and scalable approach for distributed content storage and access. We explore how DHTs and mobile ad-hoc networks (MANETs) fit together as both share key characteristics in terms of self organization, decentralization, redundancy requirements, and limited infrastructure. However, node mobility and the continually changing physical topology pose a special challenge to scalability and the design of a DHT for mobile ad-hoc networks. We evaluated that -- based on some local knowledge -- one can build a scalable and mobile structured peer-to-peer network, called Mobile Hash Table (MHT). Furthermore, our work shows that with little global knowledge, e.g.~a map of the city or the area the nodes are moving, one can even further improve the scalability and reduce DHT maintenance overhead significantly; allowing MHT to scale up to several ten thousands of nodes. Similar to Internet based peer-to-peer systems a deployed mobile hash table suffers from suddenly leaving nodes and the need to recover lost data items. We evaluated how redundancy and recovery techniques used in the Internet domain can be adapted to the needs of hash tables in a mobile environment.