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

Saleem Zahid | Zendy; Shahbaz Akhtar Abid | Zendy; Nadir Shah | Zendy; Syed Husnain Abbas Naqvi | Zendy; Waqar Mehmood | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

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

Author(s) -

Saleem Zahid,

Shahbaz Akhtar Abid,

Nadir Shah,

Syed Husnain Abbas Naqvi,

Waqar Mehmood

Publication year - 2018

Publication title -

ieee access

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.587

H-Index - 127

ISSN - 2169-3536

DOI - 10.1109/access.2018.2814017

Subject(s) - aerospace , bioengineering , communication, networking and broadcast technologies , components, circuits, devices and systems , computing and processing , engineered materials, dielectrics and plasmas , engineering profession , fields, waves and electromagnetics , general topics for engineers , geoscience , nuclear engineering , photonics and electrooptics , power, energy and industry applications , robotics and control systems , signal processing and analysis , transportation

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.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research