Web Site: www.ijettcs.org Email: editor@ijettcs.org, editorijettcs@gmail.

com Volume 1, Issue 3, September October 2012 ISSN 2278-6856

Energy Efficient Routing Algorithms for Mobile Ad Hoc Networks A Survey

Anjum Asma1, Gihan Nagib2
1

Information Technology Department, College of Computer and Information Sciences King Saud University, Riyadh, Kingdom of Saudi Arabia
2

Electrical Engineering Department, Faculty of Engineering, Fayoum University, Egypt.

Abstract: Nodes in Mobile Ad-hoc Networks (MANET) are

limited battery-powered so, the energy efficiency is one of the primary metrics of interest. Energy efficient routing in MANETs is considered as a major issue. In this paper energy efficient routing algorithms for MANETs are surveyed and categorized on the basis of the metrics used for energy efficient routing. These algorithms are analyzed in highlighting their strengths and deficiencies.

Keywords: energy efficiency; Algorithms; Routing

MANETS;

Metrics;

1. INTRODUCTION
Mobile Ad Hoc Network (MANET) consists of a collection of mobile nodes which are not bounded in any infrastructure. MANET nodes can communicate with each other directly or indirectly through intermediate nodes. Non-restricted mobility and easy deployments characteristics of MANETs make them very popular and highly suitable for applications like emergencies, natural disasters and military operations [1]. An example of MANET is shown in figure 1.

communication state: transmitting, receiving, listening or sleeping state [2]. Any power failure of a node will affect the overall network lifetime. As a result, energy efficiency should be taken into consideration as it is a critical and extensive research issue. Mobile phones, laptops and PDAs are the devices used as nodes in MANETs, as shown in figure 1. Researchers and industry both are working on the mechanism to prolong the lifetime of these devices. Hardware manufacturers are also coming forward to help in saving the battery power by making energy efficient devices like energy efficient CPUs, low power display units, efficient algorithms for hardware processing and high density batteries. The rest of the paper is organized as follows. Section 2 presents a brief description of routing protocols for MANET. Section 3 describes and classifies energy efficient algorithms for MANET. Section 4 includes the comparative study of the algorithms. Section 5 provides a conclusion.

2. ROUTING PROTOCOLS FOR MANET

Routing protocols are the set of rules or standards which controls the nodes in which way to route the packets between the nodes in the network. Routing protocols for MANET can be classified into three main groups: Proactive Routing Protocols, Reactive Routing Protocols and Hybrid Routing Protocols based on the timing policy to update the routs. 2.1 Proactive Routing Protocols These protocols are based on table driven routing, in which each node maintains routing tables that contains the latest information of the routes to its neighbor node in the network. The table updating can be done either as a periodic update or triggered update. In periodic updates, nodes periodically broadcast its tables in network. In triggered updates, table broadcasted whenever a node finds a change in its neighbors [3], [4]. Frequent routing table updating is required in which it consumes large amount of memory, bandwidth and power that cause these algorithms to become inefficient [5]. This group contains so many protocols such as, "Destination Sequenced Distance Vector" (DSDV), "Cluster head Getways Switch Routing" (CGSR), "Link State Routing" (LSR), Wireless Page 218

Figure 1 Mobile Ad hoc Network As MANETs are infrastructure free and highly dynamic in nature, routing in MANET becomes one of the major issues. Energy efficient routing has a significant impact on the MANETs due to the limitation of mobile nodes battery power. These batteries cannot be replaced and recharged in complex scenarios, such as, battlefields and emergency relief scenarios. To this end, nodes in Ad Hoc networks should be enabled to manage efficiently their energy consumption to prolong the network lifetime. The energy consumption of each node varies according to its Volume 1, Issue 3, September October 2012

