T-DHT: Topology-based distributed hash tables

Publikationstyp
Conference Paper
Date Issued
2005-12-01
Sprache
English
Author(s)
Landsiedel, Olaf  
Lehmann, Katharina Anna
Wehrle, Klaus  
TORE-URI
https://hdl.handle.net/11420/53956
Volume
2005
Start Page
143
End Page
144
Article Number
1551030
Citation
Proceedings of the 5th IEEE International Conference on Peer-to-Peer Computing: 143-144 (2005)
Contribution to Conference
5th IEEE International Conference on Peer-to-Peer Computing, P2P 2005  
Publisher DOI
10.1109/P2P.2005.36
Scopus ID
2-s2.0-33845370712
Publisher
ACM
ISBN
0769523765
9780769523767
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. © 2005 IEEE.
DDC Class
005: Computer Programming, Programs, Data and Security