International Journal of Computer Applications (0975 – 8887) Volume 71– No.2, May 2013 27 Performance Improvement of Mobile Ad-hoc Networks through Energy Conservation Scheme Poonam Shrivastava Amit kumar Sinhal Abhishek Gupta Technocrates Institute of Technocrates Institute of TRUBA Institute of Engineering & Technology, Anand Nagar Technology, Anand Nagar Information Technology Bhopal, India Bhopal, India Bhopal, India ABSTRACT MANET is a collection of mobile node in a wireless network having communication between them without any centralized control or established infrastructure. Energy consumption in the wireless interface of the mobile node can be eliminated or reduced. Here, we have discussed various energy awareness schemes responsible for energy optimization. The main goal of the proposed methodology, is to create a new scheme based on energy conservations, that helps each and every node to save its energy to certain extent and so that it can actively participate in the transmission process for the long term, thus to reduce the idle energy consumption within the network. The algorithms of all categories are compatible with such scheme. These functionality strategies are architecture of the routing protocol. Here, a new model has been developed that is elaborated form of AODV protocol based on energy conservation scheme. i.e E- AODV. Thus in this paper, the focus is on methods used in energy based algorithms to reduce the power consumed in communications between ad hoc network nodes. Keywords MANET, AODV, Energy, TCP, E-AODV; 1. INTRODUCTION A wireless Adhoc network which can be established by wireless computer (nodes) is a temporary network. In such types of networks no infrastructure is required such as base stations and access points. Since no base station are supported in such an environment and mobile host communicate in a multi-hop fashion thus temporary network connectivity is required such as in battlefields, disaster areas, and meetings, because of their capability of handling node failures and fast topology changes[1]. This paper addresses the issue of energy-conserving routing protocols in ad hoc networks of mobile hosts. Adhoc networks are multi-hop, wireless networks where all mobile hosts or nodes cooperatively maintain network connectivity without communication infrastructures for routing. Many different routing protocols have been proposed in the literature and submitted to the Internet Engineering Task Force (IETF) Mobile Ad Hoc Network (MANET) Group. A major issue in these algorithms is to find a shortest path consisting of minimum number of intermediate forwarding nodes between a source and a destination. However, it is possible that some particular mobile nodes are unfairly burdened to support many packet-relaying functions. This hot spot node may consume more battery energy and stops running earlier than other nodes disrupting the overall ad hoc network. This is particularly true for some optimized routing protocols that prefer specific mobile nodes in the selection of routing paths [2]. 2. AODV The ad hoc mobile network uses a routing protocol known as Ad hoc On Demand Distance Vector (AODV) routing protocol. AODV can be used for both unicast and multicast routing. It is known as On-demand routing algorithm because routes are established between nodes only as desired by source nodes and maintain them as long as they are needed by the sources. In AODV the sequence numbers of the nodes are used to ensure the freshness of routes. Under highly dynamic link conditions, reactive protocols are expected to generate fewer overhead messages and provide a more reliable routing than proactive routing protocols. Route discovery and route maintenance for AODV are described below. 2.1. Route Discovery Whenever a traffic source needs a route to a destination the route discovery process is initiated. Route discovery typically involves a network-wide flood of route request (RREQ) packets targeting the destination and waiting for a route reply (RREP). An intermediate node receiving a RREQ packet first sets up a reverse path to the source using the previous hop of the RREQ as the next hop on the reverse path. If a valid route to the destination is available, then the intermediate node generates a RREP, else the RREQ is re-broadcast. Duplicate copies of the RREQ packet received at any node are discarded. When the destination receives a RREQ, it also generates a RREP. The RREP is routed back to the source via the reverse path. As the RREP proceeds towards the source, a forward path to the destination is established. 2.2. Route Maintenance Route maintenance is done using route error (RERR) packets. When a link failure is detected, a RERR is sent back via separately maintained predecessor links to all sources using that failed link. Routes are erased by the RERR along its way. When a traffic source receives a RERR, it initiates a new route discovery if the route is still needed. Unused routes in the routing table are expired using a timer-based technique. 3. ENERGY CONSUMPTION IN AODV NETWORK Energy consumption in AODV network composed of different sources. Since the rate of battery performance improvement is rather slow currently, and in the absence of breakthroughs in this field, other measures have to be taken to achieve the goal of getting more performance out of the currently available battery resources. So, in our study, we focus our efforts on methods to reduce the power consumed in communications between ad hoc network nodes.