Energ

gy Effficientt Dyna
amic M
MANE ET On n-demaand
(E
E2DYM MO) Routin
R ng Prootocol

Vahid
V Nazari Talooki1, Hu
ugo Marques1,,2, Jonathan R
Rodriguez1
1
Instittuto de Telecommunicações, AAveiro, Portugaal
2
Castelo Branco, Portugal
Instituto Polittécnico de Casstelo Branco, C
vahid@av v.it.pt, hugo.maarques@av.it.ppt, jonathan@avv.it.pt

Abstract—In Mobile
M Ad hocc NETworks (M MANETs), wheere Thiis paper propooses Energy Efficient Dynam mic MANET
coooperative behavviour is mandatory, there is a high probabillity On-demmand (E2DYM MO) protocol, that is an impprovement to
for some nodes to become overrloaded with packet forwardiing the exi sting DYMO protocol (revission 26)[2], w which handles
opeerations, in ordder to support neighbour datta exchange. This these issues by selecting thee best routee for each
altrruistic behavio
our leads to an n unbalanced load in terms of commuunication in terrms of energy aand traffic paraameters.
traffic and energyy consumption. In such scenarrios, mobile nod des
cann benefit from the
t use of an en nergy efficient and traffic fittiing Thee paper is struuctured as follows: Section II presents a
rouuting protocol, that better commplies with their limited batteery synopsiis on related works, Sectiion III descriibes DYMO
cappacity and throughput. This paper presen nts E2DYMO, an protocool, Section IV introduces annd explains E22DYMO, and
imp provement to the well-know wn DYMO pro otocol that offe fers finally, Section V presents conclusioons and future works.
eneergy efficiency and fairness inn routing for mobile
m wireless ad
hocc networks. Wiith this proposeed improvemen nt, nodes are ab ble II. LITERATTURE REVIEW A
AND RELATED WORKS
to find several ro outes per each pair of sourcee and destinatiion Flatt ad hoc rouuting protocolls can be caategorized as
noddes and select the
t best route according to energy
e and trafffic
proactivve and reactivee protocols [3]:
parrameters, effecttively extending
g the lifespan off the network.
Pro active or tabble driven prootocols find aand preserve
Keywords—DY YMO; E2DYM MO; Energy Efficiency;
E Looad consisteent routes beetween all (source, destinnation) pairs
Ballancing; Mobilee Ad hoc Netwo
orks; Routing Protocol;
P Wirelless regardless of the use or need of suuch routes. Disstance Vector
Nettworks (DV) bbased routing pprotocols, suchh as Destinatioon-Sequenced
Distancce Vector (DS SDV) [4], annd Link State based (LS)
I. INTR
RODUCTION
routingg protocols, suuch as Optim mized Link State Routing
In a dynamicc topology, succh as mobile ad a hoc networrks (OLSR R) [5], are two ttypes of proactiive routing prootocols.
(M
MANETs), nodees can freely move;
m this ofteen leads to lin
nks
breeakage and alsso the invalidity of the preeviously found ded Reaactive or on-deemand protocools create requuests for new
rouutes. It is a co
omplex probleem that any dynamic
d wireleess routes oonly when requuested by a souurce node. Datta forwarding
rouuting protocol has
h to solve. is baseed on two maain techniquess: Source routting, such as
Dynammic Source Rouuting (DSR) [66], and Hop-byy-hop routing,
In any netw work, nodes can c be both the source and a such ass Ad hoc On-Demand Distancce Vector (AOD DV) [7].
desstination nodess; however, in MANETs, nod des can also pllay
thee role of an inteermediate nodee; thus, they will be responsibble
for relaying pack kets to and fromm the neighbou uring nodes. Th his Ad hoc R
Routing
inhherent cooperattive ability of MANETs
M is esp
pecially usefull in Protoocols
em
mergency situatiions where com mmunication in nfrastructures are
a
lostt and a networrk needs to be setup quickly y. MANETs haave
thee potential to be
b a cheap and d efficient soluttion to deploy in Geographhical
Flat Hierarchical Hybrid
Basedd
rescue or military y operations. Such deploym ments would on nly
bennefit from thee self-healing capabilities off MANETs iff a
robbust routing prootocol is implem
mented. Reactive Proactive
On the other hand,
h battery consumption
c annd throughput area (On-Demandd) (Table Drivenn)
twoo critical probblems in MAN NETs. In dynaamic topology of
MAANETs, some nodes may relay r more traaffic than otheers, Hoob-by-
Distannce
Vecttor Link Statte LS &
maainly because of o their locatio
on in the netwwork; such nod des Source hhop (LS DV
willl deploy their energy
e reserves sooner than thhe others. Trafffic Routing (DVV
E2D
DYMO Based) Based
Baseed)
conncentration can n also increasse radio jamm ming, delay, anda
paccket loss. Besiides, battery coonsumption leads to an earllier
nodde failure, netwwork partitioniing, and down nfall of the rou ute Fig. 1. A possible categorry for current ad hooc routing protocools
reliiability [1].

