A Formal Study of Trust-Based Routing in Wireless Ad Hoc Networks

@article{Zhang2010AFS,
  title={A Formal Study of Trust-Based Routing in Wireless Ad Hoc Networks},
  author={Chi Zhang and Xiao-yan Zhu and Yang Song and Yuguang Fang},
  journal={2010 Proceedings IEEE INFOCOM},
  year={2010},
  pages={1-9}
}
Recently, trust-based routing has received much attention as an effective way to improve security of wireless ad hoc networks (WANETs). Although various trust metrics have been designed and incorporated into the routing metrics, as far as we know, none of the existing works have used mathematical tools such as routing algebra to analyze the compatibility of trust related routing metrics and routing protocols in WANETs. In this paper, we first identify unique features of trust metrics compared… Expand
TSRF: A Trust-Aware Secure Routing Framework in Wireless Sensor Networks
TLDR
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. Expand
Trust-aware and link-reliable routing metric composition for wireless sensor networks
TLDR
A novel composite routing metric is presented, combining link reliability and trust-awareness in an additive manner, fulfilling the theoretical requirements of the Routing Protocol for Low Power and Lossy Networks. Expand
New trust metric for the RPL routing protocol
Establishing trust relationships between routing nodes represents a vital security requirement to establish reliable routing processes that exclude infected or selfish nodes. In this paper, weExpand
Trust Model Based Uncertainty Analysis Between Multi-path Routes in MANET Using Subjective Logic
TLDR
A novel subjective logic (SL) trust model for handling ignorance between neighbor nodes in ad hoc network and highlighting that SL is not enough to evaluate multi path trust, thus providing selection operator as an SL extension is highlighted. Expand
Trust evaluation method adapted to node behavior for secure routing in mobile ad hoc networks
TLDR
The adaptive time window is introduced which is the time period for evaluating a trust value and each node uses a variable time window for each neighbor and reduces the undesirable effects of past behaviors in this way, each node calculates trust values correctly in the environment including nodes with behavior change. Expand
A Trust Model Focusing on Node Usage in Mobile Ad Hoc Networks
  • Nanaka Asai, Sonoko Goka, H. Shigeno
  • Computer Science
  • 2019 IEEE International Conference on Pervasive Computing and Communications Workshops (PerCom Workshops)
  • 2019
TLDR
A trust model focusing on node usage against MANETs On-Off attack (TMUMO) is proposed, which improves detection rate of attack nodes and packet delivery rate in MANets, and shows feasibility of the trust model. Expand
A new trust model for trustworthiness-based routing protocols in sensor networks
  • M. Yu, W. Liu, Tian Xing
  • Computer Science
  • 2012 19th International Conference on Mechatronics and Machine Vision in Practice (M2VIP)
  • 2012
TLDR
The trustworthiness of a node is selected as a routing metric so that the nodes with malicious behavior can be avoided and the effectiveness of the proposed trustworthiness model has increased the security and improved the performance of the anonymous protocol. Expand
A Secure Routing Protocol with Trust and Energy Awareness for Wireless Sensor Network
TLDR
A Trust and Energy aware Secure Routing Protocol (TESRP) for WSN that exploits a distributed trust model for discovering and isolating misbehaving nodes and achieves improved performance in terms of energy consumption, throughput and network lifetime as compared to existing solutions. Expand
Dynamic Trust Management for Mobile Networks and Its Applications.
TLDR
Through model-based analysis with simulation validation, it is shown that the dynamic trust management based protocols outperform non-trustbased and Bayesian trust-based protocols in the presence of malicious, erroneous, partly trusted, uncertain and incomplete information, and are resilient to trust related attacks. Expand
GradeTrust: A secure trust based routing protocol for MANETs
TLDR
GradeTrust is proposed, a secure routing protocol for MANETs based on the trust levels of network nodes that uses trust to isolate black hole routing attacks thus offering secure routing of data traffic as well as improved packet delivery ratio. Expand
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 24 REFERENCES
Information theoretic framework of trust modeling and evaluation for ad hoc networks
TLDR
Simulations show that the proposed trust evaluation system can significantly improve the network throughput as well as effectively detect malicious behaviors in ad hoc networks. Expand
A Trustworthiness-based QoS routing protocol for wireless ad hoc networks
  • M. Yu, K. Leung
  • Computer Science
  • IEEE Transactions on Wireless Communications
  • 2009
TLDR
A new secure routing protocol (SRP) with quality of service (QoS) support, called trustworthiness-based quality of Service (TQOS) routing, which includes secure route discovery, secure route setup, and trustworthy-based QoS routing metrics is presented. Expand
On trust models and trust evaluation metrics for ad hoc networks
TLDR
This work uses the theory of semirings to show how two nodes can establish an indirect trust relation without previous direct interaction, and shows that the semiring framework is flexible enough to express other trust models, most notably PGP's Web of Trust. Expand
A Reputation-Based Metric for Secure Routing in Wireless Mesh Networks
TLDR
A new routing metric aimed at mitigating the effects of routing protocol attacks is presented, based on an estimation of the trustworthiness level of network nodes, which shows that it is possible to increase both the security level and the performance of the overall network, even in the presence of routing attacks. Expand
Design Guidelines for Routing Metrics in Multihop Wireless Networks
  • Yaling Yang, J. Wang
  • Computer Science
  • IEEE INFOCOM 2008 - The 27th Conference on Computer Communications
  • 2008
TLDR
This work provides important guidelines for designing routing metrics and identifies the specific properties that a routing metric must have in order to be combined with certain type of routing protocols. Expand
Modeling Secure Connectivity of Self-Organized Wireless Ad Hoc Networks
TLDR
A generic model to evaluate the relationship of connectivity, memory size, communication overhead and security in fully self-organized WANETs shows that when the average number of authenticated neighbors of each node is Theta(1), with respect to the network size n, most of the nodes can be securely connected, forming a connected secure backbone, i.e., the secure network percolates. Expand
An algebraic theory of dynamic network routing
TLDR
A non-classic algebraic theory is developed for investigating the convergence properties of dynamic routing protocols and shows that routing protocols can be made to converge to shortest and widest paths, but that the composite metric of Internet Gateway Routing Protocol (IGRP) does not lead to optimal paths. Expand
Mobility helps security in ad hoc networks
TLDR
It is shown that node mobility can be useful to provide security in ad hoc networks and that the time necessary to set up the security associations is strongly influenced by several factors, including the size of the deployment area, the mobility patterns, and the number of friends. Expand
Opportunistic Routing Algebra and its Applications
TLDR
A new OR algebra based on the routing algebra proposed for inter-domain routing is designed, the essential properties of OR are identified in the mathematical language of the OR algebra, and the design space is analyzed in terms of routing metrics for various routing requirements. Expand
Algebra and algorithms for QoS path computation and hop-by-hop routing in the Internet
  • J. L. Sobrinho
  • Computer Science
  • Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213)
  • 2001
TLDR
It is concluded that shortest-widest paths can neither be computed with a generalized Dijkstra's algorithm nor can packets be routed hop-by-hop over those paths. Expand
...
1
2
3
...