A Wireless Ad Hoc Network (WANET) is a self
configuring network where nodes, connected by wireless links
and can move freely by changing its topology constantly.
Wireless ad hoc network routing protocols are mainly based
on reactive routing that uses minimum hop count. A WANET
uses hop count as a parameter to measure the performance of
the wireless link between nodes. The wireless links over a
long distance may be slow or lossy that leads to poor
throughput. Due to mobility, the links between distant node is
broken quickly might be accused congestion. Therefore,
among the multiple paths from source node to destination
node we need to select a path w
hich is more stable and avoids
the congestion even if links bro
ken. In this paper we proposed
an algorithm OMRAODV that finds an optimal stable path
among the paths available in between source to destination
node. Simulation results show that OMRAODV has better
performance than MAODV in terms of the metrics: End-to-
End Delay, Packets Delivery Ratio, Throughput, Power
Consumption, Network Load, Packet Received and Packet
Lost.