A Review of Energy Efficient Dynamic Source Routing Protocol for Mobile Ad Hoc Networks
---
paper_title: Energy Efficient Routing Protocols for Mobile Ad Hoc Networks

paper_content:

Nodes in a mobile ad hoc network have limited battery power. If a node is used frequently for transmission or overhearing of data packets, more energy is consumed by that node and after certain amount of time the energy level may not be sufficient for data transmission resulting in link failure. In this paper, we have considered two routing protocols-Dynamic Source Routing (DSR) & Minimum Maximum Battery cost Routing (MMBCR) and studied their performances in terms of network lifetime for the same network scenario. Simulations are carried out using NS2. Finally from the simulation results we have concluded that MMBCR gives more network lifetime by selecting route with maximum battery capacity thereby outperforming DSR. General Terms Energy efficiency, MANETS, Routing Protocols.
---
paper_title: Ad Hoc Wireless Networks: Architectures and Protocols

paper_content:

Practical design and performance solutions for every ad hoc wireless networkAd Hoc Wireless Networks comprise mobile devices that use wireless transmission for communication. They can be set up anywhere and any time because they eliminate the complexities of infrastructure setup and central administration-and they have enormous commercial and military potential. Now, there's a book that addresses every major issue related to their design and performance. Ad Hoc Wireless Networks: Architectures and Protocols presents state-of-the-art techniques and solutions, and supports them with easy-to-understand examples. The book starts off with the fundamentals of wireless networking (wireless PANs, LANs, MANs, WANs, and wireless Internet) and goes on to address such current topics as Wi-Fi networks, optical wireless networks, and hybrid wireless architectures. Coverage includes: Medium access control, routing, multicasting, and transport protocols QoS provisioning, energy management, security, multihop pricing, and much more In-depth discussion of wireless sensor networks and ultra wideband technology More than 200 examples and end-of-chapter problemsAd Hoc Wireless Networks is an invaluable resource for every network engineer, technical manager, and researcher designing or building ad hoc wireless networks.
---
paper_title: Energy Efficient Routing Protocols for Mobile Ad Hoc Networks

paper_content:

Nodes in a mobile ad hoc network have limited battery power. If a node is used frequently for transmission or overhearing of data packets, more energy is consumed by that node and after certain amount of time the energy level may not be sufficient for data transmission resulting in link failure. In this paper, we have considered two routing protocols-Dynamic Source Routing (DSR) & Minimum Maximum Battery cost Routing (MMBCR) and studied their performances in terms of network lifetime for the same network scenario. Simulations are carried out using NS2. Finally from the simulation results we have concluded that MMBCR gives more network lifetime by selecting route with maximum battery capacity thereby outperforming DSR. General Terms Energy efficiency, MANETS, Routing Protocols.
---
paper_title: Energy conserving routing in wireless ad-hoc networks

paper_content:

An ad-hoc network of wireless static nodes is considered as it arises in a rapidly deployed, sensor-based, monitoring system. Information is generated in certain nodes and needs to reach a set of designated gateway nodes. Each node may adjust its power within a certain range that determines the set of possible one hop away neighbors. Traffic forwarding through multiple hops is employed when the intended destination is not within immediate reach. The nodes have limited initial amounts of energy that is consumed at different rates depending on the power level and the intended receiver. We propose algorithms to select the routes and the corresponding power levels such that the time until the batteries of the nodes drain-out is maximized. The algorithms are local and amenable to distributed implementation. When there is a single power level, the problem is reduced to a maximum flow problem with node capacities and the algorithms converge to the optimal solution. When there are multiple power levels then the achievable lifetime is close to the optimal (that is computed by linear programming) most of the time. It turns out that in order to maximize the lifetime, the traffic should be routed such that the energy consumption is balanced among the nodes in proportion to their energy reserves, instead of routing to minimize the absolute consumed power.
---
paper_title: Ad Hoc Wireless Networks: Architectures and Protocols

paper_content:

