A mobile ad-hoc network (MANET) is a peer-to-peer wireless network, that is, nodes can communicate with each other without the use of infrastructure. Besides, nodes are free to join and/or leave the network at anytime, move randomly and organize themselves arbitrarily. Due to this nature of MANET, there could be some malicious and selfish nodes that try compromise the routing protocol functionality and make MANET vulnerable to security attacks which lead to unreliable routing. The current work presents a reliant ad hoc on-demand distance vector routing (R-AODV) based on trusted and shortest path and compare to AODV trust framework to which have been used to overcome the mentioned problem as well. The performance differentials are analyzed using various metrics which are packet delivery fraction, average end-to-end delay, and normalized routing load. The algorithm is implemented and simulated using NS2. The performance differentials are analyzed using various metrics which are packet delivery fraction, average end-to-end delay, and normalized routing load. The results revealed that the developed R-AODV exhibits good performance. Moreover, the proposed routing mechanism is competitive, as compare to trust ad hoc on-demand distance vector (TAODV).
Key words: Reliability, mobile ad-hoc network (MANET), routing protocol
Copyright © 2019 Author(s) retain the copyright of this article.
This article is published under the terms of the Creative Commons Attribution License 4.0