Increased Energy Efficiency in AODV Routing Protocol for MANETs

XYZ
Student Master of Technology Institute Name Rajiv Gandhi Produogiki Vishwavidhayalaya, Bhopal email @yahoo.co.in Abstract Nokia has designed AODV (Adhoc on demand distance vector) routing protocol, specially for mobile adhoc networks with reduced overhead using Expanding Ring Search technique. But the energy consumption is a major issue which is to be addressed in any case along with AODV. As in MANET due to battery constrain of the nodes, energy consumption cause the nodes to be stopped working when energy of the battery is consumed fully. In this paper, I am proposing an energy efficient route discovery process for AODV. In this proposed algorithm I am putting the nodes in sleeping mode when they are idle and not working to communicate data. Energy is saved during the sleep time of the node. It imposes a waiting time for the other nodes to communicate with the sleeping node. When sleeping node wakes up then it starts communication with the other nodes if requied. Before a node goes into sleeping it will remain idle for a fixed pre defined duration to avoid the waiting time for any neighbor nodes. This method is going to reduce the energy consumption on each node and hence will be very effective in working of the network with least power requirements on each node. The proposed algorithm has two variables introduced on each node to set the maximum sleeping time and preidle time to wait idle for a period before going to sleep. The algorithm will also require to add procedures to bring a node in active state in case of emergency so that it will be interrupted during its sleeping time. This state will arise when the neighbor nodes will have lot of packets to be delivered on the sleeping time. Keywords- Energy Efficiency; AODV; MANETs; Sleep and Idle State, Timers; I. INTRODUCTION In wireless ad hoc networks, nodes have to cooperate to forward each other's packets through the networks without any fixed communication infrastructure. Ad hoc networks have been found many applications in battlefield, disaster rescue and conventions. So it is important to provide efficient congestion and contention control in ad hoc networks for keeping reliable transmission and end-to-end throughput. Along with these, a network also needs the energy efficiency on node level for the purpose of increasing the capacity of the network nodes to sustain longer with the available power. A mobile ad hoc network (MANET) which is based on IEEE 802.11 has some mobile devices that we called network nodes. Nodes connect to each other via wireless connection to both exchange interest information as well as to maintain the network connectivity. These devices are free to movement arbitrarily. Therefore, this type of network called infrastructure less network and nodes should maintain its topology [2-6]. MANET technology is employing in some areas especially where not any infrastructure network is and need to communication between some nodes such as: (i) Conferencing; (ii) Emergency Services; (iii) Military Operations. Regarding to MANETs characteristics and factors, one of important parameter which has a main rule in this type of network is energy efficiency which needs to seriously manage. Although, difference between devices, operational environments, energy management techniques and employing scenarios causes that can not introduce a comprehensive definition of energy consumption in mobile devices. This means we can not have a unique definition for all case and all devices. To control the energy consumption needs consider on the follow parameters [7]. (i) Design hardware with minimum energy consumption; (ii) Reduce complexity of calculation for reducing of using CPU and RAM and (iii) Employ some communication techniques to reduce send and receive information. Such complex technology and business models setting entails an extensive research and provides the motivation towards writing this paper. The main goal is to make to the nodes energy efficient for sustainment longer.

II. ADHOC- NETWORKS Infrastructure less (Ad hoc) Networks: In ad hoc networks [5] all nodes are mobile and can be connected dynamically in an arbitrary manner. As the range of each hosts wireless transmission is limited, so to communicate with hosts outside its transmission range, a host needs to enlist the aid of its nearby hosts in forwarding packets to the destination. So all nodes of these networks behave as routers and take part in discovery and maintenance of routes to other nodes in the network. Ad hoc Networks are very useful in emergency search-and rescue operations, meetings or conventions in which persons wish to quickly share information, and data acquisition operations in inhospitable terrain. This ad-hoc routing protocols can be divided into two categories: Table-Driven Routing Protocols: In table driven routing protocols, consistent and up-t o-date routing information to all nodes is maintained at each n ode. On-Demand Routing Protocols: In On-Demand routing protocols, the routes are created as and when required. When a source wants to send to a destination, it invokes the route discovery mechanisms to find the path to the destination. AD-HOC ROUTING PROTOCOLS DESCRIPTION Destination-Sequenced Distance-Vector: The Destination-Sequenced Distance-Vector (DSDV) Routing Algorithm is based on the idea of the classical Bellman-Ford Routing Algorithm with certain improvements. Every mobile station maintains a routing table that lists all available destinations, the number of hops to reach the destination and the sequence number assigned by the destination node. The sequence number is used to distinguish stale routes from new ones and thus avoid the formation of loops. The stations periodically transmit their routing tables to their immediate neighbors. A station also transmits its routing table if a significant change has occurred in its table from the last update sent. So, the update is both timedriven and event-driven. The routing table updates can be sent in two ways: a full dump or an incremental update. A full dump sends the full routing table to the neighbors and could span many packets whereas in an incremental update only those entries from the routing table are sent that has a metric change since the last update and it must fit in a packet. If there is space in the incremental update packet then those entries may be included whose sequence number has changed. When the network is relatively stable, incremental updates are sent to avoid extra traffic and full dump are relatively infrequent. In a fast-changing network, incremental packets can grow big so full dumps will be more frequent.

