

Author: Ghosh Tirthankar Pissinou Niki Makki Kami
Publisher: Springer Publishing Company
ISSN: 1383-469X
Source: Mobile Networks and Applications, Vol.10, Iss.6, 2005-12, pp. : 985-995
Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.
Abstract
Designing a trusted and secure routing solution in an untrustworthy scenario is always a challenging problem. Lack of physical security and low trust levels among nodes in an ad hoc network demands a secure end-to-end route free of any malicious entity. This is particularly challenging when malicious nodes collude with one another to disrupt the network operation. In this paper we have designed a secure routing solution to find an end-to-end route free of malicious nodes with collaborative effort from the neighbors. We have also extended the solution to secure the network against colluding malicious nodes, which, to the best of our knowledge, is the first such solution proposed. We have also proposed a framework for computing and distributing trusts that can be used with out trusted routing protocol. Our proposed framework is unique and different from the other schemes in that it tries to analyze the psychology of the attacker and quantifies the behavior in the computational model. Extensive simulation has been carried out to evaluate the design of our protocol.
Related content


Associativity-Based Routing for Ad Hoc Mobile Networks
By Toh C-K.
Wireless Personal Communications, Vol. 4, Iss. 2, 1997-03 ,pp. :


Multicast Routing in Mobile Ad Hoc Networks
Telecommunication Systems, Vol. 25, Iss. 1-2, 2004-01 ,pp. :


A review of routing protocols for mobile ad hoc networks
By Abolhasan M. Wysocki T. Dutkiewicz E.
Ad Hoc Networks, Vol. 2, Iss. 1, 2004-01 ,pp. :

