MHT: A mobilitity-aware Distributed Hash Table

Mobile ad-hoc networks and distributed hash tables (DHT) 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. In this paper, we show that with some local knowledge we can build a scalable and mobile structured peer-to-peer network, called Mobile Hash Table (MHT). Furthermore, we discuss practical challenges such as Churn, load balancing and security of MHT. A special focus is put on the differences and new challenges that the use of a DHT in a mobile environment poses.