Ad Hoc On-Demand Distance Vector Routing (AODV) AODV discovers routes on an as needed basis via a similar route discovery process. However, AODV adopts a very different mechanism to maintain routing information. It uses traditional routing tables, one entry per destination. This is in contrast to DSR, which can maintain multiple route cache entries for each destination. Without source routing, AODV relies on routing table entries to propagate an RREP back to the source and, subsequently, to route data packets to the destination. AODV uses sequence numbers maintained at each destination to determine freshness of routing information and to prevent routing loops. All routing packets carry these sequence numbers. An important feature of AODV is the maintenance of timer-based states in each node, regarding utilization of individual routing table entries. A routing table entry is expired if not used recently. A set of predecessor nodes is maintained for each routing table entry, indicating the set of neighboring nodes which use that entry to route data packets. These nodes are notified with RERR packets when the next-hop link breaks. Each predecessor node, in turn, forwards the RERR to its own set of predecessors, thus effectively erasing all routes using the broken link. In contrast to DSR, RERR packets in AODV are intended to inform all sources using a link when a failure occurs. Route error propagation in AODV can be visualized conceptually as a tree whose root is the node at the point of failure and all sources using the failed link as the leaves. Dynamic Source Routing (DSR) The key distinguishing feature of DSR [4] is the use of source routing. That is, the sender knows the complete hop-by-hop route to the destination. These routes are stored in a route cache. The data packets carry the source route in the packet header. When a node in the ad hoc network attempts to send a data packet to a destination for which it does not already know the route, it uses a route discovery process to dynamically determine such a route. Route discovery works by flooding the network with route request (RREQ) packets. Each node receiving an RREQ rebroadcasts it, unless it is the destination or it has a route to the destination in its route cache. Such a node replies to the RREQ with a route reply (RREP) packet that is routed back to the original source. RREQ and RREP packets are also source routed. The RREQ builds up the path traversed across the network. The RREP routes itself back to the source by traversing this path backward. The route carried back by the RREP packet is cached at the source for future use. If any link on a source route is broken, the source node is notified using a route error (RERR) packet. The source removes any route using

this link from its cache. A new route discovery process must be initiated by the source if this route is still needed. DSR makes very aggressive use of source routing and route caching. III. PREVIOUS WORKS In this area (reducing energy consumption), we reviewed some research papers as follows: L.Tan et al. in [7] introduced an Error-aware Candidate Set Routing Protocol (ECSRP) that avoids overusing certain route. If there are more routes in the candidate set, ECSRP employ a metric achieving the tradeoff between energy efficiency and load balancing the optimal routes. The condition of the channel will be considered by examining the probable packet loss in the computation of energy consumption. C.K. Toh et al. in [8] Proposed Conditional Max-Min Battery Capacity Routing (CMMBCR). This paper chooses a shortest path if all nodes in all possible route, have sufficient battery, when the battery capacity for some nodes goes below based predefine threshold, route going through these nodes will be avoided. Therefore this algorithm was extended the life time of routing. S. Y. Wang et al. in [9] Proposed a manner for avoiding flooding in a large scale network. This paper introduced two propose as bellow: (i) Merging some small flooding message to a large one and (ii) Limiting the scope of flooding. It is shown that with using this method the flooding message reduced without delivering failure rate. Thus reducing the flooding causes reduces the energy consumption. G.Schiele et al. in [10] proposed a middle ware named SANDMAN. In this protocol any node has two state, sleep or aware. Any node after sec in idle state can go to sleep state for sec. After sec it waked up via an inside timer. Zhenxin et al. in [11] used the idle and listening state and promote saving energy. The wireless card starts the work every 5 sec if there is not any information to communicate it go to sleep again. Vijay et al. in [12] shows that in the ad hoc network there are the below fact: 1- energy consumption is significant low if the size of packet is greater than 100 byte and the bandwidth (transmission rate) is also high.2- energy consumption is significant high for sending the small packet(the size of packet is less than 100 byte)3- RF power level does not have more side effect on energy consumption if the packet size is greater than 500 byte. M. Cardei et al. in [13] by dividing networks nodes into some adjoined sets proposed a manner to maximize network lifetime. All sets of the network nodes satisfy the network function. They prove that the node participation in several sets may improve network lifetime. Regarding to mobile ad hoc network characteristics which all mobile nodes of network connect to each other via wireless, one of the important aspects of this

