Load Balancing in MANET

Aswin Prasanth S. M.
S7 CS 07
 Introduction
 Mobile ad hoc networks (MANET) consist of mobile platform which c
ommunicate with each other through wireless links, without any predet
ermined infrastructure.

 If the source and destination nodes are not within the transmission rang
e of each other, then intermediate nodes would be served as intermediat
e routers for the communication between the two nodes.

 The mobile platform moves autonomously and communicates via dyna

mically changing network.

 MANET, sometimes called a mobile mesh network, is a self-configurin

g network of mobile devices connected by wireless links.

2
 Why Load Balancing
 Transmission based on routing protocols which determine the path
by using least number of nodes

 Some central nodes will always be high traffic nodes

 Poorer traffic and network load increases

 Dynamical changes needs to be monitored since the nodes are mo

bile

 No particular network structure present

 Low bandwidth

3
 MaNet Protocols

 Proactive Protocols  Reactive Protocols

• Table driven • On Demand
• Continuously evaluate routes • Route discovery by some glo
• No latency in route discover bal search
y • Bottleneck due to latency of
• Large network capacity to ke route discovery
ep info. current • May not be appropriate for r
• Most routing info. may neve eal time communication
r be used!
 MANET TERMS
 RREQ: Route REQuest, is initiated by source node

 RREP: Route REPly, is initiated by destination on receiving of RREQ

 Interface Queue length: Length of packet queue.

 Packet Delay: Is the difference in end-to-end delay between selected packet

s in a flow with any lost packets being ignored

5
 Load Balancing by logical partitioning of Mobil
e Nodes
 Source nodes divided into various
logical groups

 Some nodes in a group can access

internet via a gateway

 Nodes in one group cannot relay p

ackets from other. Nodes in gatew
ay can relay packets to internet.

Draw Back
 When large number of packets are

generated inside a single group

6
 Work Load Based Adaptive Load Balancing

 Based on interface queue length a

nd the work load

 A threshold value ranged from mi

n to max used

 Initial threshold set to max value. I

f incoming RREQ falls between M
IN and MAX threshold is changed

 Its incremented if queue length re

main high for period of time decre
mented if its low

7
 Dynamic Load-aware Based Load-balanced Rou
ting
 Selects route based on current routing load

 Finds the route with least traffic

 The RREQ accumulates interface queue length and packet delay of all node
s from source to destination

 When destination receives this RREQ it compares current active routes and
RREQ received

 If current RREQ has lower interface queue length and packet delay then tha
t route is taken

8
 Ad hoc On Demand Vector Routing
 The network is silent until a connection is needed

 Request for connection RREQ

 Explosion of temporary routes back to the needy node RREP

 Uses the route that has the least number of hops

 Unused entries saved and used at later time

 No extra traffic for communication along existing links

 Doesn't require much memory or calculation

9
AODV Load Balancing (1/2)

10
 AODV Load Balancing (2/2)
 Based on Route Workload Ind
ex(RWI)

 RWI represents the average lo

ad status of a route.

 If RWI of route X is lesser tha

n RWI of route Y then route
X is less loaded and hence pre
ferred for transmission

11
 Reverse AODV algorithm (RAODV)
 Route request packet in RAOD  When the destination node rece
V contains the source and desti ives first route request messag
nation addresses, together with e, it generates reverse request
the broadcast ID, uniquely iden (R-RREQ) message and broadc
tify this RREQ packet. asts it to neighbor nodes within
transmission range.

12
 Reverse AODV algorithm (RAODV)
 When broadcasted reverse request packet arrives to intermediate nod
e, it will check for redundancy.

 If it already received the same message, the message is dropped,

otherwise forwards to next nodes and when the source node receives
first reverse request message, then it starts packet transmission, and l
ate arrived R-RREQs are saved for future use.

 The saved R-RREQ can be used when traffic in the current active ro
ute becomes high.

13
 Modified Reverse Ad Hoc On Demand Distance Vector
(MRAODV) routing algorithm
 In the proposed routing algorithm (MRAODV), when a source node
wants to communicate with a destination node, first it broadcasts a R
REQ packet.

 When destination receives a RREQ message, it broadcasts R-RREQ

message to find source node.

 Each intermediate node which receives the R-RREQ message, calcul

ates route stability

14
 Modified Reverse Ad Hoc On Demand Distance Vector
(MRAODV) routing algorithm
 When source node receives R-RREQ, it will have multiple routes to
destination, so it selects stable route to destination node. This proces
s is illustrated in figure.

15
 Modified Reverse Ad Hoc On Demand Distance Vector
(MRAODV) routing algorithm
 Here when one intermediate node moves and causes link breaks then
active route fails and a new route must be selected.

 In AODV, this process is done by initializing route discovery proced

ure and in RAODV with selecting one available route with minimum
hop count.

 In MRAODV, a new route with maximum stability is selected betwe

en available routes.

16
 Path Maintenance in MRAODV Routing Algorithm
 When a route established between source and destination, data trans
mission stage can be started.

 In high mobility environments, link failure is a common phenomeno

n which can be occurred.

 In both reverse RAODV and AODV routing algorithms, source node

selects new path based on shortest path method and when mobile no
de moves quickly, these algorithms can not show good performance.

17
 Issues in Ad hoc Wireless Networks
 Self-Organization is required in ad hoc wireless networks:

• Neighbor discovery
• Topology organization
• Topology reorganization

 Information disclosure: a compromised node can act as an informer.

 Interference: jam wireless communication by creating a wide-spectrum noise.

 Issues in Ad hoc Wireless Networks
• Denial of service

• Resource consumption

 Energy depletion: deplete the battery power of critical nodes

 Buffer overflow: flooding the routing table or consuming the data pac
ket buffer space

• Host impersonation: A compromised node can act as another node.

19
 Applications of Ad hoc Wireless Networks

 Military applications

• Ad hoc wireless networks is useful in establishing communication in a

battle field.

 Collaborative and Distributed Computing

• A group of people in a conference can share data in ad hoc networks.

• Streaming of multimedia objects among the participating nodes.

20
 APPLICATIONS
 Emergency Operations

• Ad hoc wireless networks are useful in emergency operations such as sea

rch and rescue, and crowd control.

 A Wireless Mesh Network is a mesh network that is built upon wireless co

mmunications and allows for continuous connections and reconfiguration ar
ound blocked paths by "hopping" from node to node until a connection can
be established.

21
QUESTIONS!!

22
THANK YOU

23