Collaborative trust-based shortest secure path discovery in mobile ad hoc networks
- Authors
- Oh, S[Oh, Seungtak]; Lee, C[Lee, Chilgee]; Choo, H[Choo, Hyunseung]
- Issue Date
- 2006
- Publisher
- SPRINGER-VERLAG BERLIN
- Citation
- COMPUTATIONAL SCIENCE - ICCS 2006, PT 2, PROCEEDINGS, v.3992, pp.1089 - 1096
- Indexed
- SCIE
SCOPUS
- Journal Title
- COMPUTATIONAL SCIENCE - ICCS 2006, PT 2, PROCEEDINGS
- Volume
- 3992
- Start Page
- 1089
- End Page
- 1096
- URI
- https://scholarworks.bwise.kr/skku/handle/2021.sw.skku/88979
- ISSN
- 0302-9743
- 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.
- Files in This Item
- There are no files associated with this item.
- Appears in
Collections - Information and Communication Engineering > Information and Communication Engineering > 1. Journal Articles
- Software > Software > 1. Journal Articles
- Computing and Informatics > Computer Science and Engineering > 1. Journal Articles
![qrcode](https://api.qrserver.com/v1/create-qr-code/?size=55x55&data=https://scholarworks.bwise.kr/skku/handle/2021.sw.skku/88979)
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.