9788-1-4673-5828-6/13/$31.00 ©2013
© IEEE
 Fig. 1 depicts a categorization of some well-known ad hoc
routing protocols, according to the above classification. More
details on ad hoc routing protocols classification can be found
in [3].
Most of the current wireless routing protocols consider the
path length metric when choosing the best route between a
source (S) and destination node (D); this approach can, in most
cases, minimize delay but it is not an efficient mechanism for
handling other Quality of Service (QoS) metrics [4-7].
Other wireless routing protocols propose to use energy
aware metrics [8-12] to achieve energy efficiency and
homogeneous distribution of battery consumptions amongst
nodes. The aforementioned approaches have some drawbacks
Some other works, such as [14, 15], try to extend multipath
DYMO which can contribute in switching to different paths
between the source and the destination node in order to balance
the battery power consumption and the traffic of nodes on
different routes. Also, through multipath extension, we can
have several routes for each pair of source and destination;
consequently, we can have a quick access to an alternative
route if the primary route fails. This mechanism can decrease
the delay but lead to more control packets, staled routes in
routing cache, and requires larger memory for saving greater
routing tables.
Original DYMO
RREP
D

such as limited scalability, the requirement to have a global Network Link

D,H,9
knowledge of topology, increased delay, and increased K

,D
,9,S
Optional RREP

,S,D
overhead in terms of some metrics like Normalized Routing

D,G
Load (NRL) Which is the number of control packets, that Gratitude Reply
routing protocol creates, divided by the number of the received
data packets. H
, I,
H 8,
G S, J has a route to D
D
in its routing
cache

G,B,8,S,D
I J

I,C,7,D,S

J,E,7,D,S
Optional RREP
D

B
S,
7,
A,
B,

,S
A

,6,D
C,S
A, ,S
S, 6
6,D
, S, S,
D E,

RREP Phase: RM message Gratitude Reply

in DYMO
S

Curr.,Next,HopLimit,Target,Orig.

Fig. 3. A sample of RREP phase in DYMO

Due to the nature of ad hoc networks, finding a protocol

