T-DHT: Topology-based Distributed Hash Tables

Authors:
Olaf Landsiedel;Katharina Anna Lehmann;Klaus Wehrle
Affiliations:
University of Tübingen;University of Tübingen;University of Tübingen
Venue:
P2P '05 Proceedings of the Fifth IEEE International Conference on Peer-to-Peer Computing
Year:
2005

Citing 0
Cited 1

A churn and mobility resistant approach for DHTs

MobiShare '06 Proceedings of the 1st international workshop on Decentralized resource sharing in mobile computing and networking

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we introduce topology-based distributed hash tables (T-DHT) as an infrastructure for data-centric storage, information processing, and routing in ad hoc and sensor networks. T-DHTs do not rely on location information and work even in the presence of voids in the network. Using a virtual coordinate system, we construct a distributed hash table which is strongly oriented to the underlying network topology. Thus, adjacent areas in the hash table commonly have a direct link in the network. Routing in the T-DHT guarantees reachability and introduces low hop-overhead compared with the shortest path.