%0 Conference Proceedings
%T A Metric for Adaptive Routing on Trustworthy Paths
%+ Technische Universität Dresden = Dresden University of Technology (TU Dresden)
%A Hofmann, Christoph
%A Franz, Elke
%A Santini, Silvia
%Z Part 1: Network Security
%< avec comité de lecture
%( Lecture Notes in Computer Science
%B International Workshop on Open Problems in Network Security (iNetSec)
%C Zurich, Switzerland
%Y Jan Camenisch
%Y Doğan Kesdoğan
%3 Open Problems in Network Security
%V LNCS-9591
%P 11-25
%8 2015-10-29
%D 2015
%R 10.1007/978-3-319-39028-4_2
%K Adaptive routing
%K Attacker model
%K Trustworthiness
%K Local trust rating
%Z Computer Science [cs]Conference papers
%X Any data transmission over multiple hops requires the use of routing algorithms to find a path from the sender to the receiver(s). Supporting secure data transmissions further requires the selected path to be trustworthy, i.e., not under the control of an attacker. Since attacks can occur at any time during data transmission, the current state of the network must be considered when selecting trustworthy paths. In this paper, we introduce a novel metric – called Locally Evaluated Trust (LET) – for local trust evaluation. The LET metric can be used by adaptive routing algorithms to select a trustworthy path. To evaluate our approach, we simulate different routing algorithms and compare their performance in the presence of one or more malicious nodes in a two-dimensional torus mesh. Our results show that the LET metric allows adaptive routing algorithms to effectively identify and circumvent malicious nodes.
%G English
%Z TC 11
%Z WG 11.4
%2 https://inria.hal.science/hal-01445790/document
%2 https://inria.hal.science/hal-01445790/file/416270_1_En_2_Chapter.pdf
%L hal-01445790
%U https://inria.hal.science/hal-01445790
%~ IFIP-LNCS
%~ IFIP
%~ IFIP-TC
%~ IFIP-WG
%~ IFIP-TC11
%~ IFIP-WG11-4
%~ IFIP-LNCS-9591
%~ IFIP-INETSEC