Authors: S. Priyadarsini
Ad hoc network is collections of wireless mobile devices with limited broadcast range and resources, and no fixed infrastructure. The critical issue for routing in mobile ad hoc network is how to discover a secured path with longest route lifetime and also with minimum node computation. The mobility nature, power constraint of the node and the security attacks of malicious nodes cause frequent path failure. This path failure causes frequent route discovery which affects both the routing protocol performance as well as the node computation overhead. So we propose an efficient Trust based Multipath Route Discovery with improved Route Lifetime algorithm to provide trust based solution for the Security attacks which affects the routing protocol performance. We implement the proposed algorithm in AODV and the performance is evaluated. Our protocol improves the network performance and reduces the computation overhead by avoiding frequent route discovery since we select secured stable multi paths with longest life time. With the help of network simulator we can prove that our proposed protocol performs better than the existing stability-based routing protocols with improved packet delivery ratio.
Comments: 16 Pages.
[v1] 2012-08-19 01:50:28
Unique-IP document downloads: 290 times
Vixra.org is a pre-print repository rather than a journal. Articles hosted may not yet have been verified by peer-review and should be treated as preliminary. In particular, anything that appears to include financial or legal advice or proposed medical treatments should be treated with due caution. Vixra.org will not be responsible for any consequences of actions that result from any form of use of any documents on this website.
Add your own feedback and questions here:
You are equally welcome to be positive or negative about any paper but please be polite. If you are being critical you must mention at least one specific error, otherwise your comment will be deleted as unhelpful.