Usability of Destination-Sequenced Distance Vector Routing Protocol Routes

Mehić, Miralem; Fazio, Peppino; Vozňák, Miroslav

doi:10.1109/icumt48472.2019.8970752

Cited by 10 publications

(4 citation statements)

References 14 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…During the development of methods, many protection and vulnerabilities issues were examined [11]. There are three types of routing algorithms: reactive, proactive, and hybrid.…”

Section: Related Workmentioning

confidence: 99%

Hybrid Trust Based Reputation Mechanism for Discovering Malevolent Node in MANET

Pari¹,

Sudharson²

2023

Computer Systems Science and Engineering

View full text Add to dashboard Cite

A self-contained connection of wireless links that functions without any infrastructure is known as Mobile Ad Hoc Network (MANET). A MANET's nodes could engage actively and dynamically with one another. However, MAN-ETs, from the other side, are exposed to severe potential threats that are difficult to counter with present security methods. As a result, several safe communication protocols designed to enhance the secure interaction among MANET nodes. In this research, we offer a reputed optimal routing value among network nodes, secure computations, and misbehavior detection predicated on node's trust levels with a Hybrid Trust based Reputation Mechanism (HTRM). In addition, the study designs a robust Public Key Infrastructure (PKI) system using the suggested trust evaluation method in terms of "key" generation, which is a crucial component of a PKI cryptosystem. We also concentrate on the solid node authenticating process that relies on pre-authentication. To ensure edge-to-edge security, we assess safe, trustworthy routes to secure computations and authenticate mobile nodes, incorporating uncertainty into the trust management solution. When compared to other protocols, our recommended approach performs better. Finally, we use simulations data and performance evaluation metrics to verify our suggested approach's validity Our approach outperformed the competing systems in terms of overall end-to-end delay, packet delivery ratio, performance, power consumption, and key-computing time by 3.47%, 3.152%, 2.169%, and 3.527%, 3.762%, significantly.

show abstract

“…During the development of methods, many protection and vulnerabilities issues were examined [11]. There are three types of routing algorithms: reactive, proactive, and hybrid.…”

Section: Related Workmentioning

confidence: 99%

Hybrid Trust Based Reputation Mechanism for Discovering Malevolent Node in MANET

Pari¹,

Sudharson²

2023

Computer Systems Science and Engineering

View full text Add to dashboard Cite

show abstract

“…In difference to the LoRaBlink protocol [24], [25], [26] in which enables the multi-hop communications based on the flooding mechanism, by distributing the time slotted channel synchronization from the gateway to the nodes, then the motes uses the flooding approach for the uplink data transfers. Also authors in [27] propose the Destination Sequenced Distance Vector DSDV routing protocol implemented to cover the leaf nodes which are not covered by the gateway and based on the storing routing table of node. However, the energy efficiency is not considered at all for both solutions, the only duty cycle is enabling by default for conserving the battery power energy.…”

Section: Lorawan Leach Protocolmentioning

confidence: 99%

Improved uplink throughput and energy efficiency of LoRaWAN using 2-hop LEACH protocol

Oukessou

Baslam

Oukessou

2021

IJEECS

View full text Add to dashboard Cite

The low power wide area networks (LPWAN) is the new connectivity technology that is geared towards energy constrained internet of things (IoT) devices, is starting to become one of the drivers of the re-accelerating IoT market and has one goal: ensure the wide range distance while reducing the battery energy consumption. We focus in this paper on the evaluation of the uplink throughput of the long-range wide area networks (LoRaWAN) then we attempt optimize the throughput and power dissipation using low energy adaptive clustering hierarchy (LEACH) protocol. Therefore, we exploit a novel module developed in NS-3 simulator for obtaining the first measurements scenario, then the LEACH algorithm for the second optimization case. As result, the simulation analysis will help us to add a new LoRaWAN routing protocol feature.

show abstract

“…Routing protocols for wireless sensor networks can be categorized into three types, namely: flat routing, hierarchical routing, and geographic routing. Flat routing protocols include reactive protocols such as Flat routing protocols can be reactive (On-Demand) protocols such as Dynamic Source Routing (DSR) [2], and Ad hoc On-demand Distance Vector (AODV) [19][20][21] or proactive (Table-Driven) protocols such as Destination Sequenced Distance Vector (DSDV) [22]. In hierarchical routing, nodes are divided into clusters and a cluster head is assigned to each cluster head [23][24].…”

Section: Related Workmentioning

confidence: 99%

IEGGR: Improved Energy-aware and Delivery Guarantee Geographic Routing

Redjimi

Boulaiche

Redjimi

2021

JCOMSS

View full text Add to dashboard Cite

Wireless Sensor Networks are a set of sensor nodes that probe their surroundings and send their data over multi-hop routes to a base-station (BS) for processing. Many routing protocols have been developed for WSNs. A great attention has been given to geographic routing protocols, which rely only on local knowledge of nodes to disseminate data towards the BS. In this paper, we propose a new energy efficient geographic routing protocol called Improved Energy-aware and delivery Guarantee Geographic Routing protocol (IEGGR). The proposed protocol exploits the positions of neighboring nodes, which are closest to the BS to forward packets through the shortest path in terms of energy consumption. IEGGR introduces a mechanism in order to forward packets efficiently around voids. IEGGR algorithm considers the WSN as a connected-graph and to route a packet from a source node to the BS, IEGGR tries making the locally optimal choice at each intermediate node with the hope of finding a global optimum path, which ai ms to minimize energy consumption. To find greedily the optimal path, each forwarding node exploits its neighbor positions that are closest to the BS in order to iteratively building the end-to-end optimal path. Simulation results show that IEGGR is efficient in energy management during packet forwarding.

show abstract

Usability of Destination-Sequenced Distance Vector Routing Protocol Routes

Cited by 10 publications

References 14 publications

Hybrid Trust Based Reputation Mechanism for Discovering Malevolent Node in MANET

Hybrid Trust Based Reputation Mechanism for Discovering Malevolent Node in MANET

Improved uplink throughput and energy efficiency of LoRaWAN using 2-hop LEACH protocol

IEGGR: Improved Energy-aware and Delivery Guarantee Geographic Routing

Contact Info

Product

Resources

About