T-DHT: topology-based distributed hash tables

Author

Landsiedel, Olaf ; Lehmann, Katharina Anna ; Wehrle, Klaus

Author_Institution

Wilhelm-Schickard-Inst. for Comput. Sci., Tubingen Univ., Germany

fYear

2005

fDate

31 Aug.-2 Sept. 2005

Firstpage

143

Lastpage

144

Abstract

In this paper, the authors introduced 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, a distributed hash table which is strongly oriented to the underlying network topology was constructed. 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.

Keywords

ad hoc networks; peer-to-peer computing; telecommunication network routing; telecommunication network topology; T-DHT; ad hoc network routing; data-centric storage; information processing; network topology; sensor network routing; topology-based distributed hash table; virtual coordinate system; Ad hoc networks; Communications technology; Computer science; Hardware; Information processing; Network topology; Operating systems; Routing; Sensor systems; Wireless communication;

fLanguage

English

Publisher

ieee

Conference_Titel

Peer-to-Peer Computing, 2005. P2P 2005. Fifth IEEE International Conference on

Print_ISBN

0-7695-2376-5

Type

conf

DOI

10.1109/P2P.2005.36

Filename

1551030