Collaborative trust-based shortest secure path discovery in mobile ad hoc networks

Authors:
Seungtak Oh;Chilgee Lee;Hyunseung Choo
Affiliations:
School of Information and Communication Engineering, Sungkyunkwan University, Suwon, Korea;School of Information and Communication Engineering, Sungkyunkwan University, Suwon, Korea;School of Information and Communication Engineering, Sungkyunkwan University, Suwon, Korea
Venue:
ICCS'06 Proceedings of the 6th international conference on Computational Science - Volume Part II
Year:
2006

Citing 6
Cited 0

A Secure Routing Protocol for Ad Hoc Networks

ICNP '02 Proceedings of the 10th IEEE International Conference on Network Protocols
Self-Organized Public-Key Management for Mobile Ad Hoc Networks

IEEE Transactions on Mobile Computing
Ad-hoc On-Demand Distance Vector Routing

WMCSA '99 Proceedings of the Second IEEE Workshop on Mobile Computer Systems and Applications
SEAD: Secure Efficient Distance Vector Routing for Mobile Wireless Ad Hoc Networks

WMCSA '02 Proceedings of the Fourth IEEE Workshop on Mobile Computing Systems and Applications
Collaborative Trust-based Secure Routing Against Colluding Malicious Nodes in Multi-hop Ad Hoc Networks

LCN '04 Proceedings of the 29th Annual IEEE International Conference on Local Computer Networks
Mobility Helps Peer-to-Peer Security

IEEE Transactions on Mobile Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.