3D-RP: A DHT-Based Routing Protocol for MANETs

Abstract

In the last few years, distributed hash table (DHT) has come forth as a useful addition to the design andspecificationofspontaneous,self-organizingnetworks.Researchershaveexploiteditsadvantages by implementing it at the network layer in order to design scalable routing protocols for mobile ad hoc networks. We identify two correlated issues that must be considered when designing DHTbased routing protocol, namely the mismatch problem and resilience of the logical network, which degrades the efficiency of the DHT-based routing protocols. To address these problems, we propose a DHT-based routing protocol that exploits a 3D logical space that takes into account the physical intra-neighbor relationships of a node and exploits a 3D structure to interpret that relationship. In the proposed scheme, each node runs a distributed algorithm to obtain a consecutive logical identifierthatreflectsitsphysicalproximityinthe3Dlogicalspace.Moreover,theprotocolutilizesthe 3D-structuretomaintainmulti-pathstoadestinationnodeinordertoaddressthescalabilityproblem and gain resilience against a node/link failure. Simulation results show that the proposed approach outperforms the existing DHT-based routing protocol in terms routing overhead, end-to-end delay, path-stretch values and packet-delivery ratio.