Practical design and performance solutions for every ad hoc wireless networkAd Hoc Wireless Networks comprise mobile devices that use wireless transmission for communication. They can be set up anywhere and any time because they eliminate the complexities of infrastructure setup and central administration-and they have enormous commercial and military potential. Now, there's a book that addresses every major issue related to their design and performance. Ad Hoc Wireless Networks: Architectures and Protocols presents state-of-the-art techniques and solutions, and supports them with easy-to-understand examples. The book starts off with the fundamentals of wireless networking (wireless PANs, LANs, MANs, WANs, and wireless Internet) and goes on to address such current topics as Wi-Fi networks, optical wireless networks, and hybrid wireless architectures. Coverage includes: Medium access control, routing, multicasting, and transport protocols QoS provisioning, energy management, security, multihop pricing, and much more In-depth discussion of wireless sensor networks and ultra wideband technology More than 200 examples and end-of-chapter problemsAd Hoc Wireless Networks is an invaluable resource for every network engineer, technical manager, and researcher designing or building ad hoc wireless networks.
---
paper_title: Energy conserving routing in wireless ad-hoc networks

paper_content:

An ad-hoc network of wireless static nodes is considered as it arises in a rapidly deployed, sensor-based, monitoring system. Information is generated in certain nodes and needs to reach a set of designated gateway nodes. Each node may adjust its power within a certain range that determines the set of possible one hop away neighbors. Traffic forwarding through multiple hops is employed when the intended destination is not within immediate reach. The nodes have limited initial amounts of energy that is consumed at different rates depending on the power level and the intended receiver. We propose algorithms to select the routes and the corresponding power levels such that the time until the batteries of the nodes drain-out is maximized. The algorithms are local and amenable to distributed implementation. When there is a single power level, the problem is reduced to a maximum flow problem with node capacities and the algorithms converge to the optimal solution. When there are multiple power levels then the achievable lifetime is close to the optimal (that is computed by linear programming) most of the time. It turns out that in order to maximize the lifetime, the traffic should be routed such that the energy consumption is balanced among the nodes in proportion to their energy reserves, instead of routing to minimize the absolute consumed power.
---
paper_title: Power-aware localized routing in wireless networks

paper_content:

A cost aware metric for wireless networks based on remaining battery power at nodes was proposed for shortest-cost routing algorithms, assuming constant transmission power. Power-aware metrics, where transmission power depends on distance between nodes and corresponding shortest power algorithms were also proposed. We define a power-cost metric based on the combination of both node's lifetime and distance-based power metrics. We investigate some properties of power adjusted transmissions and show that, if additional nodes can be placed at desired locations between two nodes at distance d, the transmission power can be made linear in d as opposed to d/sup /spl alpha// dependence for /spl alpha/ /spl ges/ 2. This provides basis for power, cost, and power-cost localized routing algorithms where nodes make routing decisions solely on the basis, of location of their neighbors and destination. The power-aware routing algorithm attempts to minimize the total power needed to route a message between a source and a destination. The cost-aware routing algorithm is aimed at extending the battery's worst-case lifetime at each node. The combined power-cost localized routing algorithm attempts to minimize the total power needed and to avoid nodes with a short battery's remaining lifetime. We prove that the proposed localized power, cost, and power-cost efficient routing algorithms are loop-free and show their efficiency by experiments.
---
paper_title: Power-aware localized routing in wireless networks

paper_content:

A cost aware metric for wireless networks based on remaining battery power at nodes was proposed for shortest-cost routing algorithms, assuming constant transmission power. Power-aware metrics, where transmission power depends on distance between nodes and corresponding shortest power algorithms were also proposed. We define a power-cost metric based on the combination of both node's lifetime and distance-based power metrics. We investigate some properties of power adjusted transmissions and show that, if additional nodes can be placed at desired locations between two nodes at distance d, the transmission power can be made linear in d as opposed to d/sup /spl alpha// dependence for /spl alpha/ /spl ges/ 2. This provides basis for power, cost, and power-cost localized routing algorithms where nodes make routing decisions solely on the basis, of location of their neighbors and destination. The power-aware routing algorithm attempts to minimize the total power needed to route a message between a source and a destination. The cost-aware routing algorithm is aimed at extending the battery's worst-case lifetime at each node. The combined power-cost localized routing algorithm attempts to minimize the total power needed and to avoid nodes with a short battery's remaining lifetime. We prove that the proposed localized power, cost, and power-cost efficient routing algorithms are loop-free and show their efficiency by experiments.
---
paper_title: Energy saving dynamic source routing for ad hoc wireless networks

paper_content:

