2010
DOI: 10.1049/iet-ifs.2009.0140
|View full text |Cite
|
Sign up to set email alerts
|

Trust-based on-demand multipath routing in mobile ad hoc networks

Abstract: A Mobile Ad hoc NETwork (MANET) is a self-organized system comprised of mobile wireless nodes with peer relationships. Due to multi-hop routing and absence of any trusted third party in open environment, MANETs are vulnerable to attacks by malicious nodes. In order to decrease the hazards from malicious nodes, we introduce the concept of trust to MANETs and build a simple trust model to evaluate neighbours' behaviours-packet forwarding. Extended from AODV route protocol, a trust-based reactive multipath routin… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
70
0

Year Published

2013
2013
2023
2023

Publication Types

Select...
9

Relationship

0
9

Authors

Journals

citations
Cited by 147 publications
(70 citation statements)
references
References 25 publications
0
70
0
Order By: Relevance
“…In our model, a node's trust can be considered as a subjective measurement of the node's quality of forwarding, while a route's trust can be used to anticipate the quality of forwarding packets along the route [10].…”
Section: Trust Computationmentioning
confidence: 99%
“…In our model, a node's trust can be considered as a subjective measurement of the node's quality of forwarding, while a route's trust can be used to anticipate the quality of forwarding packets along the route [10].…”
Section: Trust Computationmentioning
confidence: 99%
“…The multipath routing scheme must be able to contribute high aggregation bandwidth and fault tolerance and balance the load on multipaths. Hence a robust multipath is essential to offer reliable and robust transmission over multipaths [10], [11].…”
Section: Related Workmentioning
confidence: 99%
“…Trust-Based on-Demand Multipath Routing Protocol X. Li et al [25] proposed AOTDV routing protocol. Here, trust of a node is represented as a weighted sum of forwarding ratio and path trust is computed as a continued product of node trusts.…”
Section: Faces: Friend-based Routing Protocolmentioning
confidence: 99%
“…[16]- [18] fail to work when malicious nodes collude. Protocols proposed in [12], [13], [15]- [18], [20], [25] require each network node to work in promiscuous mode, increasing the network overhead and requires nodes to have high energy capacity as they need to overhear all the transmissions. The protocols in [12], [16], [23] increase delay in route discovery and the solution in [16], [19] result in the most trustworthy path but do not discover the shortest path.…”
Section: Faces: Friend-based Routing Protocolmentioning
confidence: 99%