Web Site: www.ijettcs.org Email: editor@ijettcs.org, editorijettcs@gmail.com Volume 1, Issue 3, September October 2012 ISSN 2278-6856
Routing Protocol (WRP), and Optimized Link State Routing (OLSR). 2.2 Reactive Routing Protocols Reactive protocols are also called as "On Demand Routing Protocols". In reactive protocols node initiates a route discovery process only when a route to destination is required. The established route is maintained by a route maintenance procedure until the route is no longer described. Reactive protocols discover and maintain routes only if and when necessary. Two main procedures are done in this group I) route discovery II) route maintenance. When a source node wants to send a message to some destination node and this source node does not have any route to that destination node then it uses a path discovery process. The source node discovers the route by sending a Route Request (RREQ) packet into the network and the destination replies with a Route Reply (RREP) packets. As a result the source finds route to the destination. The route to the destination is stored in the route-cache and maintained until the route is no longer desired. These protocols are found efficient when a route discovery is done infrequently in comparison to data transfer [6]. These reactive routing protocols minimize the routing overheads. The examples of ondemand routing protocols are "Dynamic Source Routing" (DSR), "Ad hoc on-demand Distance Vector" (AODV), "ad hoc on-demand Routing Protocol" (AORP)etc. 2.3 Hybrid Routing Protocols Hybrid routing protocols assimilates the advantages of proactive and reactive routing protocols. Initially routing is established with proactive routing protocol then through reactive flooding, serves the demand from additionally activated nodes. It is used for the large number of nodes [4]. Examples of hybrid routing protocols are "Hybrid Routing protocol for Large Scale Mobile Ad Hoc Networks"(HRPLS), "Hybrid Wireless Mesh Protocol" (HWMP) and "Zone Routing Protocol" (ZPR). accomplish the network functioning goal. In [7] authors have mentioned some energy related metrics in which the energy efficient routing can be found. The metrics are as following: Minimize Energy consumed per packet: the most intuitive metric, however not optimal for maximum lifetime. Maximize Time to Network Partition: important for mission critical applications, hard to maintain low delay and high throughput simultaneously. Minimize Variance in node power levels: balance the power consumption for all the nodes in the network i.e. all nodes in the network have the same importance. Minimize Cost per packets: try to maximize the lifetime of all the nodes. Minimize Maximum Node Cost: try to delay the node failures. There are so many algorithms in which they prolong the lifetime of the network and give the energy efficient routing. These algorithms are classified into two categories which are i) Minimizing Total Transmission power ii) Maximizing Network lifetime. Minimizing Total Transmission power algorithms focuses on minimizing the total transmission power that is used to send packets from source to destination. These algorithms dont consider the power loss at receiver side and select the route with large number of hops. Maximizing Network lifetime algorithms use average residual battery level of entire network or individual battery power of a node. Algorithms achieve goal of maximizing network life time by distributing the forwarding load over the multiple paths, making some nodes in sleep state and by balancing the traffic load inside the MANET. These algorithms are discussed in the following subsection. 3.1 Minimizing Total Transmission Power In [8], the authors have made new cost function. They changed the route request packet by adding some new variables, like data size, unstable nodes count, sum of neighbors and sum of buffered packets. A node is able to calculate its residual battery energy. The paths with stable nodes will be selected and the nodes stability will be checked before it broadcast route request with the condition that it should not change certain rate of its neighbors in specific time. A node can broadcast the request packet only if it has more lifetime than the required time to send the packet. This way the nodes that have less energy are prevented from participation and the paths which have less unstable nodes, nodes with fewer neighbors and buffered packets are selected. The result shows that the proposed algorithm consumes lower energy and sends less number of request packets.

3. ENERGY EFFICIENT ROUTING ALGORITHMS FOR MANET

Energy Efficient Routing Algorithms are not just related to minimize the total energy consumption of the route but also to maximize the lifetime of each node in the network to increase the lifetime of the network. The main purpose of energy efficient algorithm is to maintain the network functioning as long as possible. In MANTEs energy consumption is done in three states of the nodes which are transmitting, receiving and sleeping state. Nodes consume more energy while transmitting than in sleep state. Sleep state means nodes are idle, in which they neither transmit nor receive any signals. More energy can be saved by keeping more nodes in sleep state. The energy consumption of nodes should be minimized not only during the transmission but also during sleep state to Volume 1, Issue 3, September October 2012

