Abstract—Network applications often require large data storage resources, fast queries, and frequent updates. Hash tables support these operations with low costs, yet they cannot...
—The adaptation of structured P2P networks, i.e. Distributed Hash Tables (DHTs), to wireless ad-hoc networks has been investigated in recent years. Existing work assume all peers...
Distributed Hash Tables (DHT) was not designed to be secure against malicious users. But some secure systems like trust and reputation management algorithms trust DHT with their d...
In this paper, we present a novel indexing data structure called RDHT (Range capable Distributed Hash Table) derived from skip lists and specifically designed for storing and retr...