Fig. 2. A sample of RREQ phase in DYMO
In order to improve DYMO mechanisms, many changes
have been made based on the modifying of the route selection
or route discovery process.
Some works, such as DTDYMO[13], focus on decreasing
delay and increasing packet delivery ratio by finding routes,
with high probability, being used in future; however, these
works do not have a mechanism for handling energy
efficiency, traffic balancing , or highly dynamic topologies.
that can cover all the requirements is not an easy task;
therefore, each of these protocols focus on some determined
parameters and QoS metrics.
III. DESCRIPTION OF DYNAMIC MANET ON-DEMAND
(DYMO)
DYMO is a successor of AODV; it is currently in its 26th
revision [2] and it is being developed by the Internet
Engineering Task Force (IETF) MANETs working group [16] .
DYMO supports the Internet Protocol (IP) [17] version 4 and 6
(IPv4 and IPv6 respectively) and uses the generalized MANET
Packet/Message format [18]. It proposes a uniformed message
format for routing operations, such as the Routing Message
(RM) that, on top of the routing functionalities, will play the
typical roles attributed to the Hello or Beacon packets. By
using the uniformed RMs, DYMO will be of multipath
capability (optional) and it provides all the efficiencies of
reactive and proactive protocols [19]. DYMO is a hop-by-hop
routing protocol and the nodes, exploiting the path
accumulation mechanism, can extract additional information
from RMs. DYMO simplifies the current reactive protocols
and still conserves the two main well known operations of
reactive protocols: route discovery and route maintenance [19].
A. Routing Operation: Route Request Phase
When a Source node (S) needs a route to a Destination
node (D) it originates a Route Message (RM), called ROUTE
REQUEST (RREQ) message, and broadcasts it to all of its
neighbours. RREQs are then flooded in the network until they
reach their destination.
An intermediate node which does not know the route to the
destination should forward the RREQ to its neighbours. Some
fields that constitute the RM fields are: Source, Destination,
HopLimit (the default value is 10 based on [2]), Target, and
Origin.
By tracing the RREQ traversed path (called accumulated
path), each node, receiving an RREQ, can extract important
routing information. Fig. 2 shows how RREQ operations work
in DYMO protocol for a sample network.
Fig. 4. A sample of RERR phase in DYMO
B. Routing Operation: Route Reply Phase
When RREQs finally reach to their destination or to an
intermediate node that already has, in its routing table, a
complete route towards the destination (known as gratitude
reply), it replies with another RM, called ROUTE REPLY
(RREP), as shown in Fig. 3. Both RREQ and RREP have the
same uniform structure. The destination may optionally reply
to multiple RREQs (received via different paths) by sending
different RREPs; the source can accept (or reject) multiple
RREPs – this will enable multiple paths between the source
and the destination in its routing table; however, this
mechanism creates a considerable amount of interference and
overhead in the network. Our proposed approach, E2DYMO,
avoids these two problems.
C. Routing Operation: Route Error Phase
If an intermediate node cannot reach the next node in the
route, by detecting a link breakage, it sends an RM, called
ROUTE ERROR (RERR), back to the source node and also its
neighbours, reporting this failure (see Fig. 4). Some of the
RERR fields are: Source, Destination, HopLimit, and
Unreachable Node.
IV. ENERGY EFFICIENT DYMO (E2DYMO)
E2DYMO introduces two new fields in DYMO’s RMs:
Energy and Traffic fields.
A. Energy Field
Suppose that for a communication between a source and a
destination node, there are N routes and the number of nodes
in ith route, called Routei, is Mi (as shown in Fig. 5).
In E2DYMO, each node, like kth node in Routei, has a
battery power (BPk) level, quantified in 16 different values
(from 0 to 15), defined as BPk.
Moreover, there is a Critical Battery Power Level (CBPL)
whose default value is 2 (CBPL=2). A node like node k in
Routei, which has a BP of less than CBPL, is suffering from
energy depletion and is considered as a critical node in terms of
battery power (i.e. < ). Critical nodes should not be
selected for packet relaying. The Energy field of RREQ In
E2DYMO has three cells: TotBat, MinBat, and CritBat.
TotBati is the summation of total battery power level of all
nodes of Routei, as (1) shows. MinBati cell in energy field of
RREQi shows the minimum value of BP for all nodes in
Routei. CritBati shows the number of nodes which have a BP
less than CBPL in Routei.
=∑ (1)
B. Traffic Field
If the queue size of interface of node k located in Routei is
AQk and the maximum size of interface queue of node k is
MQk, then the traffic parameter of node k in E2DYMO (i.e.
TPk ) is defined as:
= (2)
The Traffic field of RREQ has two cells: TotTra and
MaxTra. TotTrai is the TP summation of all nodes of Routei,, as
defined in (3):
 =∑ (3) When a destination node receives an RREQ, it can
calculate Ei, via the energy field of RREQ.
MaxTrai is the maximum TP values of Routei. Also, a 2) Traffic parameter
sample of routing table of a node is shown in TABLE I. A route with a lower traffic metric cost has a higher priority
Therefore, in E2DYMO, when the intermediate node k in the routing process. Nevertheless, a route may have a low
receives RREQ, it updates TotTrai and MaxTrai of the traffic overall traffic metric even if one of its nodes is overloaded with
field of RREQ and forwards RREQ toward the next node. traffic. In E2DYMO, this route has a bottleneck; therefore, it
should be avoided.
TABLE I. A SAMPLE OF ROUTING TABLE OF A NODE
The traffic parameter of Routei is shown by T(i) and is
Dest. Route Hop Next Life Forward Broken … defined as:
Add. Seq. Count Hop Time Flag Flag
Num. (ms) ( )× ()
D 112 3 I 3000 T F …
= (7)
E 36 2 S 2000 T F …
Where Mi is the number of nodes in Routei; TotTra(i) and
K 76 4 I 5000 T F …
MaxTra (i) were explained in previous section. When a
… … … … … … … … destination node receives an RREQ, it can calculate Ti, via the
traffic field of RREQ.
C. Route Selection Process
When a destination node receives several RREQs from
different routes, like in Fig. 2, it runs a route selection process
to determine the best route in terms of energy and traffic
parameters.
1) Energy Parameter
The energy parameter of Routei,, called E(i), indicates the
priority of Routei , in terms of battery power level :
()
= (4)
×

Where Mi is the number of nodes in Routei, TotBat(i) is the

