History Based Reliability: A novel routing metric in mobile ad hoc networks

A mobile ad hoc network has a dynamic topology. A route probably fails if intermediate nodes of the route have high mobility. In order to choose reliable nodes in a route, we define and quantify a novel routing metric called HBR that avoids choosing nodes with frequent failure history. Thus, route failure probability is decreased. We propose a routing scheme called HAODV based on the HBR metric. In HAODV, source node is able to determine its desired minimum reliability of route. HAODV is able to avoid waste of bandwidth caused by unreliable nodes. HAODV finds the most reliable route with a low overhead. Our simulation experiments show that HAODV improves packet delivery ratio when nodes are mobile.