Page 219

Web Site: www.ijettcs.org Email: editor@ijettcs.org, editorijettcs@gmail.com Volume 1, Issue 3, September October 2012 ISSN 2278-6856
In [9] the authors proposed an energy efficient algorithm, which is used for AODV. They used HELLO massages of AODV to calculate the difference between transmitting power and receiving power and which gives the value of propagation loss. They have slightly modified the original 32-bits destination sequence number field to a new 32-bit value, obtained from the source battery function in RREQ. They formatted HELLO RREP by reserving a field of (9 bits) for power loss level with 8 bit long length. This field is a power loss for specific link. As source is having all the information so it is easy to calculate the power loss by subtracting the received power from the transmitting power. They proposed an adaptive lowbattery alert mechanism to overcome the overuse of the firstly established route. They used 50% or 40% of the new battery capacity. The result shows that this algorithm can improve network lifetime in both static and mobile networks. In [10] an example of multi parameter optimization approach called Distributed Power DISPOW, which manages the transmit power of nodes to prolong the network connectivity has been presented. DISPOW uses multi parameters like connectivity, interference and energy consumption. It has a capability to convert asymmetric link to symmetric link, if required. It provides better node connectivity and adaptively manages nodes power. 3.2 Maximizing Network Lifetime In [11] authors presented an algorithm called Distributed Energy-Efficient Ad hoc Routing "DEAR, it is based on "on-demand" routing. It only requires the average residual battery level of the entire network, which can be obtained without any additional control packets. To calculate the estimate of average energy they used RREQ packets of on-demand routing by adding two fields to the packet header i) average residual battery power of the nodes on the path ii) number of hops that the RREQ packet has passed through. They calculated estimated power, nodes residual battery power using some equations. One of the equations says that the retransmission time is proportional to residual battery power .so that those nodes will be selected whose residual battery power is larger than average power because its retransmission time will be less. Due to small variations in nodes residual battery power, most of nodes may have similar retransmission time in that case the route with small hop count will be selected. So it will be fair energy consumption. DEAR improves the delivery ratio by selecting a more reliable path and even prolongs the network lifetime. But it compromises between fair energy consumption path and mini-hop path. In [12] authors considered individual battery power of a node to prolong the network life time. The proposed algorithm discovers all the available paths as being done in on-demand algorithms. When the destination receives first RREQ it waits for small amount of time (t) and Volume 1, Issue 3, September October 2012 collects all other RREQ. After time (t) it calls optimization function which considers nature of packet, size of the packet and distance between the nodes to determine the best path to send RREP. If a path contains a node with low residual battery energy then the optimization function will not use that path. Number of hops and transmission time are also considered for optimization, as large number of hops will help in energy saving and if transmission time is less then path will be shorter and energy consumption will be less. According to their results the proposed algorithm performs better than AODV in respect of increasing network lifetime and energy consumption. In [13] an algorithm to find a multicast tree routed at source node and spanning the destination node to maximize the minimum residual battery energy and minimize the total transmission energy consumption is proposed. One optimum value is set and results are compared. In [14] authors have proposed an algorithm for educational and business MANETs. They modified the Request to Send (RTS) frame of IEEE 802.11 to integrated RTS (IRTS) by adding service code and frame sequence fields. Service code enables service oriented routing and frame sequence is used to avoid routing loops. For each IRTS one or more integrated Clear-toSend (ICTS) will be replied by the interested nodes. All the nodes which have sent ICTS will remain active during the transmission. They have made the nodes to go to sleep mode if they are not interested in transmission to conserve the energy. The proposed algorithm has been concluded as a new protocol with better utilization of bandwidth, high energy efficiency and low setup time. With the concept of service with routing, authors provided the integration of all formats of data communication viz. unicasting, multicasting and broadcasting. By reducing the number of frames required to enable communication this algorithm ensures the energy efficiency. [15] Aim of the Minimum Drain Rate (MDR) is to extend both nodal battery life and connection lifetime. In MDR each node maintains its battery power drain rate value. The drain rate value is an average energy consumed by node per second, during the interval. MDR selects the route from the set of routes which has maximum lifetime. The selected path may change over the time due to drain rate of nodes; the selection of new path depends on the underlying routing protocols either proactive or reactive. Minimization of total transmission power is not ensured by the MDR. With interface card, MDR can be utilized efficiently to extend lifetime of both nodes and connection. The multicast tree method is used in [16]. Authors designed a Source- tree- based routing algorithm and build the shortest path multicast tree to minimize the delay time and prolong the lifetime of the multicast tree. A balancing battery energy consumption strategy is used to get the energy efficiency. Mutation is used as a repair Page 220

