A performance comparison of multi-hop wireless ad hoc network routing protocols
MobiCom '98 Proceedings of the 4th annual ACM/IEEE 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
Performance analysis of the CONFIDANT protocol
Proceedings of the 3rd ACM international symposium on Mobile ad hoc networking & computing
PGP: Pretty Good Privacy
LCN '04 Proceedings of the 29th Annual IEEE International Conference on Local Computer Networks
Security in mobile ad-hoc networks using soft encryption and trust-based multi-path routing
Computer Communications
A routing protocol based on trust for MANETs
GCC'05 Proceedings of the 4th international conference on Grid and Cooperative Computing
IEEE Network: The Magazine of Global Internetworking
Hi-index | 0.00 |
Security in infrastructure-less networks like MANETs (Mobile Ad Hoc Networks) has proven to be a challenging task. Inherently secure routing protocols is a must for operational continuity of such networks. A number of secure routing protocols based on trust have recently been proposed. These protocols use the traditional route discovery model where along with normal nodes misbehaving nodes also participate in the route discovery process to incapacitate the network. To avoid the participation of misbehaving nodes, a secure and efficient route to destination can be calculated using weighted average of the number of nodes in the route and their trust values. However, the challenge is to minimize overhead of the above weighted average based routing technique while ensuring good throughput. In this paper we propose efficient trust based multi-path dynamic source routing protocol (TMDSR). Unlike previous approaches which are based on broadcast and hence ignore the path from one hop neighbor of destination, the protocol proposed in this paper consider such path as it uses unicasting of route discovery packet from one hop neighbor of destination. Results show that our method increases the throughput of the network while minimizing the routing overhead.