ENERGY A ARE MULTIPATH ON DEMAND DISTANCE VECTOR ROUTING IN MANETs

Abstract

In ad hoc networks, energy conservation is a very important design issue as most of the ad hoc network participants operate on battery. Since most routing protocols are flooding, conserving battery power in this process is essential. Most of the proposed routing protocols concentrate on finding and maintaining routes in the face of changing topology caused by either mobility or decreasing battery power. In this work we consider the routing problem in Mobile Ad hoc Networks (MANETs) with the goal of conserving battery power of nodes and reducing route discovery frequency. We propose a routing algorithm that works better in static as well as dynamic conditions as compared to other routing protocols. Our approach is based on the formulation of multipath flow with consideration of remaining battery power of node. If remaining battery power of a node is small, then it will not take part in the route discovery process and will not forward packets on behalf of others. Hence battery power of the node will be preserved. The protocol is mutable for both static and dynamic ad hoc networks. Performance comparison of our protocol with some well known protocol using JiST/SWAN simulator shows that our protocol is able to achieve a remarkable improvement in saving battery power, reducing end to end delay, and is also able to reduce routing overheads.