Web Site: www.ijettcs.org Email: editor@ijettcs.org, editorijettcs@gmail.com Volume 1, Issue 3, September October 2012 ISSN 2278-6856
function. Repair function replaces a lower battery energy node with a high battery energy node. This repair function prolonged the multicast service and increased the convergence time. According to these parameters their Genetic Algorithm for multicast route selection was more suitable for the MANETs. In [17], a multicast tree rooted from source node has been constructed. A set of paths has been computed from source node to the destination nodes belonging to multicast group (MCG) and calculated the life time of each path with some assumptions. This set of paths with their life time is being used in Genetic Algorithm (GA) as initial population to find each node pair. A fitness function is used to find the fitness of the chromosome which is computed by summation of lifetime of the paths of the present node-pair e.g. kth path in the ith node-pair then the chromosome which is having highest lifetime will be selected. Crossover and mutation operators are used to enhance the selection. In [18] authors set a metric to maximize the number of data packets sent and received between nodes from a moment when the network starts till the first node battery runs down. Genetic Algorithm (GA) has been used to find the best heuristic combination out off five basic heuristics. They assumed that network consists of four types of energy levels I) Huge (H), II) Large (L), III) Medium (M), IV) Small(S). Each chromosome is a block, each block contains 5 numbers. The first 4 numbers represents the ad hoc network state and the 5th number represents the heuristic associated with that block. A number of data packets sent between network nodes is used as a fitness function. One point crossover in implemented. Three mutations have been used I) Add Block Mutation: mutation generates new block by randomly generating first 4 elements in the range 0 to 1 and 5th element in the range 1 to 5 II) Remove Block Mutation III) Normal Mutation. If child has to be mutated then one type will be chosen. Result shows that the proposed algorithm chooses the best energy efficient heuristic combination. In [19] authors proposed an improved AODV protocol. A balanced energy consumption idea has been implemented in route discovery process of AODV. Those nodes which have sufficient amount of energy to transmit the message will forward the RREQ message otherwise the RREQ message will be dropped. This condition will be checked with threshold value which is dynamically changing. Three parameters have been defined I) initial energy, II) transmission power, III) reception power. By using these parameters authors had derived the equation for energy necessary for transmission or reception of a packet and threshold for each node. A result shows that the improved AODV performs better in terms of energy consumption. It allows a node with over used battery to refuse to route the traffic in order to prolong the network lifetime. In [20] AODV is used as base protocol. Route table of AODV has been modified by adding power factor field. There was no change in the RREQ. AODV is able to accept the concept of GPS with some extension in route Volume 1, Issue 3, September October 2012 construction phase. Path establishment is done with same process of AODV route discovery. Active nodes only can take part in route selection. The nodes which are not participating in route selection they cant go in sleep mode because it is using GPS system but node can be in idle mode. The link break can be avoided by calculating new factor called lifetime of a node. Route table is having the entry of this factor and it is transmitted along with hello packets. The experimental results are awaited but theoretically proposed method will behave better. In the proposed algorithm [21] route discovery is done dynamically by considering threshold value in each node. Proposed algorithm selects the node with less power but not less than the threshold value for transmission. Algorithm transmits the equal length of packets. Residual energy of each node is periodically checked to make sure that it is not going beyond the threshold value; if it is going beyond the threshold value then the node is made to go in sleep mode and select another node for transmission. The algorithm calculates the residual energy and energy consumption of a node after time (t) by using the equations given in [21].the proposed algorithm saves the lot of energy and prolongs the network life time.

