Trust Based Multi Path DSR Protocol

Gera, Poonam; Garg, Kumkum; Misra, Manoj

doi:10.1109/ares.2010.87

Cited by 12 publications

(3 citation statements)

References 12 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The AODV network is also known as the Reactive Routing Protocols, as it is always available when the node is needed [12]. The following Figure 3.…”

Section: Adhoc On Demand Distance Vector Routingprotocolsmentioning

confidence: 99%

Analysis on Performance Matrices of Routing protocols of Mobile Ad-Hoc Networks

Gaba¹

2022

IJRASET

View full text Add to dashboard Cite

An ad-hoc network is a local area network which has been constructed to connect the one or more devices accordingly. It is a cluster of cellular mobile nodes that are collected with one-another, which form a transitory network, which means to form a temporary structure and there is no need of any permanent support. However, it will attach all nodes with the use of cellular network structure. At compile time, if there is any problem occur that will harm the network, than it can modify the channel from one node to another node. Therefore, because of greatly effective conditions to make networks in very difficult. To avoid these conditions that will harm the network, some protocols are introduced which includes the reactive routing protocols, pro-active routing protocols, cluster- based routing protocol, a hybrid-based routing protocol, Ad- hoc on demand distance routing protocol, optimized link state routing. This review paper gives the performance analysis of routing protocols based on their properties, characteristics, functions, and their shortcomings.

show abstract

“…The AODV network is also known as the Reactive Routing Protocols, as it is always available when the node is needed [12]. The following Figure 3.…”

Section: Adhoc On Demand Distance Vector Routingprotocolsmentioning

confidence: 99%

Analysis on Performance Matrices of Routing protocols of Mobile Ad-Hoc Networks

Gaba¹

2022

IJRASET

View full text Add to dashboard Cite

show abstract

“…Many researchers [9, 10, 17, 22–24] have shown that trust-based routing approaches can gracefully mitigate insider packet drop attacks by building trusted paths to the destination. Moreover, they showed that trust-based routing improves the packet's successful delivery under insider packet drop attacks over routing algorithms that do not consider trust.…”

Section: A Selective Forwarding-based Dos Attackmentioning

confidence: 99%

Detection and Prevention of Selective Forwarding-Based Denial-of-Service Attacks in WSNs

Cho

2013

International Journal of Distributed Sensor Networks

View full text Add to dashboard Cite

Designing wireless sensor networks (WSNs) that can work reliably in the presence of inside packet drop attackers is very challenging. Current trust mechanisms and avoidance approaches are promising but have their limitations. Avoidance approaches transmit multiple copies of the packets to avoid attackers and cause high overhead. In trust mechanisms, each sensor monitors it neighbors, evaluates their trustworthiness, classifies them as either trustworthy or untrustworthy, and then discards untrustworthy sensors from the network. However, malicious insiders, which are legitimate members of the network and know exactly what their monitoring nodes know, can launch attacks carefully to avoid being detected and discarded from the network. In this paper, we first show that this is possible by introducing a selective forwarding-based denial-of-service (DoS) attack. We then propose an enhanced trust mechanism to detect such attackers and identify their victims. Furthermore, we design two attacker-aware protocols to reroute victim nodes' packets by avoiding the attackers. We conduct extensive OPNET simulations to validate our claims and demonstrate the advantages of our proposed approaches. Finally, as a complementary defensive method to our detection and avoidance approaches, we introduce a prevention routing algorithm that proactively prevents the attack and provide our preliminary results to evaluate its performance.

show abstract

“…Instead of choosing the shortest path as in the original DSR protocol, source node will choose the path with the highest trust value in trust-based routing scheme. Due to the concern of asymmetric of trust property, in [52], when the source node needs to choose a route for data transmission, it calculates bidirectional trust value of every available routing path and then selects the one with the highest value.…”

Section: Decision Makingmentioning

confidence: 99%

A generic trust based routing protocol against internal attacks in manet

Cai¹

View full text Add to dashboard Cite

Mobile Ad Hoc Networks (MANETs) have wide applications in practice, such as rescue, emergency operations, and battlefield communications. MANETs consist of a group of mobile nodes that dynamically exchange data among themselves without the reliance on any fixed infrastructure or centralized administration. Nevertheless, mobility and self-organizing characteristics of MANETs cause the change of topology in an unpredictable way. Due to the limited transmission range, each node has to seek assistance of its neighboring nodes to help relay the data to transmit to other nodes. The reliable neighboring nodes are important for successful data transmission from a source node to a destination node. The early works providing reliable routing mainly rely on cryptographic tools to prevent malicious nodes from injecting false information into network. However, these reliable routing schemes are always coupled with prerequisites, such as authentication center, key management mechanism, which are not feasible in MANETs. Furthermore, cryptographic operations are considered computationally expensive on resource constrained mobile nodes. The most important issue is that these schemes are incapable of tracking internal attackers who are authenticated to participate in the network but misbehaved during the routing process, e.g. black hole and grey-hole attackers. Thus, there is a need to look for a lightweight approach to provide a reliable ad hoc routing. In this thesis, we present two trust-based routing schemes to prevent different routing disruption attacks, such as active black hole, passive black hole, and grey-hole nodes. The most attractive feature is that our proposed schemes are not only capable of

show abstract

Trust Based Multi Path DSR Protocol

Cited by 12 publications

References 12 publications

Analysis on Performance Matrices of Routing protocols of Mobile Ad-Hoc Networks

Analysis on Performance Matrices of Routing protocols of Mobile Ad-Hoc Networks

Detection and Prevention of Selective Forwarding-Based Denial-of-Service Attacks in WSNs

A generic trust based routing protocol against internal attacks in manet

Contact Info

Product

Resources

About