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

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

doi:10.1109/access.2018.2814017

Cited by 16 publications

(14 citation statements)

References 24 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…It is the most popular and efficient mechanism where existing and additional nodes are deployed to re-establish connection among nodes (Jha et al, 2019;Joshi & Younis, 2016;Ranga et al, 2016b;Chouikhi et al, 2017). Finding an optimal relay count required to restore links is an optimization problem and requires complete information about the number of partitions and locations of nodes in them (Younis et al, 2014;Shriwastav & Ghose, 2018;Senturk et al, 2014;Chouikhi et al, 2017;Alfadhly et al, 2011;Cheng et al, 2017;Nikolov & Haas, 2016;Devi & Manickam, 2014;Zahid et al, 2018;Liu et al, 2018;Lee et al, 2016;Kumar & Amgoth, 2019;Lalouani et al, 2017;Ranga et al, 2016a).…”

Section: Introductionmentioning

confidence: 99%

Distributed partition detection and recovery using UAV in wireless sensor and actor networks

Zear¹,

Ranga

2021

KJS publishes peer-review articles in Mathematics, Computer Sci

View full text Add to dashboard Cite

Wireless Sensor and Actor Networks (WSANs) have been extensively employed in various domains ranging from elementary data collection to real-time control and monitoring for critical applications. Network connectivity is a vital robustness measure for overall network performance. Different network functions such as routing, scheduling, and QoS provisioning depends on network connectivity. The failure of articulation points in the network disassociates the network into disjoint segments. We proposed Distributed Partition Detection and Recovery using Unmanned Aerial Vehicle (UAV) (DPDRU) algorithm, as an optimal solution to recover the partitioned network. It consists of three steps: Initialization, Operational and Detection, and Recovery. In the Initialization phase sink node collects all the information about the network. In the Operational and Detection phase, network nodes communicate regularly by exchanging HEARTBEATS, detects failure if some nodes do not get a message from the neighbor node and send failure reports, and sink node identifies network partition. In the recovery phase, the sink node sends UAV at the positional coordinates of the failed node and examines network recovery after UAV reaches the desired location. Our approach primarily focuses on reducing message overhead by sending few update messages to sink node and energy consumption by engaging network nodes only for communication. The requirements of the recovery process (physical movement and communication) are fulfilled by UAV. The algorithm is tested according to the following parameters: Detection Time, Recovery Time, message overhead, and distance traveled by UAV. Simulation results validate the efficacy of the proposed algorithm based on these parameters to provide reliable results. The minimum and the maximum number of messages transmitted are 11 for 10 nodes and 24 for 100 nodes respectively. Hence these results demonstrate that the message overhead in our proposed solution is less as compared to other techniques when the number of nodes increases.

show abstract

Section: Introductionmentioning

confidence: 99%

Distributed partition detection and recovery using UAV in wireless sensor and actor networks

Zear¹,

Ranga

2021

KJS publishes peer-review articles in Mathematics, Computer Sci

View full text Add to dashboard Cite

show abstract

“…Figure 1 shows the basic working of DHTbased addressing, lookup, and routing mechanisms. A network is established according to 3D routing [4,5,15], and the LIDs of nodes are in an ordered three-tuple {x|y|z}-dim, where x, y, and z are values within the range of 0 to ±1024.…”

Section: Introductionmentioning

confidence: 99%

A Secure Data Dissemination in a DHT-Based Routing Paradigm for Wireless Ad Hoc Network

Kousar

Alhaisoni

Akhtar

et al. 2020

Wireless Communications and Mobile Computing

Self Cite

View full text Add to dashboard Cite

Over the past decade, distributed hash table- (DHT-) based routing protocols have been adopted in wireless ad hoc networks (WANETs) to achieve scalability in the route discovery phase by avoiding the flooding mechanism. The security aspects of the routing protocols based on the DHT mechanism are crucial to address and have not been discussed in the existing literature. Therefore, addressing the security issues in DHT-based routing protocols would prevent the service disruption, decrease the traffic overhead, and reduce the packet loss in the network. In this paper, several security issues are identified and elaborated through an example scenario. Moreover, a novel DHT-based routing protocol is proposed that uses a digital signature and the user’s trust in order to swap securely the logical identifiers (LIDs). Trust between nodes is established by the user’s acquaintance and the first visual contact. The proposed protocol vindicates its effectiveness via simulation results in terms of computation time, normalized overhead, percent improvement, and packet delivery ratio.

show abstract

“…Recently, a type of neighbour-based methods are proposed to reduce the routing overhead for MANETs. This type of methods limits the range of information interaction between neighbour nodes within one hop that reduces the amount of information interaction effectively [11,12]. In [12], Zahid et al propose a cluster-based measure to exploit the local neighbour information in a 3D logical structure and identify/detect the critical nodes by employing a localised distributed algorithm.…”

Section: Introductionmentioning

confidence: 99%

“…This type of methods limits the range of information interaction between neighbour nodes within one hop that reduces the amount of information interaction effectively [11,12]. In [12], Zahid et al propose a cluster-based measure to exploit the local neighbour information in a 3D logical structure and identify/detect the critical nodes by employing a localised distributed algorithm. In [11], Ejmaa et al propose a dynamic neighbour-based method which reduces the routing overhead using a dynamic probability model to control the number of forwarding nodes.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Distributed routing algorithm with dynamic connection partition for mobile ad hoc networks

2019

View full text Add to dashboard Cite

Mobile ad hoc networks (MANETs) are attractive for many applications because of their easy-to-use and selforganising nature. However, the routing overhead problem has always been a bottleneck restricting the development of MANETs technology. The reason behind is the traditional blind flooding methods and frequent route initiations caused by node mobility. Reducing routing overhead has a huge impact on saving energy consumption of mobile nodes and improving the MANETs performance. In this study, a distributed dynamic routing algorithm is proposed to establish an efficient routing mechanism for MANETs. Based on the mobility of nodes, a fuzzy positional relationship between nodes is constructed. Using this relationship, an improved routing method is designed. The authors characterise this relationship between nodes and implement the proposed algorithm in an ad hoc routing architecture. The simulation results show that the proposed routing algorithm achieves good performance in reducing routing overhead and improves the efficiency of packet transmissions in MANETs.

show abstract

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

Cited by 16 publications

References 24 publications

Distributed partition detection and recovery using UAV in wireless sensor and actor networks

Distributed partition detection and recovery using UAV in wireless sensor and actor networks

A Secure Data Dissemination in a DHT-Based Routing Paradigm for Wireless Ad Hoc Network

Distributed routing algorithm with dynamic connection partition for mobile ad hoc networks

Contact Info

Product

Resources

About