type of network is the limitation of amount of available energy in the network nodes that is the most critical factor in the operation of these networks. And the tremendous amount of using the mobile nodes in wireless communication medium makes Energy Efficiency (EE) a fundamental requirement for mobile ad hoc networks. On the other hand Cluster Based Routing Protocol (CBRP) is a robust/scalable routing protocol for Mobile Ad hoc Networks (MANETs) superior to the existing methods [14-16] (For example its overhead of is less than while its throughput of is more than of AODV which is a standard protocol for MANET [17]. We added the resource management protocol to the CBRP for service advertisement and service discovery [18]. Although this protocol does not have significant overhead on the network it needs more consideration about increasing the life time and especially decreasing the energy consumption. We propose the idea of putting the idle member nodes to sleep state. The experimental results show that proposed method causes decreasing energy consumption in CBRP which results to stability of the network. IV. PROPOSED WORK My proposed work is to save the energy consumption on each node requires implementing in following steps: 1. When each node comes to existence, three variables are set one for idle time value and another for sleep time value and third for queue threshold value for each node to keep an eye on congestion occurring on it due to sleeping neighbor. Idle time value will be the value of idle time for which the node will remain in idle state waiting for any neighbors communication, if no communication occurs during this time, node will start sleeping for sleep delay value. Sleeping neighbor can be interrupted when queue congestion crosses queue threshold variable. 2. A multithreaded system which will awake the node after the sleeping delay and node will check for the possible communications. 3. A multithreaded system procedure to interrupt the sleeping node to make communication if neighbors are having a congested queue to communicate with the sleeping node. The processing of the various procedures shall be done as shown in the flow chart shown in figure below. The algorithm proposed shall save lot of energy on the nodes which are having less traffic and good amount of energy on the nodes which are busy. The algorithm addresses the problem of possible congestion occurring due to sleeping node using an interrupt procedure, which will awake the sleeping node to communicate with it.

Figure: Flow Chart showing working of the proposed Algorithm

Node Checks for any neighbor tries to communicate with it

be required to evaluate whether the node should go in waiting or not. VI. CONCLUSION AND FUTURE WORK I am expecting the results as discussed and implementing the System using NS2 simulator for depicting the results. I am calculating the results to show that addition of the proposed algorithm will not affect the existing protocol by calculating the throughput of the system using various situation and number of nodes. Power calculation is done using the formula proposed by [1]. Once the results are calculated using NS2 simulator, I will further work to improve the proposed algorithm and propose the future works which can be done to improve the algorithm.

No Communication Node goes in Idle State

Node Remains in Idle State Idle Time Exceeded?

Y
Node Goes in Sleeping State Is Sleep Timer Complete?

REFERENCES
Interrupts the sleeping node

Neighbor Node Tries to Communicate with

Is Queue Threshold Reached

V. RESULTS & DISCUSSION The proposed algorithm is supposed to be saving any unnecessary energy being consumed on nodes even when they are inoperative. Saving energy consumption of the nodes is a necessity and in case of AODV the above algorithm will not produce any unwanted delay of packet delivery as it is not affecting to the nodes under communication but will only cause the nodes to go into sleep whenever any node is idle and wasting the power by sitting idle. Since an interrupt procedure is being defined to wake up any node which is in sleeping state and desired to be communicating, therefore communication will not be stopped any where during the process even when one or more nodes are in sleeping mode and conserving memory on them. The above procedure is seemingly good and do not affect the existing protocol working adversely. By the application of the proposed algorithm, I am expecting the results to very positive and will be saving energy consumption on each node by about 40-50% of the energy being consumed by the normal algorithm. This has been drawn by considering the fact that every node is not always involved in communication and idle time for the nodes is approximately 50-60% of total time it is available for communication. Some of the energy will

[1]. Seyed-Amin Hosseini-Seno, Tat-Chee Wan, Rahmat Budiarto National Advanced IPv6 Center, School of Computer Sciences Universiti Sains Malaysia, Penang, Malaysia [2]. S. Kapp, "802.11: Leaving the wire behind," IEEE Internet Computing, January-February 2002, p. 4, 2002. [3]. S. Kapp, "802.11a: More Bandwidth without the Wire," IEEE Internet Computing, p. 5, 2002. [4]. E. Danielyan, "IEEE 802.11," The Intrnet Protocol Journal, vol. 5, p. 11, 2002. [5]. IEEE802, "IEEE 802.11 Working group website,http://www.ieee802.org/11," in EEE 802.11. vol. 2009: IEEE, 2009. [6]. S. V. Saliga, "An introduction to IEEE 802.11 wireless LANs," in Radio Frequency Integrated Circuits (RFIC) Symposium, 6 June 2000. IEEE Boston, USA: IEEE, 2002, pp. 11-14. [7]. L. Tan, P. Yang, and S. Chan, "An Error-aware and Energy Efficient Routing Protocol in MANETs," in ICCCN 2007, 2007, pp. 724-729. [8]. C.-K. Toh, "Maximum Battery Life Routing to Support Ubiquitous Mobile Computing in Wireless Ad Hoc Networks," IEEE Communications Magazine, pp. 1-11, 2001. [9]. S. Y. Wang, "Reducing the energy consumption caused by flooding messages in mobile ad hoc networks," Computer Networks, vol. 42, pp. 101-118, 2003. [10]. G. Schiele and C. Becker, "SANDMAN: an Energy-Efficient Middleware for Pervasive Computing," Report 2007. [11]. F. Zhenxin and L. Layuan, "Advanced SaveEnergy Mechanism of Ad hoc Networks," in Sixth Annual IEEE International Conference on Pervasive Computing and Communications. vol. 00 Washington, DC, USA: IEEE Computer Society 2008, pp. 657-662

[12]. S. Vijay, S. C. Sharma, and S. C. Sharma, "An Analysis of Energy Efficient Communication in Ad-hoc Wireless Local Area Network," in First International Conference on Emerging Trends in Engineering and Technology: IEEE Computer Soeiety, 2008, pp. 140144. [13]. M. Cardei, Y. L. M. Thai, and W. Wu, "Energyefficient target coverage in wireless sensor networks," in INFOCOM 2005. 24th Annual Joint Conference of the IEEE Computer and Communications Societies. vol. 3 Miami, Florida: IEEE, 2005, pp. 1976- 1984. [14]. M. Abolhasan, T. Wysocki, E. Dutkiewicz, C. Liu, and J. Kaiser, "A review of routing protocols for mobile ad hoc 383 networks," Ad hoc networks, vol. 2, pp. 122, 2004. [15]. M. Jiang, J. Li, and Y. C. Tay, "Cluster Based Routing Protocol(CBRP) (INTERNET-DRAFT draft-

ietf-manetcbrp- spec-01.txt)," in National University of Singapore, I. E. T. F. (IETF), Ed., 1999, pp. 1-27. [16]. C. Liu and J. Kaiser, "A Survey of Mobile Ad Hoc network Routing Protocols," Tech.Report Series,Nr.2003-08 2003. [16]. N. Moghim, F. Hendessi, N. Movehhedinia, and T. A. Gulliver, "Ad-Hoc Wireless Network Routing Protocols and Improved AODV," in The Arabian Journal for Science and Engineering. vol. 28, 2003, pp. 99-114. [17]. S. A. Hosseini-Seno, B. Pahlevanzadeh, T. C. Wan, R. Budiarto, and S. Ramadass, "Routing Layer Service Advertisement Approach for MANETs," in International Conference on Future Networks (ICFN 2009) Bangkok- Thiland: IEEE, 2009, pp. 249-254.