Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: For the use in the Internet domain, distributed hash tables (DHTs) have proven to be an efficient and scalable approach to distributed content storage and access. ,  explore how DHTs and mobile ad-hoc networks (MANETs) fit together.  argue that both share key characteristics in terms of self organization, decentralization, redundancy requirements, and limited infrastructure. Hover, 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. ,  show that with some local knowledge  can build a scalable and mobile structured peer-to-peer network, called Mobile Hash Table (MHT). Furthermore,  argue that with little global knowledge, such as a map of the city or whatever area the nodes move in, one can even further improve the scalability and reduce DHT maintenance overhead significantly, allowing MHT to scale up to several ten thousands of nodes.
['Olaf Landsiedel', 'Stefan Götz', 'Klaus Wehrle']
I am writing a research paper on a idea Towards Scalable Mobility in Distributed Hash Tables
[{"from": "human", "value": "I am writing a research paper on a idea Towards Scalable Mobility in Distributed Hash Tables"}, {"from": "gpt", "value": "Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: For the use in the Internet domain, distributed hash tables (DHTs) have proven to be an efficient and scalable approach to distributed content storage and access. ,  explore how DHTs and mobile ad-hoc networks (MANETs) fit together.  argue that both share key characteristics in terms of self organization, decentralization, redundancy requirements, and limited infrastructure. Hover, 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. ,  show that with some local knowledge  can build a scalable and mobile structured peer-to-peer network, called Mobile Hash Table (MHT). Furthermore,  argue that with little global knowledge, such as a map of the city or whatever area the nodes move in, one can even further improve the scalability and reduce DHT maintenance overhead significantly, allowing MHT to scale up to several ten thousands of nodes."}]