Distributed Partition Detection With Dynamic Replication Management in a DHT-Based MANET

Abstract

Curtailing the information loss due to network partitioning is imperative for the reliable communication in a distributed hash table (DHT)-based routing protocol for mobile ad hoc networks (MANETs). Both the limited transmission range and mobility of nodes cause recurrent network partitioning in MANETs that leads to an inaccessibility of the nodes' mapping information, loss of the LID space, and partitioning of the DHT structure. To address the above-mentioned issues, this paper proposes a protocol that employs pre-partitioning measures, such as the critical link/node detection, the replication of the nodes' mapping information, and so on, to augment the inter-node communication, but also reflects substantial improvement in the lookup delay. The proposed protocol effectively exploits the local neighbor information in a 3-D logical structure to identify/detect the critical nodes by employing a localized distributed algorithm. Simulation results show the significance of the proposed protocol in terms of end-to-end lookup delay, routing overhead, and success ratio.