IJSRD - International Journal for Scientific Research & Development| Vol. 3, Issue 01, 2015 | ISSN (online): 2321-0613 All rights reserved by www.ijsrd.com 1010 Dynamic Reliable Low Energy Cost Routing Algorithm for Wireless Ad Hoc Network P. Vasanthi 1 S. Vadivel 2 1 M.E Multimedia Technology 2 Assistant Professor 1,2 Department of Computer Science & Engineering 1,2 K.S.R. College of Engineering Abstract— A wireless ad hoc network (WANET) is a not centralized type of wireless network. Energy-aware reliable routing algorithms for wireless ad hoc networks, called Dynamic Reliable Low Energy Cost Routing (DRLECR) protocol implemented by an AODV. DRLECR can increases the operational lifetime of the network by using efficient energy and reliable routes. Finding reliable routes can increase the level of excellence of the service. AODV is an on-demand routing protocol in which it discover network destination dynamically. Routers will communicate with the adjacent routers which inform network to which each router is connected. When traffic changes these routers adjust automatically. So it is simple to configure on larger networks, and if a link goes down it choose a different route dynamically. Key words: DRLECR, AODV, battery-aware routing, end-to end and hop-by-hop retransmission, reliability, wireless ad hoc networks I. INTRODUCTION A wireless ad hoc network (WANET) is a decentralized type of wireless network. The network is ad hoc because it does not have any fixed infrastructure, such as routers in wired networks or access points in managed wireless networks. A routing protocol plays important role for communication and also to find efficient path. Each node in network participates in routing by forwarding data to other nodes, so based on the network connectivity the determination of which nodes forward data is made dynamically. The proactive protocols expose short delay in the packets transmission and it consumes more bandwidth to maintain entire network information. Design of wireless ad hoc network protocols is achieved by three requirements: energy efficiency, reliability, and increasing network lifetime. By considering the energy consumed for end-to-end (E2E) packet traversal, it finds routes. Nevertheless, this should not result in overusing a specific set of nodes in the network or finding less reliable routes. Without considering the reliability of links and residual energy of nodes energy-efficient routing in ad hoc networks is neither complete nor efficient. The quality of the service is achieved by finding reliable routes. II. LITERATURE SURVEY We can broadly group them into three categories. The first category is to find more reliable routes by includes algorithms that consider the reliability of links. ETX (Expected Transmission Count) is used to find reliable routes that consist of links requiring less number of retransmissions for lost packet recovery. Although such routes may consume less energy since they require less number of retransmissions, they do not necessarily minimize the energy consumption for E2E packet traversal. Considering a higher priority for reliability of routes may result in overusing some nodes. If some links are more reliable than other links, then that links will frequently be used to forward packets. Nodes in that links will then fail quickly, because they have to forward many packets on behalf of other nodes. The second category includes algorithms that used to find energy-efficient routes. These algorithms do not consider the remaining battery energy of nodes to avoid overuse of nodes, even though some of them address energy-efficiency and reliability together. Apart from this, many routing algorithms – including energy-efficient algorithms proposed in has a major drawback. It does not consider the actual energy consumption of nodes to discover energy efficient routes. It considers the transmission power of nodes. The energy cost of a path is calculated as a fraction of the actual energy cost of nodes for transmission along a path. This affects the reliability, energy efficiency and network lifetime The third category includes algorithms that try to increase the network lifetime by finding routes consisting of nodes with a higher level of battery energy. Fig. 1: System Architecture Diagram