Landsiedel, OlafOlafLandsiedelLehmann, Katharina AnnaKatharina AnnaLehmannWehrle, KlausKlausWehrle2025-02-052025-02-052005-12-01Proceedings of the 5th IEEE International Conference on Peer-to-Peer Computing: 143-144 (2005)07695237659780769523767https://hdl.handle.net/11420/53956In 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.enComputer Science, Information and General Works::005: Computer Programming, Programs, Data and SecurityConference Paper10.1109/P2P.2005.36Conference Paper