Skip to Main Content
Efficient routing algorithms can provide significant benefits in a mobile ad hoc network in terms of higher throughput, lower end to end delay, and improved network performance. Many routing protocols have been proposed to efficiently discover paths from a source node to a destination node in a mobile ad hoc network. In this paper, we compare the performance of two well-known routing protocols: the ad hoc on demand distance vector routing protocol (AODV) and the optimized link state routing protocol (OLSR). Existing work has studied the routing protocols under idealistic settings where all nodes function properly. Our work addresses realistic settings where some nodes may be faulty resulting in the degradation of the performance of routing protocols. Extensive simulations were performed to analyze the impact of the number of faulty nodes on the performance of the routing protocols. Our results show that AODV outperforms OLSR in terms of packet delivery ratio while OLSR achieves a much lower end to end delay.