Journal ArticleDOI
Trust-based on-demand multipath routing in mobile ad hoc networks
TLDR
A trust-based reactive multipath routing protocol, ad hoc on-demand trusted-path distance vector (AOTDV), is proposed for MANETs and the results show that AotDV improves packet delivery ratio and mitigates the impairment from black hole, grey hole and modification attacks.Abstract:
A mobile ad hoc network (MANET) is a self-organised system comprised of mobile wireless nodes. All nodes act as both communicators and routers. Owing to multi-hop routing and absence of centralised administration in open environment, MANETs are vulnerable to attacks by malicious nodes. In order to decrease the hazards from malicious nodes, the authors incorporate the concept of trust to MANETs and build a simple trust model to evaluate neighbours’ behaviours – forwarding packets. Extended from the ad hoc on-demand distance vector (AODV) routing protocol and the ad hoc on-demand multipath distance vector (AOMDV) routing protocol, a trust-based reactive multipath routing protocol, ad hoc on-demand trusted-path distance vector (AOTDV), is proposed for MANETs. This protocol is able to discover multiple loop-free paths as candidates in one route discovery. These paths are evaluated by two aspects: hop counts and trust values. This two-dimensional evaluation provides a flexible and feasible approach to choose the shortest path from the candidates that meet the requirements of data packets for dependability or trust. Furthermore, the authors give a routing example in details to describe the procedures of route discovery and the differences among AODV, AOMDV and AOTDV. Several experiments have been conducted to compare these protocols and the results show that AOTDV improves packet delivery ratio and mitigates the impairment from black hole, grey hole and modification attacks.read more
Citations
More filters
Journal ArticleDOI
Trust prediction and trust-based source routing in mobile ad hoc networks
TL;DR: This paper presents a dynamic trust prediction model to evaluate the trustworthiness of nodes, which is based on the nodes’ historical behaviors, as well as the future behaviors via extended fuzzy logic rules prediction, and integrated the proposed trust predication model into the Source Routing Mechanism.
Journal ArticleDOI
TSRF: A Trust-Aware Secure Routing Framework in Wireless Sensor Networks
TL;DR: This paper proposes a trust-aware secure routing framework (TSRF) with the characteristics of lightweight and high ability to resist various attacks and shows with the help of simulations that TSRF can achieve both intended security and high efficiency suitable for WSN-based networks.
Journal ArticleDOI
Trust-Distortion Resistant Trust Management Frameworks on Mobile Ad Hoc Networks: A Survey
TL;DR: This work presents a holistic view on various trust management frameworks geared for MANETs, capable to handle main existing attacks deceiving trustworthiness computation to mislead trust-based network operations, referred to as trust-distortion attacks.
Journal ArticleDOI
Sensitivity Analysis of an Attack-Pattern Discovery Based Trusted Routing Scheme for Mobile Ad-Hoc Networks in Industrial IoT
TL;DR: This work summarizes the attack-pattern discovery mechanism, trust model, and routing mechanism adopted by TRS-PD in order to counter the adversaries which follow certain attack patterns along with other adversaries.
Journal ArticleDOI
Trust based routing mechanism for securing OSLR-based MANET
TL;DR: This paper extends OLSR by using the proposed trust model and trust based routing algorithm, called FPNT-OLSR, and designs a trust factor collecting method and an efficient trust information propagating method, which do not generate extra control messages.
References
More filters
Proceedings ArticleDOI
Ad-hoc on-demand distance vector routing
C.E. Perkins,E.M. Royer +1 more
TL;DR: An ad-hoc network is the cooperative engagement of a collection of mobile nodes without the required intervention of any centralized access point or existing infrastructure and the proposed routing algorithm is quite suitable for a dynamic self starting network, as required by users wishing to utilize ad- hoc networks.
Dynamic Source Routing in Ad Hoc Wireless Networks.
David B. Johnson,David A. Maltz +1 more
TL;DR: In this article, the authors present a protocol for routing in ad hoc networks that uses dynamic source routing, which adapts quickly to routing changes when host movement is frequent, yet requires little or no overhead during periods in which hosts move less frequently.
Book ChapterDOI
Dynamic Source Routing in Ad Hoc Wireless Networks
David B. Johnson,David A. Maltz +1 more
TL;DR: This paper presents a protocol for routing in ad hoc networks that uses dynamic source routing that adapts quickly to routing changes when host movement is frequent, yet requires little or no overhead during periods in which hosts move less frequently.
Proceedings ArticleDOI
Highly dynamic Destination-Sequenced Distance-Vector routing (DSDV) for mobile computers
TL;DR: The modifications address some of the previous objections to the use of Bellman-Ford, related to the poor looping properties of such algorithms in the face of broken links and the resulting time dependent nature of the interconnection topology describing the links between the Mobile hosts.
Book ChapterDOI
The Sybil Attack
TL;DR: It is shown that, without a logically centralized authority, Sybil attacks are always possible except under extreme and unrealistic assumptions of resource parity and coordination among entities.