4. COMPARATIVE STUDY OF EFFICIENT ROUTING ALGORITHMS:

ENERGY

It is not easy to compare different algorithms because they work on different metrics, different assumptions and with different means they achieve the goal. However, these algorithms are analyzed to highlight their strengths and deficiencies and the analysis is shown in Table 1. Table 1: Qualitative analysis of different MANET algorithms

Page 221

Web Site: www.ijettcs.org Email: editor@ijettcs.org, editorijettcs@gmail.com Volume 1, Issue 3, September October 2012 ISSN 2278-6856 5. CONCLUSION
As MANET does not have any fixed infrastructure, topology changes unpredictably because of that routing becomes a challenging task in MANET. Moreover, nodes in MANET are battery powered, which is the critical issues. To prolong the battery and network life, an energy efficient routing is required. In this paper we surveyed and classified the algorithms on the basis of metrics that are used to minimize the energy utilization. Energy efficient routing algorithms are broad spectrums that this paper covered only few of them. The algorithms are classified in to two categories i) Minimizing total transmission power ii) Maximizing the network lifetime. Each algorithm gives good results based on their assumptions and metrics that are used. The discussed algorithms have individual strengths and deficiencies, depending on the metrics and routing strategies being used. REFERENCES [1] Chansu Yu, y Ben Lee , Hee Yong Youn, Energy Efficient routing protocols for mobile ad hoc networks, Wireless Communications and Mobile Computing, John Wiley & Sons, Ltd, PP-959973, 2003. [2] H. Wei Feng Alshaer, J.M.H. Elmirghani, optimization of energy consumption in rectangular ad-hoc wireless Networks, Fourth International Conference on Communications and Networking in China, PP 1 5, 2009. [3] C. E. Perkins, Ad Hoc Networking, Addison Wesley, 2001. [4] David A. Maltz "On-Demand Routing in Multihop Wireless Mobile Ad Hoc Networks PhD. Thesis in School of Computer Science Carnegie Mellon University, 2001. [5] S. Santhi, G. Sudha Sadasivam, Performance Analysis of Different QoS Routing Protocols to Minimize Power in Heterogeneous Network 2011 International Conference on Process Automation, Control and Computing (PACC), IEEE, PP 1-6, 2011. [6] M. Chaturvedi, G B Nagar A Survey of Routing Protocols for Ad Hoc Wireless Home Networks" International Journal of Electronics and Computer Science Engineering,, Vol1 (1), 2012. [7] S. Singh, M. Woo and C.S. Raghavendra, "PowerAware Routing in Mobile Ad Hoc Networks", MobiCom '98 Proceedings of the 4th annual ACM/IEEE International , Conference on Mobile Computing and Networking,1998. [8] M Lotfi ,S Jabbehdari, A New Energy Efficient Routing Algorithm Based on a New Cost Function in Wireless Ad hoc Networks, Journal of Computing, Volume 2, Issue 6, pp. 125-133, June 2010. Volume 1, Issue 3, September October 2012 [9] Xiangpeng Jing and Myung Lee, Energy-Aware Algorithms for AODV in Ad Hoc Networks, proceedings of Mobile Computing and Ubiquitous Networking (ICMU 2004), Yokosuka, Japan, Jan 2004. [10] Nuraj L. Pradhan, Tarek Saadawi, Power control algorithms for mobile ad hoc networks, Journal of Advanced Research, Volume 2, PP-199206, Elsevier, 2011. [11] Hong-ryeol Gil1, Joon Yoo1, and Jong-won Lee2 ,An On-demand Energy-efficient Routing Algorithm for Wireless Ad hoc Networks, Proceedings of the 2nd International Conference on Human. Society and Internet HSI'03, Page 302-311, 2003. [12] S.K. Dhurandher, S. Misra, M.S. Obaidat, V. Basal, P. Singh, V. Punia, An Energy-Efficient On Demand Routing algorithm for Mobile Ad-Hoc Networks, 15 th International conference on Electronics, Circuits and Systems, PP- 958-961, 2008. [13] W Liang, Minimizing Energy and Maximizing Network Lifetime Multicasting in Wireless Ad Hoc Networks, Communications, ICC 2005. , IEEE, pp3375- 3379 - ieeexplore.ieee.org, 2005. [14] Rakesh Kumar Mishra, Sankhayan Choudhury, Nabendu Chaki, E2IRP: A New Energy Efficient Integrated Routing Protocol for MANET, Second International Conference on Recent Trends in Wireless and Mobile Networks, WIMO 2010, ANKARA, TURKEY, JUNE 26-28, 2010. [15] Dongkyun Kim , J. J Garcia-luna-aceves , Katia Obraczka , Juan- carlos Cano , Pietro Manzoni, Power-Aware Routing Based on The Energy Drain Rate for Mobile Ad Hoc Networks, Post-doctoral Fellowship Program of Korea Science & Engineering Foundation (KOSEF), PP-1-5, , 2002. [16] Yun-Sheng Yen, Yi-Kung Chan, Han-Chieh Chao, Jong Hyuk Park, A genetic algorithm for energy-efficient based multicast routing on MANETs, Journal of Computer Communications, Volume 31 Issue 4, PP- 858869, 2008. [17] DilipKumar S. M. and Vijaya Kumar B. P. Energy-Aware Multicast Routing in MANETs: A Genetic Algorithm Approach, International Journal of Computer Science and Information Security (IJCSIS), vol. 2, June, 2009. [18] M.Pilski, F.Seredynski, Genetic Algorithm-based Metaheuristic for Energy Efficient Routing in Ad Hoc Networks, Intelligent Information Systems XVI, PP- 89-98,2008. [19] AlGabri Malek,Chunlin LI, Z. Yang, Naji Hasan.A.H, X.Zhang, Improved the Energy of Ad hoc On- Demand Distance Vector Routing Protocol, International Conference on Future Computer Supported Education, Published by Elsevier, IERI, PP- 355-361, 2012. Page 222

