In this paper, we propose a dynamic routing algorithm that leverages various trust characteristics to determine the most trusted path in a network. Trust, a multifaceted concept, encompasses attributes such as direct and indirect experiences, transitivity, directionality, context-dependence, and more. Our approach allows the routing protocol to selectively incorporate these characteristics to enhance the decision-making process. For instance, in scenarios prioritizing direct trust, nodes route packets based solely on direct interactions with their neighbors. In more complex scenarios, both direct and indirect trust are considered, utilizing recommendations from trusted nodes to establish trust with previously un-contacted nodes. We also explore the use of alternative routes based on specific trust values, ensuring sensitive data is routed through the most trustworthy paths. By integrating these trust metrics, the proposed algorithm dynamically adapts to varying network conditions and requirements, improving the overall reliability and security of the data transmission. Our experimental results demonstrate the algorithm’s effectiveness in selecting trusted paths and highlight the importance of context and adaptability in trust-based routing. This work contributes to the field by providing a flexible and robust framework for incorporating trust into dynamic routing decisions, paving the way for more secure and reliable network communication.

错误:搜索内容不能为空,请输入英文关键词
错误:关键词超出字数限制,请精简
高级检索

DrATC: Dynamic Routing Algorithm Based on Trust Characteristics

  • Davide Ferraris,
  • Lorenzo Monti

摘要

In this paper, we propose a dynamic routing algorithm that leverages various trust characteristics to determine the most trusted path in a network. Trust, a multifaceted concept, encompasses attributes such as direct and indirect experiences, transitivity, directionality, context-dependence, and more. Our approach allows the routing protocol to selectively incorporate these characteristics to enhance the decision-making process. For instance, in scenarios prioritizing direct trust, nodes route packets based solely on direct interactions with their neighbors. In more complex scenarios, both direct and indirect trust are considered, utilizing recommendations from trusted nodes to establish trust with previously un-contacted nodes. We also explore the use of alternative routes based on specific trust values, ensuring sensitive data is routed through the most trustworthy paths. By integrating these trust metrics, the proposed algorithm dynamically adapts to varying network conditions and requirements, improving the overall reliability and security of the data transmission. Our experimental results demonstrate the algorithm’s effectiveness in selecting trusted paths and highlight the importance of context and adaptability in trust-based routing. This work contributes to the field by providing a flexible and robust framework for incorporating trust into dynamic routing decisions, paving the way for more secure and reliable network communication.