NSPW '97 Proceedings of the 1997 workshop on New security paradigms
A new paradigm for trusted systems
NSPW '92-93 Proceedings on the 1992-1993 workshop on New security paradigms
Caching strategies in on-demand routing protocols for wireless ad hoc networks
MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
Mitigating routing misbehavior in mobile ad hoc networks
MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
Intrusion detection in wireless ad-hoc networks
MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
A logic for uncertain probabilities
International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems
Ariadne: a secure on-demand routing protocol for ad hoc networks
Proceedings of the 8th annual international conference on Mobile computing and networking
A Secure Routing Protocol for Ad Hoc Networks
ICNP '02 Proceedings of the 10th IEEE International Conference on Network Protocols
Valuation of Trust in Open Networks
ESORICS '94 Proceedings of the Third European Symposium on Research in Computer Security
Intrusion Detection Using Mobile Agents in Wireless Ad Hoc Networks
KMN '02 Proceedings of the IEEE Workshop on Knowledge Media Networking
Kerberos assisted Authentication in Mobile Ad-hoc Networks
ACSC '04 Proceedings of the 27th Australasian conference on Computer science - Volume 26
Establishing trust in pure ad-hoc networks
ACSC '04 Proceedings of the 27th Australasian conference on Computer science - Volume 26
IEEE Network: The Magazine of Global Internetworking
| Hi-index | 0.00 |
Ad-hoc networks are frequently used to establish communication in improvised environments without requiring any fixed infrastructure. These networks are formed with the help of their constituent wireless nodes, which are expected to forward packets for other nodes according to a pre-agreed upon protocol. The Dynamic Source Routing (DSR) protocol is one such protocol that helps to create and maintain routes in an ad-hoc network in spite of the dynamic topology. The accurate execution of this protocol requires sustained benevolent behaviour by all nodes participating in the network. This behaviour may not always be observed, and a number of known attacks against the standard DSR protocol can lead to its incorrect execution, and even failure. In this paper, we present a novel technique of discovering and maintaining dependable routes in an ad-hoc network even in the presence of malicious nodes. With the results from extensive simulations, we highlight the efficacy of our scheme and accentuate that it outperforms the DSR protocol when as many as 40% of the nodes are acting maliciously.