Web Site: www.ijettcs.org Email: editor@ijettcs.org, editorijettcs@gmail.com Volume 1, Issue 3, September October 2012 ISSN 2278-6856
[20] D. Sharma, A. Kush, GPS Enabled Energy Efficient Routing for Manet, International Journal of Computer Networks (IJCN), Volume (3), Issue (3), PP- 159-166, 2011. [21] S. Suganya, S.Palaniammal, An Optimized Energy Consumption Algorithm for MANET, Procedia Engineering,Published by Elsevier Ltd., Volume 38, PP- 903-910 , 2012. AUTHOR
Dr.Gihan Nagib earned her PhD from INPG University, Grenoble, France in 1994. She is an associate professor in the Electrical Engineering Department, Faculty of Engineering, Fayoum University in Egypt. She has over 16 years experience in teaching, research and consulting. Her research interests are Intelligence Computation, computer networks and Nanotechnology. She published many Research papers in various International journals and conferences.

Anjum Asma Mohammed is Research Assistant in the

Information Technology Department, College of Computer and Information Sciences, King Saud University. She received Master of Computer Application (MCA) degree in 2005 from BAMU, Aurangabad, MS, India. Her research interests are Computer Networks (wireless Networks), HCI, Algorithms, web 2.0 etc.

Volume 1, Issue 3, September October 2012

Page 223