Merging of DHT‐based logical networks in MANETs

Abid, Shahbaz Akhtar; Othman, Mazliza; Shah, Nadir; Sabir, Osama; Khan, Atta ur Rehman; Ali, Mazhar; Shafi, Jawad; Ullah, Saleem

doi:10.1002/ett.2969

Cited by 6 publications

(11 citation statements)

References 33 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The research attempting to use the DHT in MANET can be grouped according to four perspectives as; efficient routing [58]- [61], data transmission [62], [63], handling the dynamic topology [64]- [66] and mitigation of the traffic overhead [67].…”

Section: Dht Applications In Manetmentioning

confidence: 99%

“…Due to the limited transmission range and self-organizing nature of MANET, network partitioning and merging can happen frequently. The DHT is leveraged to keep the relation between the logical and physical address of nodes in [58]- [61] to solve the network partitioning and merging. Through the simulation-based evaluation, it has been shown that DHTassisted network partitioning and merging is beneficial in terms of achieving efficient and scalable routing in MANET.…”

Section: Routingmentioning

confidence: 99%

“…[10]- [21], blockchains [22]- [36], Internet of Things (IoT) [37]- [48], Online Social Networks (OSNs) [49]- [57], Mobile Ad Hoc Networks (MANETs) [58]- [67], and Vehicular Ad Hoc Networks (VANETs) [68]- [78].…”

Section: Introductionmentioning

confidence: 99%

“…Rather, the network is established on-fly by nodes routing data for each other through forwarding to their directly connected nodes based on the routing algorithm in use [99]. In the context of MANETs, the DHTs are commonly utilized for efficient routing [58]- [61], data transmission [62], [63], handling the dynamic topology [64]- [66], and mitigation of the traffic overhead [67].…”

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations

DHT-based Communications Survey: Architectures and Use Cases

Hassanzadeh-Nazarabadi¹,

Taheri-Boshrooyeh²,

Otoum³

et al. 2021

Preprint

View full text Add to dashboard Cite

Several distributed system paradigms utilize Distributed Hash Tables (DHTs) to realize structured peer-to-peer (P2P) overlays. DHT structures arise as the most commonly used organizations for peers that can efficiently perform crucial services such as data storage, replication, query resolution, and load balancing. With the advances in various distributed system technologies, novel and efficient solutions based on DHTs emerge and play critical roles in system design. DHT-based methods and communications have been proposed to address challenges such as scalability, availability, reliability and performance, by considering unique characteristics of these technologies. In this article, we propose a classification of the state-of-the-art DHT-based methods focusing on their system architecture, communication, routing and technological aspects across various system domains. To the best of our knowledge, there is no comprehensive survey on DHT-based applications from system architecture and communication perspectives that spans various domains of recent distributed system technologies. We investigate the recently emerged DHT-based solutions in the seven key domains of edge and fog computing, cloud computing, blockchain, the Internet of Things (IoT), Online Social Networks (OSNs), Mobile Ad Hoc Networks (MANETs), and Vehicular Ad Hoc Networks (VANETs). In contrast to the existing surveys, our study goes beyond the commonly known DHT methods such as storage, routing, and lookup, and identifies diverse DHT-based solutions including but not limited to aggregation, task scheduling, resource management and discovery, clustering and group management, federation, data dependency management, and data transmission. Furthermore, we identify open problems and discuss future research guidelines for each domain.

show abstract

Section: Dht Applications In Manetmentioning

confidence: 99%

Section: Routingmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

DHT-based Communications Survey: Architectures and Use Cases

Hassanzadeh-Nazarabadi¹,

Taheri-Boshrooyeh²,

Otoum³

et al. 2021

Preprint

View full text Add to dashboard Cite

show abstract

“…Data routing and traffic control are the core of WANETs. Recent studies proved that the DHT-based routing protocols (e.g., 3D-RP [4][5], M-DART [6], VCP [7], Motion-MX [8], 3DcRP [9], and LA-3D-IS [10]) are better in performance compared to the traditional routing protocols, which use flooding in the route discovery phase (e.g., AODV [11], OLSR [12], and DYMO [13]). The DHT-based routing mechanism [14] avoids/reduces the network-wide flooding in the route discovery phase, thus increasing the scalability in WANETs.…”

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