The Ad Hoc on-demand distance-vector protocol
Ad hoc networking
| Hi-index | 0.00 |
In wireless ad hoc networks heterogeneity is inherent; each node has different characteristics, resources and purpose. Current ad hoc routing protocols do not take node heterogeneity into account when making routing decisions; they consider each node indentical in capabilities. We propose a simple way to modify the route discovery phase of an on-demand routing protocol to choose the "best" route, considering heterogeneity. The Ad hoc On-Demand Distance Vector Routing protocol (AODV) [1] is modified and the performance validated in experimental tests. It is shown that by considering heterogeneity during route discovery, paths that contain more capable nodes are utilized, thereby avoiding resource-poor nodes.