Energy Efficiency in Ad Hoc Wireless Networks with Node-disjoint Path Routing

Routing in ad hoc mobile networks is a problem which is not satisfactorily solved yet. Traditional techniques of routing are not well adapted to new networks. Indeed, their lack of reactivity with respect to the traffic and network changes make them not easily usable but at the price of an oversizing of the network resources (network bandwidth, node memory utilization, node CPU load, etc). The research community was interested these last years in the improvement of the ad hoc routing, and among the solutions suggested the multipath routing has been considered. Multiple paths are exploited in order to ensure reliability, quick time reaction to changes with a low overhead generated by the control messages. We present in this article, an extension of the well known routing protocol AODV (Ad hoc On-demand Distance Vector). We propose to improve the multipath routing strategy with a path classification enabling the choice of the paths having the best energy level.