total battery power level of nodes in Routei, as discussed in (1),
and InitialBat is the initial battery power level of nodes, set to
the same value for all nodes. TotBat(i) indicates the total
battery power level of nodes in Routei.
In some scenarios, a route may have a few nodes with very
low energy levels; i.e., nodes with a BP of less than CBPL but
a high overall energy (i.e. high TotBat). This route should be
avoided so that the negative effect of MinBat(i) (the node
which has the minimum battery power level in Routei) should
be applied to E(i):
( )× ()
= (5)
×
As mentioned before, CritBat(i) identifies the number of
nodes in Routei which have reached a critical battery level and
hence should be avoided from packet relaying functions
(otherwise the route will be doomed to fail very soon). A big
value for CritBat(i) alerts that this route has several nodes with
a critical battery level.
Consequently, E(i) could be revised to reflect also the
negative effect of these nodes in Routei . The final E(i) will be:
=
( )× ()
× ×( ()
Fig. 5. Multiple routes between source and destination
3) Precedence Function
The function that determines the precedence of Routei is
shown by RoutePrio(i); this function depends on the energy
and the traffic parameters of Routei. The priority of Routei is:
()= (8)
4) Routing Behavior of Nodes in E2DYMO
In E2DYMO, each node shows different routing behaviour
that is depended on the role of the node in a communication.
• Source Node: when a source node wants to send an
RREQ, it initializes the values of the energy and the
traffic fields (they will be set to zero).
• Intermediate Nodes: (i) each node who receives an
RREQ adds its own BP to TotBat value; (ii) if the
current node k in Routei, has a BPk less than MinBat,
then MinBat will be updated by BPk (i.e., if <
then = ); (iii) if < , then CritBat
will be increased by one – also, for traffic field, each
node, who receives an RREQ, adds its TPk number to
(6) the TotTra number; (iv) if > , then
) MaxTra will be updated by TPk.
 • Destinatio
