Energy Saving Protocols for
Ad hoc Networks
Reference: https://ieeexplore.ieee.org/document/5541084
Contents
1.
2.
Introduction
Related Works
●
●
●
3.
Different Types of Energy Saving Protocols
●
●
●
●
4.
5.
AODV Protocol
Routing Algorithm Based On Energy
Shortages of Routing Discovery Mechanisms
Routing Protocols for WSN
Energy Efficient MANET Routing
Taxonomy of energy efficient routing protocols
Constant and Variable Transmission Power Model
Conclusion
References
Introduction
●
●
●
●
●
Ad hoc network is a collection of mobile nodes with wireless communication equipment dynamically forming a
temporary network which supposes hops. In ad hoc network the nodes work as terminal and router, they
dynamically move towards any direction and at any speed that may cause frequent changes in network
topology.
There are two kinds of routing protocols in ad hoc networks according to its working principle, one is active
routing protocol, and another is on-demand routing protocol.
The typical active routing protocols are DSDV, OLSR, etc. The on-demand routing protocol including AODV,
DSR does not need routing maintenance, a routing path between the source and destination is established by
routing discovery process when it is necessary.
The contents of routing table only are a fraction of topology of the network. All those don't consider the energy
consumption during the selection of routing paths may cause the node's energy exhaustion which results in
issues such as network partitions and so on.
To alleviate such problems, a proposal of a new energy saving routing protocol based on AODV was introduced.
Related Works
AODV Protocol
●
●
●
●
AODV is a single-path on-demand routing protocol which is composed of two phases, routing
discovery process and routing maintenance process.
The energy of the nodes will be excessively used because every node maybe repeatedly received and
transmitted the duplicate RREQ(Route Request Packet) packets to different neighbors.
The redundancy of RREQ in the route transmission process can be reduced by means of the nodes
selected by certain methods which have the ability to transmit RREQ packets.
Under the constraint of node energy AODV uses method to find a route path by selecting a route which
has minimum hops, the exhaustion of some nodes which have been excessively used may give rise to
the partition of network and shorten its lifetime.
Related Works
Routing Algorithm Based On Energy
●
●
●
●
According to different methods of route selection in route discovery process, routing algorithm based on
energy can be divided into three categories.
One is minimizing total energy consumption algorithm which chooses the route path by means of the
minimum total energy consumption between source node and destination. Then some key nodes
frequently taking part in transmission may run out of power as soon as quickly and leads the partition of
networks.
Another is maximizing network lifetime algorithm, it established the route path by avoiding choosing the
lower energy node so that it can balance the energy consumption of nodes and prolong the lifetime of
networks.
The final is mixed energy optimizing routing algorithm which shares virtues of two categories, it uses
appropriate routing strategies on the basis of energy of nodes.
Related Works
Shortages of Routing Discovery Mechanisms
●
●
●
The typical routing discovery mechanisms of on-demand routing protocols will establish shortest route
which includes minimum hop counts.
It's obvious that long path needs more network resources than the short one and leads to poor routing
performance.
The disadvantages of long path are:
(1) more bandwidth consumption, (2) more energy consumption; (3) increase end-to-end delay; (4)
increase the number of routing requests; (5) reduce packet delivery ratio; (6) reduce survival time of
routes (increase the probability of destructing the paths); (7) increase the probability of self-conflict
phenomenon.
Different Types of Energy Saving Protocols
Routing Protocols for WSN(Wireless Sensor Network)
●
●
●
●
●
In general, routing protocols fall into four categories: Centralized vs. Distributed, Static vs. Adaptive, Flat vs. Hierarchical, and
Proactive vs. Reactive vs. Hybrid
In this work, we highlight proactive, reactive, and hybrid protocols, which differ in the way they operate according to the
routing strategy
Proactive: Routing tables are shared with neighboring nodes during network startup and at fixed times, meaning that all
nodes know the paths to any destination nodes even before this information is needed. Examples of proactive routing
protocols include Distance Vector Routing (DVR), Destination-Sequenced Distance Vector Routing (DSDV), Optimized Link
State Routing Protocol (OLSR), and Wireless Routing Protocol (WRP)
Reactive: Routes to destination are established only when needed, that is, when there are data packets to be sent. Therefore,
only active routes to destination nodes that are in use are stored. These protocols do not share data at network startup, and
have periodic routing table sharing mechanisms. Examples include Ad Hoc On-Demand Distance Vector (AODV), Dynamic
Source Routing (DSR), and Temporally Ordered Routing Algorithm (TORA)
Hybrid: These protocols combine resources from proactive and reactive protocols, enabling convenient use of the advantages
of both; examples include Zone Routing Protocol (ZRP) and Fisheye State Routing (FSR).
Different Types of Energy Saving Protocols
Energy Efficient MANET Routing
●
●
●
●
●
●
In contrast to simply establishing correct and efficient routes between pair of nodes, one important goal
of a routing protocol is to keep the network functioning as long as possible.
This goal can be accomplished by minimizing mobile nodes’ energy not only during active
communication but also when they are inactive.
Transmission power control and load distribution are two approaches to minimize the active
communication energy, and sleep/power-down mode is used to minimize energy during inactivity.
Table I shows taxonomy of the energy efficient routing protocols.
The three approaches in the following subsections, energy-related metrics that have been used to
determine energy efficient routing path instead of the shortest one.
energy consumed/packet . time to network partition . variance in node power levels . cost/packet
maximum node cost.
Energy Efficient MANET Routing: Taxonomy of energy efficient routing protocols.
Approach
Minimize active
communication energy
Transmission power
control
Protocols
Goal
Flow argumentation routing (FAR)
Minimize the total transmission
energy but avoid low energy nodes.
Online max-min (OMM)
Power aware localized routing (PLR)
Minimize active Transmission Minimum
energy routing (MER)
Retransmission-energy aware routing
(RAR)
Minimize the total transmission
energy while considering
retransmission overhead or
bi-directionality requirement
Smallest common power (COMPOW)
Load Distribution
Localized energy-aware routing (LEAR)
Distribute load to energy rich node
Conditional max-min battery capacity
routing (CMMBCR)
Minimize inactivity energy
Sleep/power- down mode
SPAN
Geographic adaptive fidelity (GAF)
Prototype embedded network (PEN)
Minimize energy consumption during
inactivity
Constant and Variable Transmission Power Model
●
In order to illustrate the potential benefits of controlling or adjusting
transmission power, consider an example shown in Figure 1 which
compares two transmission power models: constant power model and
variable power model.
●
If the transmission power is not controllable and thus constant (p c), as
shown in Figure 1(a), the routing path S -> D is the shortest and at the
same time the most energy efficient path.
●
On the other hand, if the transmission power is controllable, it may be
more energy efficient to transmit packets using intermediate nodes
because the required transmission power, p, to communicate between
two nodes has super-linear dependence on distance, d, i.e. p(d) / d2.
●
For example, in Figure 1(b), the routing path S -> A -> D is more energy
efficient than the route S -> D since p(|SD|) > p(|SA|) + p(|AD|). Node S
conserves energy by lowering its radio power just enough to reach node
A, but not enough to reach node D.
Conclusion
●
●
●
Every node routes the packet not for itself towards its destination. All the nodes which are
present in the network communicate with each other without any infrastructure or a central
controller. Also, a mobile ad hoc network can connect to other fixed networks.
Since ad hoc network has limited battery power, energy consumption for transmission should be
minimized. Due to limited battery power, energy management is inevitable. Delay to be
minimized, nodes has insufficient communication bandwidth in the network.
Power Aware Routing is a consideration in a way that it minimizes the energy consumption while
routing the traffic, aims at minimizing the total power consumption of all the nodes in the
network, minimizing the overhead etc and thus, at maximizing the lifespan of the network using
some Power Aware Routing Protocols.
References
●
●
●
●
●
https://ieeexplore.ieee.org/document/5541084
https://www.sciencedirect.com/science/article/pii/S2666285X2100100X
https://web.engr.oregonstate.edu/~benl/Publications/Journals/WCMC03.pdf
https://www.researchgate.net/publication/287439888_Power_aware_routing_in_mo
bile_ad_hoc_networks_A_survey
https://ieeexplore.ieee.org/document/4197944
THANK YOU
SAKETH RACHA
120201202