Options
A churn and mobility resistant approach for DHTs
Publikationstyp
Conference Paper
Date Issued
2006-09
Author(s)
Volume
2006
Start Page
42
End Page
47
Citation
MobiShare 2006 - Proceedings of the 1st International Workshop on Decentralized Resource Sharing in Mobile Computing and Networking: 42-47
Contribution to Conference
Publisher DOI
Scopus ID
Publisher
ACM
ISBN
978-1-59593-558-8
Mobile ad-hoc networks (MANETs) and distributed hash-tables (DHTs) share key characteristics in terms of self organization, decentralization, redundancy requirements, and limited infrastructure. However, node mobility and the continually changing physical topology pose a special challenge to scalability and the design of a DHT for mobile ad-hoc network. The mobile hash-table (MHT) [9] addresses this challenge by mapping a data item to a path through the environment. In contrast to existing DHTs, MHT does not to maintain routing tables and thereby can be used in networks with highly dynamic topologies. Thus, in mobile environments it stores data items with low maintenance overhead on the moving nodes and allows the MHT to scale up to several ten thousands of nodes. This paper addresses the problem of churn in mobile hash tables. Similar to Internet based peer-to-peer systems a deployed mobile hash table suffers from suddenly leaving nodes and the need to recover lost data items. We evaluate how redundancy and recovery technique used in the internet domain can be deployed in the mobile hash table. Furthermore, we show that these redundancy techniques can greatly benefit from the local broadcast properties of typical mobile ad-hoc networks.
Subjects
Ad-hoc network | DHT | Distributed hashtable | Mobility | Peer-to-peer
DDC Class
600: Technology