Skip to Main Content
Geographic distributed hash table (DHT) protocols assume that the set of langkey, valuerang pairs, called indexes, should be distributed among nodes. In geographic DHT protocols, the overhead of index redistribution due to node mobility may be high enough to impact the normal lookup operation if each node contains a large number of indexes. In our previous work, we proposed an efficient lookup protocol, called double indirect access (DIA), that dispenses with index redistribution to improve lookup performance. We also evaluated the performance of DIA by using our own simulator which could show only limited simulation results with the assumptions that all nodes are connected and the packets are transferred instantly without delay. In this paper, we implement DIA into the packet-level simulator ns2 in order to evaluate how DIA is affected by the underlying unstable routing in MANET. The metrics of the effectiveness are considered lookup success rate and bandwidth consumption, and the simulation results show that DIA performs better than a conventional geographic DHT protocol.
Parallel and Distributed Systems, 2007 International Conference on (Volume:2 )
Date of Conference: 5-7 Dec. 2007