In this paper, energy saving dynamic source routing (ESDSR) protocol is introduced to maximize the life-span of a mobile ad hoc network (MANET). Many theoretical studies show that energy consumption in MANET can be significantly reduced using energy-aware routing protocols compared to fixed-power minimum-hop routing protocols. Two approaches are broadly suggested for energy-aware routing protocols - transmission power control approach and load sharing approach. ESDSR integrates the advantages of those two approaches. In ESDSR, the routing decision is based on a load balancing approach. Once a routing decision is made, link by link transmit power adjustment per packet is done based on a transmit power control approach. We modified dynamic source routing (DSR) protocol to make it energy aware by a network simulator (network simulator-2 of University of California). The simulation results show that the proposed ESDSR can save energy up to 40% per packet and it can send 20 % more packets to destinations by spending the same battery power in compare to DSR.
---
paper_title: Overhead reduction and energy management in DSR for MANETs

paper_content:

Dynamic Source Routing (DSR) Protocol is a commonly applied reactive protocol for mobile ad hoc networks (MANETs). When the network size is increased, overhead is increased due to the source routing nature of DSR. Moreover, energy consumption of the nodes increases, as the nodes act as intermediate nodes for many source destination pairs. In order to improve the scalability of DSR, in this paper, a modification is proposed, and is referred to as Modified DSR (MDSR). Secondly, in order to conserve the battery power, MDSR with energy management is proposed, in which the packets are transmitted with minimum required energy. Simulation results show that both MDSR and MDSR with Energy management generate less overhead and delay compared to standard DSR. It is observed that in MDSR with Energy management, irrespective of network size, the average energy consumption per node is 37.9% less compared to that of standard DSR.
---

Title: A Review of Energy Efficient Dynamic Source Routing Protocol for Mobile Ad Hoc Networks

Section 1: INTRODUCTION
Description 1: This section provides an overview of Ad Hoc Networks, characterizes the nature of MANETs, discusses the challenges faced particularly regarding power constraint and the motivation for energy efficient routing protocols based on DSR.

Section 2: ROUTING PROCESS IN AD HOC NETWORKS
Description 2: This section explains the basic routing process in MANETs, covering the route discovery and route selection mechanisms, and highlights existing ad hoc routing protocols with specific characteristics needed.

Section 3: Dynamic source routing protocol
Description 3: This section provides a detailed explanation of the DSR protocol, including the route discovery and route maintenance processes, along with its benefits and limitations.

Section 4: ENERGY EFFICIENT ROUTING PROTOCOLS
Description 4: This section discusses different energy efficient routing protocols built on DSR, elaborates on various approaches such as transmission power control, load distribution, and sleep/power-down mechanisms to minimize energy consumption.

Section 5: RELATED WORK
Description 5: This section reviews various modifications and enhancements made on the traditional DSR to develop energy-efficient routing protocols over the past years.

Section 6: Global Energy Aware Routing (GEAR) Protocol
Description 6: This section describes the GEAR protocol and its approach to selecting routes based on residual battery power, along with associated problems and limitations.

Section 7: Local Energy Aware Routing (LEAR) Protocol
Description 7: This section outlines the LEAR protocol mechanism which considers nodes' willingness based on remaining battery power to participate in routing.

Section 8: Energy Saving Dynamic Source Routing (ESDSR) Protocol
Description 8: This section details ESDSR, focusing on the load balancing and transmission power control strategies designed to prolong network lifetime.

Section 9: Energy Dependent DSR Routing (EEDSR) Protocol
Description 9: This section explains EEDSR's method using residual battery power and drain rate to determine node participation in forwarding data packets.

Section 10: Energy Efficient DSR Protocol (E2DSR)
Description 10: This section discusses E2DSR's new control packet structures and route selection algorithms for energy efficiency.

Section 11: Topology Control Based Power-Aware and Battery Life-aware DSR (TPBDSR) Protocol
Description 11: This section describes TPBDSR's mechanism to adjust transmitting power based on network topology changes and its impact on node lifetime.

Section 12: Minimum Energy Dynamic Source Routing Protocol (MEDSR)
Description 12: This section covers MEDSR's dual mechanism approach, utilizing low and high power levels for route discovery to ensure network connectivity and energy savings.

Section 13: Modified DSR Routing (MDSR) Protocol
Description 13: This section explains MDSR's aim to reduce overhead by minimizing routing reply packets and implementing fixed header sizes.

Section 14: Multi-path Energy Aware DSR Routing (MEADSR) protocol
Description 14: This section elucidates MEADSR's integration of multipath and energy-aware techniques for efficient routing and balanced energy consumption among nodes.

Section 15: Conclusion
Description 15: This section synthesizes the discussion on energy consumption issues in MANETs, compares various energy-efficient protocols based on DSR, and emphasizes the need for integrating multiple techniques to enhance network performance.