TY - GEN
T1 - Collaborative trust-based shortest secure path discovery in mobile ad hoc networks
AU - Oh, Seungtak
AU - Lee, Chilgee
AU - Choo, Hyunseung
PY - 2006
Y1 - 2006
N2 - As routes in MANET are composed of only mobile terminals based on a multi-hop mechanism, MANET may encounter severe situations where intermediate nodes disturb delivering packets adversely. Accordingly, the stability of routing protocols is very important for operating the ad hoc networks efficiently and securely. However finding a secure end-to-end path is not easy, since the nodes in MANET are characterized by uncertain trust relationship each other. In this paper, a comprehensive mechanism for discovering the most secure and shortest paths, is proposed. This proposed mechanism is based on the Dijkstra algorithm, and regards distance weight and trust weight highly. The metric value which can determine the routing path is to be extracted from the distance value and the trust level. According to the simulation results, even though the communication cost increases up to about 8%, the security level of the shortest path is improved significantly.
AB - As routes in MANET are composed of only mobile terminals based on a multi-hop mechanism, MANET may encounter severe situations where intermediate nodes disturb delivering packets adversely. Accordingly, the stability of routing protocols is very important for operating the ad hoc networks efficiently and securely. However finding a secure end-to-end path is not easy, since the nodes in MANET are characterized by uncertain trust relationship each other. In this paper, a comprehensive mechanism for discovering the most secure and shortest paths, is proposed. This proposed mechanism is based on the Dijkstra algorithm, and regards distance weight and trust weight highly. The metric value which can determine the routing path is to be extracted from the distance value and the trust level. According to the simulation results, even though the communication cost increases up to about 8%, the security level of the shortest path is improved significantly.
UR - https://www.scopus.com/pages/publications/33746612323
U2 - 10.1007/11758525_145
DO - 10.1007/11758525_145
M3 - Conference contribution
AN - SCOPUS:33746612323
SN - 3540343814
SN - 9783540343813
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 1089
EP - 1096
BT - Computational Science - ICCS 2006
PB - Springer Verlag
T2 - ICCS 2006: 6th International Conference on Computational Science
Y2 - 28 May 2006 through 31 May 2006
ER -