on Nodes: when n a destination
n node receivess n ratio(PD
DR), NRL, annd jitter, in commparison withh the original
RREQs from
f different n routes, by y extracting the
t DYMO O and the other proactive and reactive protoccols.
required information
i from
fr RREQ, it can calculaate
RoutePrioority for all th hese RREQs and the relatted ACKNOWLEDG
GMENT
routes, annd finally thee route which has the best Thee research leadding to these reesults has receeived funding
RoutePrioority will be choosen. from thhe Fundação para a Ciência e Tecnologia ((PTDC/EEA-
TEL/1119228/2010 - S SMARTVISION N).
Fig. 6 shows the role of thee source, the intermediate,
i and
a
thee destination no
odes in a comm munication. Eaach route requeest, REFERENCES
succh as RREQi, should
s be initiaalized by a sou
urce node. It will
w
[1] V. Talooki, J. Rodrigguez, R. Sadeghi, A Load Balancedd Aware Routing
passs from a routee like Routei (w
which has Mi in ntermediate nod
des Prootocol For Wirelesss Ad Hoc Networrks, 16th Internatioonal Conference
likee node k) and will be updated by them. It finally
f reaches to on ttelecommunicatio ns, Morocco (2009).
thee destination node which is responsib ble for runniing [2] Dynnamic MANET On-demand (DY YMO) Routing, ddraft-ietf-manet-
Preecedence Functtion, finding th a initializing an
he best route, and dymmo-26, http://toolss.ietf.org/html/drafft-ietf-manet-dymoo-26.
RRREP. [3] Eimman Alotaibi , Bisswanath Mukherjeee, Survey on rouuting algorithms
for wireless Ad-Hoc and mesh networkks, Computer Netw works 56 (2012)
Therefore, via this distribu uted mechanismm, the nodes in 9400–965.
E2D DYMO can co d in the network,
ooperatively baalance the load [4] C.EE. Perkins, P. B Bhagwat, Highly dynamic destinaation sequenced
in tterms of trafficc and battery po
ower consumpttion. disttance-vector routinng (DSDV) for m mobile computers,, Proceedings of
the Annual ACM S Special Interest G Group on Data C Communications
Energy Field Inittialization:
(SIGGCOMM’94), 19994, pp. 234–244.
Source
TotBati=0 [5] P. Jacquet, P. Muhllethaler, A. Qayyyum, A. Laoutit, L. Viennot, T.
MinBati=0 Claausen, Optimized Link State Routiing Protocol (OLS SR), IETF RFC
CritBati=0 36226, October 2003. <http://www.olsr.net/,http://www.olsr.org/>.
Iniitialize and
Traffic Field Initialization:
TotTrai=0 se
end RREQ [6] D.BB. Johnson, D.A. Maltz, DSR: Dynnamic Source Rouuting in Ad-Hoc
MaxTrai=0 Wirreless Networks, Mobile Computting, vol. 5, Kluuwer Academic
Pubblishers, 1996.
Intermediatee [7] C. Perkins, E.M. Rooyer, AODV: Add-Hoc on-demand distance vector
rouuting, in: Proceeddings of the Secoond IEEE Worksshop of Mobile
Update an
nd Com mputing Systems and Applications (WMCSA’99), February 1999,
Update Enerrgy Field
Forward RR
REQ TotBati, MiinBati, and CritBati pp. 90–100.
Update Trafffic Field [8] T.XX. Brown, S. Dooshi, S. Bhandarre, EADSR: Thee Energy-Aware
TotTrai and
d MaxTrai Dynnamic Source Roouting Protocol, IInternet Draft, draaft-brown-eadsr-
Destination 00.ttxt, June 2003.
[9] D. Djenouri, N. Baadache, DSRPA: Dynamic source routing power-
Iniitialize and awaare, International Journal of Ad-H Hoc and Ubiquitoous Computing,
Calculate Ei
(IJAAHUC’06) 1 (3) (22006) 126–136.
se
end RREP
Calculate Ti [10] J. Gomez, A.T. Caampbell, M. Nagghshineh, C. Bissdikian, PARO:
Calculate RouteePriority(i) suppporting dynamicc power-controlleed routing in w wireless ad-hoc
Find Best Route netwworks, Proceedinggs of the Wireless Networks 9 (5) (22003) 443–460.
[11] S. Singh, C. Raghavvendra, PAMAS and PAMAS-pow wer aware multi
Fig.. 6. RREQ and RREP processes: the routing beehaviour of Sourrce, acccess protocol witth signaling ad-hhoc networks, A ACM Computer
Com mmunication Reviiew 28 (3) (1998) 526.
Inteermediate, and Desstination nodes in E2DYMO.
E
[12] G. Chakrabarti, S.Kuulkarni, Load Balaancing and resourcce reservation in
mobbile ad hoc netwoorks, Ad Hoc Netw works, Volume 4, IIssue 2, 1 March
V. CONCLUSION
N AND FUTURE WORK
W
(20006).
This paper preesents a new en nergy efficient and traffic fittiing [13] Chrristian Kretschmeer et al., “DT-D DYMO: Delay-Tolerant Dynamic
rouuting protocol for
f MANETs called c E2DYM MO. The propossed MA ANET On-demandd routing”, 2009 299th IEEE Internatiional conference
rouuting protocol is based on the t well-know wn IETF DYM MO on ddistributed compuuting systems workkshops.
prootocol and it uses the staandard DYMO O packets [17]. [14] Geoorgios Koltsi das, Fotini-N
Niovi Pavlidouu et al.
DYYMOM,“Investigatting the perform mance of a Muultipath DYMO
E2D DYMO energy y efficiency mechanism
m can detect the nod des prootocol for ad hocc networks”, IEEE E 2007, The 18tth annual IEEE
thaat reach a criticcal battery leveel and switch the
t route in ord der Inteernational sympoosium on personnal, indoor andd mobile radio
to avoid networrk fragmentatiion and to acchieve a high her commmunication (PIM MRC‟07).
nettwork lifetime.. The same beehaviour is alsso fulfilled wh hen [15] S. LLee and M. Gerlaa, “Dynamic load aaware routing in aad hoc network”
botttlenecks are detected
d in a sppecific route. These addition nal in pproc IEEE ICC‟011, Helsinki, Finlannd, June 2001.
funnctionalities arre achieved wiithout the neeed to create neew [16] Inteernet Engineering Task Force (IETF F) MANETs workiing group, 2013,
prootocol messages. E2DYMO only o makes smaall changes in the t Avaailable from: httpp://datatracker.ietf.org/wg/manet/.
uniiformed DYMO routing messages in ordeer to include the t [17] Inteernet Protocoll (IP), RFC C 791, Avvailable from
Eneergy and the Traffic param meters. The pro oposed approaach httpp://tools.ietf.org/httml/rfc791.
exttracts its requirred information from these modified
m pack kets [18] Genneralized Mobilee Ad Hoc Netw work (MANET) Packet/Message
Forrmat, ttp://tools.iettf.org/html/rfc54444.
andd does not inccrease the Norrmalized Routiing Load (NRL L).
[19] “Peerformance analyysis of Dynamic MANET Ondem mand (DYMO)
Thee next step in E2DYMO
E is th
he full evaluatio
on of the protoccol Rouuting protocol”,Suukant Kishoro Bissoyi1, Sarita Sahuu2,Special Issue
perrformance, usin ng QoS metricss such as delay, Packet Deliveery of IJCCT Vol.1 Isssue 2, 3, 4; 2010 for Internatioonal Conference
[AC CCTA-2010].