The document discusses designing energy efficient routing protocols for mobile ad hoc networks (MANETs). It outlines several key points: - MANETs are infrastructureless wireless networks formed by mobile nodes without centralized administration. Routing in MANETs is challenging due to the dynamic topology. - Several routing protocols for MANETs are studied, including AODV, DSR and protocols that optimize power consumption like EPAR. - The performance of these protocols is evaluated using MATLAB simulations based on metrics like packet delivery ratio, delay and throughput. The goal is to design a protocol that maximizes network lifetime by choosing routes with minimum total transmission power while ensuring nodes have sufficient battery capacity.

1. SUBMITTED BY:
Mona

2. [1]Shivashankar, Golla Varaprasad, Guruswaamy jayanthi-
Designing energy Routing Protocol with Power consumption
Optimization in MANET||IEEE Transaction on Emerging Topics
in Computing, pp,1-4,October 2013

3.  Study the mobile adhoc network.
 Study various power aware routing protocols
of Manet.
 Study Matlab.
 Implement routing protocols such as EPAR,
DSR,MTPR in Matlab.
 Study performance analysis of various
protocol based on parameters such as Packet
delivery ratio ,Delay, Throughput.

4.  Need: Access computing and communication services, on the
move
 Infrastructure-based Networks
◦ traditional cellular systems (base station infrastructure)
 Wireless LANs
◦ Infrared (IrDA) or radio links (Wavelan)
◦ very flexible within the reception area; ad-hoc networks possible
◦ low bandwidth compared to wired networks (1-1000 Mbit/s)
 Ad hoc Networks
◦ useful when infrastructure not available, impractical, or expensive
◦ military applications, rescue, home networking
4

5.  Two types of wireless networks:
◦ infrastructured network:
 base stations are the bridges
 a mobile host will communicate with the nearest base station
 handoff is taken when a host roams from one base to
another
◦ ad hoc network:
 infrastructureless: no fixed base stations
 without the assistance of base stations for communication
 Due to transmission range constraint,
 two MHs need multi-hop routing for communication
 quickly and unpredictably changing topology

6. Characteristics
◦ Energy constrained
nodes
◦ Bandwidth constrained
◦ Variable capacity
wireless links
◦ Dynamic topology
6
• Information exchange in a network of mobile and wireless
nodes without any infrastructural support.
• Such networks are often called ad hoc networks to
emphasize that they do not depend on infrastructural
support.
• A mobile ad-hoc network is a mobile, multi-hop wireless
network which is capable of autonomous operation.
• The purpose of an ad hoc network is to set up (possibly) a
short-lived network for a collection of nodes.

7.  Host movement frequent
 Topology change frequent
 No cellular infrastructure. Multi-hop wireless
links.
 Data must be routed via intermediate nodes.
7
A
B A
B

8.  Setting up of fixed access points and
backbone infrastructure is not always viable
◦ Infrastructure may not be present in a disaster area
or war zone
◦ Infrastructure may not be practical for short-range
radios; Bluetooth (range ~ 10m)
 Ad hoc networks:
◦ Do not need backbone infrastructure support
◦ Are easy to deploy
◦ Useful when infrastructure is absent, destroyed or
impractical
8

9.  No base station. No fixed infrastructure.
 Traditional fixed networks routing schemes are not effective.
◦ E.g. Link state and distance vector routing algorithms
 MANET nodes cooperate to provide routing service.
◦ A node communicates directly with nodes in wireless
range.
◦ For all other destinations, a dynamically determined multi-
hop route through other nodes.
◦ Rely on each other to forward packets to their destination.
9

10.  Personal area networking
◦ cell phone, laptop, ear phone, wrist watch
 Military environments
◦ soldiers, tanks, planes
 Civilian environments
◦ taxi cab network
◦ meeting rooms
◦ sports stadiums
◦ boats, small aircraft
 Emergency operations
◦ search-and-rescue
◦ policing and fire fighting
10

12. 12
Ad hoc On-Demand Distance vector
 AODV is an improvement over DSDV, which
minimizes the number of required broadcasts by
creating routes on demand.
 Nodes that are not in a selected path do not
maintain routing information or participate in
routing table exchanges.
 A source node initiates a path discovery process to
locate the other intermediate nodes (and the
destination), by broadcasting a Route Request
(RREQ) packet to its neighbors.

13. 13
Route Discovery in AODV Protocol
Source
Destination
1
3
2
5
7
4
6
8
(a) Propagation of Route Request (RREQ) Packet
Source
Destination
(b) Path Taken by the Route Reply (RREP) Packet
1
3
2
5
7
4
6
8
Hop1 Hop2 Hop3

14. 14
Dynamic Source Routing
 The protocol consists of three major phases: Route
Discovery, Route Reply, Path Establishment.
 When a mobile node has a packet to send to some
destination, it first consults its route cache to check
whether it has a route to that destination.
 If it is an un-expired route, it will use this route.
 If the node does not have a route, it initiates route
discovery by broadcasting a Route Request packet.
 This Route Request contains the address of the
destination, along with the source address.

15. 15
Dynamic Source Request (Cont’d)
 Each node receiving the packet checks to see whether it
has a route to the destination. If it does not, it adds its own
address to the route record of the packet and forwards it.
 A route reply is generated when the request reaches either
the destination itself or an intermediate node that contains
in its route cache an un-expired route to that destination.
 If the node generating the route reply is the destination, it
places the the route record contained in the route request
into the route reply.

16. B
A
S E
F
H
J
D
C
G
I
K
Z
Y
Represents a node that has received RREQ for D from S
M
N
L

17. B
A
S E
F
H
J
D
C
G
I
K
Represents transmission of RREQ
Z
Y
Broadcast transmission
M
N
L
[S]
[X,Y] Represents list of identifiers appended to RREQ

18. B
A
S E
F
H
J
D
C
G
I
K
Z
Y
M
N
L
[S,E]
[S,C]

19. B
A
S E
F
H
J
D
C
G
I
K
Z
Y
M
N
L
[S,C,G,K]
[S,E,F,J]

20. •Destination D on receiving the first RREQ,
sends a Route Reply (RREP)
•RREP is sent on a route obtained by
reversing the route appended to received
RREQ
•RREP includes the route from S to D on
which RREQ was received by node D

21. B
A
S E
F
H
J
D
C
G
I
K
Z
Y
M
N
L
RREP [S,E,F,J,D]
Represents RREP control message

22. B
A
S E
F
H
J
D
C
G
I
K
Z
Y
M
N
L
DATA [S,E,F,J,D]
Packet header size grows with route length

23. 


 Signal to Noise
Formula
 Formula to calculate the
total transmission
power for route L
 The desired route k
calculation
 Doesn’t give the
minimum number of
hops

24. 

 Using previous scheme,
maximize the life time of
each node and use the
battery fairly can’t be
achieve simultaneously
 Use battery capacity
instead of cost function
 Choose route with
minimum total
transmission power
among routes that have
nodes with sufficient
remaining battery capacity