Highly dynamic Destination-Sequenced Distance-Vector routing (DSDV) for mobile computers
SIGCOMM '94 Proceedings of the conference on Communications architectures, protocols and applications
NSPW '97 Proceedings of the 1997 workshop on New security paradigms
Analysis of multi-path routing
IEEE/ACM Transactions on Networking (TON)
Mitigating routing misbehavior in mobile ad hoc networks
MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
Performance analysis of the CONFIDANT protocol
Proceedings of the 3rd ACM international symposium on Mobile ad hoc networking & computing
Ariadne: a secure on-demand routing protocol for ad hoc networks
Proceedings of the 8th annual international conference on Mobile computing and networking
Self-organized network-layer security in mobile ad hoc networks
WiSE '02 Proceedings of the 1st ACM workshop on Wireless security
An on-demand secure routing protocol resilient to byzantine failures
WiSE '02 Proceedings of the 1st ACM workshop on Wireless security
Core: a collaborative reputation mechanism to enforce node cooperation in mobile ad hoc networks
Proceedings of the IFIP TC6/TC11 Sixth Joint Working Conference on Communications and Multimedia Security: Advanced Communications and Multimedia Security
The Eigentrust algorithm for reputation management in P2P networks
WWW '03 Proceedings of the 12th international conference on World Wide Web
Secure Link State Routing for Mobile Ad Hoc Networks
SAINT-W '03 Proceedings of the 2003 Symposium on Applications and the Internet Workshops (SAINT'03 Workshops)
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
Establishing trust in pure ad-hoc networks
ACSC '04 Proceedings of the 27th Australasian conference on Computer science - Volume 26
Security in wireless ad hoc networks
The handbook of ad hoc wireless networks
Secure and fault-tolerant communication in mobile ad hoc networks
Secure and fault-tolerant communication in mobile ad hoc networks
Modified clock-controlled alternating step generators
Computer Communications
Trust enhanced secure multi-path routing protocol for detecting and mitigating misbehaving nodes
Proceedings of the International Conference and Workshop on Emerging Trends in Technology
Trust based multi-path routing for end to end secure data delivery in manets
Proceedings of the 3rd international conference on Security of information and networks
Trust based security in MANET routing protocols: a survey
Proceedings of the 1st Amrita ACM-W Celebration on Women in Computing in India
Trust management in ubiquitous computing: A Bayesian approach
Computer Communications
A distributed reputation and trust management scheme for mobile peer-to-peer networks
Computer Communications
Analytical models for trust based routing protocols in wireless ad hoc networks
ACM SIGSOFT Software Engineering Notes
Multimedia Tools and Applications
Hi-index | 0.24 |
Due to their applications in situations such as emergencies, crisis management, military and healthcare, message security is of paramount importance in mobile ad-hoc networks. However, because of the absence of a fixed infrastructure with designated centralized access points, implementation of hard-cryptographic security is a challenging prospect. In this paper, we propose a novel method of message security using trust-based multi-path routing. Less trusted nodes are given lower number of self-encrypted parts of a message, making it difficult for malicious nodes to gain access to the minimum information required to break through the encryption strategy. Using trust levels, we make multi-path routing flexible enough to be usable in networks with 'vital' nodes and absence of necessary redundancy. In addition, using trust levels, we avoid non-trusted routes that may use brute force attacks and may decrypt messages if enough parts of the message are available to them. Simulation results, coupled with theoretical justification, affirm that the proposed solution is much more secured than the traditional multi-path routing algorithms.