You are on page 1of 105

Quality of Service in

MANETs

Guided By Presented by
Dr. P. K. Behera
Riyazuddin Khan
Dept. of Computer Science
Utkal University,BBSR Roll. No.-41756UT07019
Topics To Be Discussed . . .
Introduction
Quality of Service
QoS Routing
QoS Models
Security Issues in MANETs
Comparison and Simulation
Conclusion
References
Introduction
 Mobile wireless n/ws and devices are becoming
popular, as they provide access to information
and communication at anytime and anywhere.
 There are 2 approaches of using wireless mobile
devices:
 Infrastructured Wireless n/w.
 Infrastructureless Ad hoc n/w.
Backbone

Infrastructureless Ad hoc network


 In infrastructureless approach, the wireless n/w is known as
mobile ad hoc n/w (MANET)s.
 “A MANET is a collection of autonomous mobile nodes
connected by wireless links that can dynamically form a
network to exchange information without using any pre-
existing fixed network infrastructure”.
 The nodes on the communication path both acts as hosts
and routers.
 MANETs are very much useful in real-time and multimedia
applications. Hence MANETs environment need to support
QoS.
 This QoS requirement can be provided through:
 Routing
 Model
 Security
Basic Concept On Mobile Ad Hoc Network
Mobile Computing:
“Mobile computing is a generic term describing
one's ability to use technology while moving. Mobile
Computing is used to describe technologies that enable
people to access network services anyplace, anytime,
and anywhere”
Wired Network vs. Mobile network

·Wired Networks ·Mobile Networks


-high bandwidth - low bandwidth
-low bandwidth
- variability - high bandwidth variability
-can listen on wire -hidden terminal problem
-high power machines -low power machines
-high resource machines -low resource machines
-need physical access(security) -need proximity (closeness)
-low delay -higher delay
-connected operation -disconnected operation
Types of Wireless Networks
 According to the relative mobility of hosts and
routers, there are three different types of wireless
networks:
1. Fixed Wireless Network
2. Wireless Network with Fixed Access Points
3. Mobile Ad hoc Network (MANET)
1 2 3
Ad Hoc Network
Ad hoc networks are self-organizing, rapidly
deployable, and dynamically reconfigurable networks,
which requires no fixed infrastructure.

C'
E
Laptop
Laptop
A Laptop
D
PDA
B
Laptop
Laptop

LaptopC
PDA
Laptop

PDA
PDA
Mobile Ad Hoc Networks (MANETs)

Ad hoc networks in which the nodes are connected by


wireless links and can be mobile are referred to as
Mobile Ad hoc NETwork (MANET) where all the
MN’s function as hosts and routers at the same time.
Characteristics Mobile Ad Hoc Networks

Network of mobile wireless nodes have


Autonomous terminal: - Self-organizing, nodes behaves both
as hosts and routers.
Distributed operation.: - No central authority, all are free.
Multihop routing: - Data can be relayed by intermediate nodes
Dynamic network topology:- Routing infrastructure created
dynamically.
Fluctuating link capacity: - End-to-end path shared by several
sessions.
Light-weight terminals.: - Less CPU processing capability,
small memory size, low power storage etc.
No infrastructure (e.g. basestations, fixed links, routers,
centralized servers)
Some Issues/Challenges in MANETs
 For getting the benefits from MANETs we need to
consider some challenges:
 Routing
Medium (Channel) Access
Mobility Management
Security and Reliability
Power Management
Quality of Service
Applications of MANETs (1)
Applications of MANETs (2)
Topics To Be Discussed . . .
Introduction
Quality of Service
QoS Routing
QoS Models
Security Issues in MANETs
Comparison and Simulation
Conclusion
References
What is (Quality of Service) QoS ?
 “QoS is the collective effect of service
performance which determines the degree of
satisfaction of a user of the service”.
QoS is the performance level of service offered
by a network to the user.
 The Goal of QoS is to achieve a more
deterministic network behavior so that the
information carried by the network can be better
delivered and the resources can be better utilized.
Example to Show why QoS is Important
Need For QoS in MANETs
 MANETs have lack of 4 essential QoS ingredients
that need for QoS in MANETs:
 Lack of Processing power & Storage
Capacity
 The limited capabilities of mobile nodes
batteries
 The lack of central authority and human
intervention
 The dynamic mobile nature.
Parameters of QoS Networks(1)
 Different services require different QoS
parameters.
Multimedia
 Bandwidth, delay jitter & delay
 Emergency services
 Network availability
Group communications
Battery life.
QoS Metrics
 There are three QoS routing metrics
 Additive metric
 Concave metric
 Multiplicative metric
Let m(u,v) be the performance metric for the link (u,v) connecting node
u to node v, and path (u,u1,u2…uk,v) a sequence of links for the path
from u to v.
• A constraint is additive if m(u,v) = m(u,u1) + m(u1,u2) +...+ m(uk,v).
• E.g : - end-to-end delay
•A constraint is concave if m(u,v)=min{m(u,u1), m(u1,u2),….,
m(uk,v)}.
• E.g : - bandwidth.
• A constraint is multiplicative if m(u,v) = m(u,u1) x m(u1,u2) x ...
x m(uk,v).
• E.g : - probability of a packet sent from a node u to reach a node v.
Types of QoS
Depending upon the service requirements of
particular applications, there are 2 types of services :
 Hard QoS: The QoS requirements are strict.
Guarantees the availability of all the resources
during communication.
 Soft QoS: The failure to meet QoS
requirement is allowed when link breaks.
 In MANETs we are only providing soft QoS, due to
the strict requirement of Hard QoS.
Routing
 Routing is the process of selecting paths in a network
along which to send network traffic.
 It is the process of finding a route or path along which
the data or control packets can be delivered between
nodes in the network.
 It can also be defined as the process of creating or
updating the routing table.
 Routing protocol/algorithm is that part of the network
layer software, which is responsible for deciding on
which output line an incoming packet should be
transmitted. The routing protocol has two main functions:
 Selection of routes for various source-destination pairs
 The delivery of messages to their correct destination.
Conventional Routing Protocols(1)
 Routing protocols can also be classified as:
 Link State Protocols
 Routers using this protocol maintains a full or partial
copy of the network topology and costs for all known
links
 It is more reliable, easier to debug and less
bandwidth-intensive
 Distance-Vector Protocols
 Routers using this protocol, keeps only information
about next hops to adjacent neighbors and costs for
paths to all known destinations.
 It is more complex and requires more computation and
memory intensive
Conventional Routing Protocols(2)

 Source routing
 In this routing the source node determines the
complete sequence of nodes through which the
packet has to pass and keeps in packet’s header.
 It is easy to avoid routing loops, but each packet
requires slight overhead.
 Flooding
 It is a widely used form of broadcasting. In flooding
the original node sends its route information to its
neighbors and so.on.
Different criteria for designing and
classifying routing protocols
 Proactive vs. Reactive Routing
 Single path vs. multiple path
 Table driven vs. Source Initiated
 Source routing vs. hop by hop routing
 Full/Limited/Local Broadcast
 Periodic vs. Event Driven
 Flat vs. Hierarchical Structure
Desirable Properties of Routing
Protocols in MANETs
 Distributed Operation
 Loop Free
 Demand Based Operation
 Security
 Power Consumption
 Multiple Routes
 QoS support
Topics To Be Discussed . . .
Introduction
Quality of Service
QoS Routing
QoS Models
Security Issues in MANETs
Comparison and Simulation
Conclusion
References
QoS routing
 QoS routing is the process of providing end to end loop
free paths that guarantees to support a set of QoS
parameters.
 The goal for QoS routing is 2-fold: -
1) QoS routing schemes can help admission control:
provides route to destination, and computes QoS
parameters available on that route. It accepts
connection, if a suitable loop-free path is found,
otherwise it rejects connection.
2) QoS routing scheme consider multiple constraints:
provide different paths to different traffics subject to
QoS requirements.
List of MANETs Routing Protocols
 Routing approaches are varied
 Proactive protocols calculate routes to all destinations
 Reactive protocols dynamically find routes when needed
 Hybrid protocols do a little of both
Proactive Routing Protocol(PRP)
 Characteristics:
A proactive protocol, each node advertises their presence
periodically and maintains extensive routing tables for the entire
network. As a result, a route is found as soon as it is requested.
 Advantage:
The main advantage of a proactive protocol is its low
latency in discovering new routes.
 Disadvantage:
High volume of control messages required for updating
local routing tables., that cosumes high bandwidth and
processing power.
Maintain the routes which may never be used
 Examples:
 DSDV, HSR, WRP
Destination-Sequenced Distance-
Vector Routing (DSDV)
 Destination-Sequenced Distance-Vector Routing
(DSDV) is a table-driven routing scheme for MANETs.
 The main contribution of the algorithm was to solve the
routing loop-problem.
 A seq. number is generated by the destination, and the
emitter needs to send out the next update with this
number.
 Each entry in the routing table contains a sequence
number, the sequence numbers are generally even if a
link is present; else, an odd number is used.
 Routing information is distributed between nodes by
sending full dumps infrequently and smaller incremental
updates more frequently.
DSDV(2)
For example the routing table of Node A in this network is

Number of Install
Destination Next Hop Sequence Number
Hops Time
A A 0 A 46 1000
B B 1 B 36 1200
C B 2 B 28 1500
DSDV(3)
 Advantages:
 Routes available to all destinations: Less latency
in route set up. It is suitable for small networks.
 Disadvantages:
 DSDV requires a regular update of its routing
tables, which uses battery power and a small
amount of bandwidth even when the network is
idle.
 Whenever the topology of the network changes, a
new sequence number is necessary before the
network re-converges; thus, DSDV is not suitable
for highly dynamic networks.
 It leads to count-to-infinity problem.
Hierarchical State Routing(HSR)
 It is a multilevel clustering-based LS routing
protocol, that maintains a hierarchical topology.
 The nodes in HSR are of three kinds:
 clusterheads
 gateways
internal nodes.
HSR(2)
 Inside the cluster, each node has route to all other internal
nodes. Communication between clusters is done through
clusterheads.
Nodes which wants to communicate to a node outside their
cluster, ask their clusterhead to forward the packet to next
level.
 For example: Think of identifying a soldier in the army:
<division #, battalion #, company #, platoon #, squad #, name>
Advantages:
It works for a large no of nodes.
Due to hierarchy, the traffic leads to suboptimal path.
Disadvantages:
Maintaining clusters or hierarchy of clusters causes
additional overhead.
Wireless Routing Protocol(WRP)
 Table-based protocol with the goal of maintaining routing
information among all nodes in the network
 Each node is responsible for four tables:
Distance table: contains distance and predecessor node.
Routing table: keeps shortest distance, predecessor
node, successor node, status(simple path, loop, dest. not
marked).
Link-cost table: contains cost(hop count).
Message retransmission list (MRL) table: contains
message that is to be retransmitted and maintains a counter
for each entry.
 Hello messages are periodically exchanged between
neighbors
 This protocol avoids count-to-infinity problem by forcing
each node to check predecessor information.
WRP (2)
Advantages:
 WRP has the same advantage as that of DSDV.
 In addition, it has faster convergence and involves
fewer table updates.
Disadvantages:
 4 tables requires a large amount of memory ,
greater processing power and periodic hello message
consumes power and bandwidth.
The protocol is not suitable for large mobile ad
hoc networks as it suffers from limited scalability
Reactive Routing Protocol(RRP)
 Characteristics:
Route discovery initiated on-demand: Establish routes as needed
Typically consists of two phases:
Route Discovery
Route Maintenance
 Advantages:
Eliminates periodic route advertisements
 Reduce power and bandwidth requirements.
Less routing overhead
 Disadvantages:
higher latency in establishing the path
Excessive flooding can lead to network congestion.
 Examples:
 AODV
 DSR
 TORA
Ad hoc On-demand Distance Vector
Routing( AODV)
 This protocol uses an on-demand approach for finding
routes.
 It uses destination sequence numbers to identify the most
recent path.
 Source node and the intermediate nodes store the next-
hop information corresponding to each flow for data packet
transmission.
 Source node floods the RouteRequest packet when a
route for the desired destination is not available in its cache.
 Route Request carries < (SrcID), (DestID),
(SrcSeqNum), (DesSeqNum), (BcastID), (TTL) >
Route Request and Route Reply
 When a node receives RREQ
 prepares RouteReply, if node have an unexpired
entry for the destination in its route table and the
DesSeqNum in cache is greater than DesSeqNum carried
in the RREQ. or
 forwards it by entering the previous node address,
BcastID and sets a timer.
When a node receives RREP
Sets up a forward path entry to the dst in its routing
table by storing the information about neighbor. And
forwards it towards the source.
Route Requests in AODV
Y

Z
S E
F
B
C M L
J
A G
H D
K
I N

Represents a node that has received RREQ for D from S

IT 601 Source: Vaidya


41
Reverse Path Setup in AODV
Y

Z
S E
F
B
C M L
J
A G
H D
K
I N

Represents links on Reverse Path

IT 601 42
Reverse Path Setup in AODV
Y

Z
S E
F
B
C M L
J
A G
H D
K
I N

• Node D does not forward RREQ, because node D


is the intended target of the RREQ
IT 601 43
Forward Path Setup in AODV
Y

Z
S E
F
B
C M L
J
A G
H D
K
I N
Forward links are setup when RREP travels along
the reverse path

Represents a link on the forward path


IT 601 44
AODV
 Advantages:
Routes are established on demand and
destination sequence numbers are used to find
the latest route to the destination. Thus, the
connection setup delay is lower.
 Disadvantages:
 Intermediate nodes can lead to inconsistent
routes if the source sequence number is very old.
Multiple RouteReply packets in response to a
single RouteRequest packet can lead to heavy
control overhead.
Dynamic Source Routing(DSR)
 Source S initiates a route discovery by flooding
Route Request (RREQ)
Each node appends its own identifier when
forwarding RREQ
 Destination D on receiving the first RREQ, sends
a Route Reply (RREP)
RREP sent on route obtained by reversing the
route appended in RREQ
RREP includes the route from S to D, on which
RREQ was received by D
 S routes data using “source route” mechanism
DSR Route Discovery
Y

Z
S E
F
B
C M L
J
A G
H D
K
I N

Represents a node that has received RREQ for D from S


DSR Route Discovery
Y
Broadcast transmission

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

Represents transmission of RREQ

[X,Y] Represents list of identifiers appended to RREQ


DSR Route Discovery
Y

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

• Node H receives packet RREQ from two neighbors:


potential for collision
DSR Route Discovery
Y

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

• Node C receives RREQ from G and H, but does not forward


it again, because node C has already forwarded RREQ once
DSR Route Discovery
Y

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

• Nodes J and K both broadcast RREQ to node D


• Since nodes J and K are hidden from each other, their
transmissions may collide
DSR Route Discovery
Y

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

• Node D does not forward RREQ, because node D


is the intended target of the route discovery
Route Reply in DSR
Y

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

Represents RREP control message


Data Delivery in DSR

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

Packet header size grows with route length


DSR: Route maintenance

RERR [J-D] Z
S E
F
B
C M L
J
A G
H D
K
I N
J sends a route error to S along route J-F-E-S when its
attempt to forward the data packet S (with route SEFJD)
on J-D fails (an ACK mechanism has to be there in
packet forwarding)
DSR: Advantages & Disadvantages
Advantages:
It eliminates the need to periodically flood the
network with table update messages.
The intermediate nodes utilize the route cache
information efficiently to reduce the control overhead.
 Disadvantages:
In DSR the routed packets contain the address of
each device the packet will traverse., which increases
routing overhead.
The connection setup delay is higher.
Even though the protocol performs well in static and
low-mobility environments, the performance degrades
rapidly with increasing mobility.
Temporally-ordered routing algorithm
(TORA)
 TORA is a reactive routing protocol that uses a
"flat", non-hierarchical link reversal algorithm.
 Proposed to operate in a highly dynamic mobile
networking environment
 It is designed to minimize the reaction to topological
changes, by localizing the propagation of control
messages to a very small set of nodes.
 TORA builds and maintains a Directed Acyclic
Graph(DAG) rooted at a destination and provides
multiple routes for any desired source/ destination pair.
TORA(2)
The operation of TORA can be separated into
three basic functions:
1. Route creation, DAG

2. Route maintenance,
3. Route erasure.
TORA(3)
Advantages:
It limits the propagation of control packets
to a small region when topology changes: less
overhead.
It provides loop free paths at all instants and
multiple routes so that if one path is not
available, other is readily available.
Disadvantage:
Local reconfiguration of paths could lead to
non-optimal route to the destination.
Hybrid Routing Protocol(HRP)
This protocol combines the advantages of purely proactive and
of reactive routing .
The key idea is to use a reactive routing at the global network
level while use proactive routing in a node’s local neighborhood.
Characteristics:
The network is organized into clusters
Each cluster has a cluster-head
Intra-cluster routing and inter-cluster routing
Advantages:
It allows for rapid convergence and requires less processing
power and memory.
Disadvantages:
Traffic necessary to maintain clusters and cluster-heads
Examples:
ZRP
Zone Routing Protocol (ZRP)
It is a typical hybrid protocol, that combines proactive and reactive routing
schemes.
 Divides the whole network into no. of zones.
The routing zone of a node is defined as a set nodes, within a specific minimum
distance (in number of hops: called zone radius “r”) away from that node.
All nodes within hop distance at most r from a node say X are said to be in the
routing zone of node X
 All nodes at hop distance exactly r are said to be peripheral nodes of node X’s
routing zone

E
D Zone radius=2
K
A’s zone={B, C, D, E, F, G, H, I, J}
F B
Interior nodes={C, F, H}
A
Peripheral nodes={B, D, E, G, I, J}
C
H
G
Nodes outside routing zone={K, L}

L I
ZRP(2)
 It specifies 2 protocols:
Intra-zone routing protocol (IARP) is used inside
the zone – proactive routing scheme
Inter-zone routing protocol (IERP) is used for
communication between the zones – reactive routing
scheme. It uses a Bordercast Resolution Protocol(BRP).
 Example:

B Zone for D
G
A

Zone F
S for S
D
C
E
Zone for C
H
ZRP(3)
 Advantage:
It combines the best features of proactive and reactive
routing schemes. By this it reduces:
The control traffic produced by periodic flooding of
routing information packets (proactive scheme).
The wastage of bandwidth and control overhead
compared to reactive schemes.
 Disadvantage:
The use of different IARP would mean that the nodes
would have to support several different routing protocols.
When there are overlaps in the nodes’ routing zones,
there may be redundant RouteRequests sent out. These
need to be suppressed.
Choosing zone radius is quite tricky
Some QoS-aware Routing Protocols
 To support QoS, the essential problem is to find a route
with sufficient available resources to meet the QoS
constraints.
 The basic design considerations for a QoS-aware
routing protocol:
Bandwidth Estimation: how exactly to estimate the
available bandwidth and how frequently to do the estimations.
Route discovery: finding route with reduced latency and
reduced overhead which is best for supporting QoS.
Resource reservation: how to allocate this shared
resources
Route maintenance: discover a route break and re-
establish it.
Route selection: select a stable route that support all
the QoS parameters.
QoS Routing Protocols
 Several routing protocols have been developed to
support QoS by choosing routes with the largest
available bandwidth. These are:
CEDAR
Ticket-based QoS Routing
AQOR
ADQR
Core-Extraction Distributed Ad Hoc
Routing (CEDAR)
 CEDAR is a QoS routing protocol that dynamically
establishes a core set for route setup, QoS provisioning,
routing data, and route maintenance.
 A core is a minimum dominating set, where all hosts
in the network are either the core or one-hop neighbors
of core hosts.
CEDAR(2)
 Route establishment uses reactive routing scheme
and is performed by core nodes, as only core nodes
keep track of bandwidth information, which reduces the
routing overhead.
 It includes 3-main components:
Core Extraction
Link State Propagation
Route Computation
CEDAR: Core Extraction
 The purpose is to elect a set of hosts to form a core of the
network by using local state information.
 There is at least one core node at every three hops
 Every node picks up a node within a distance not greater
than one hop from it, as its dominator
 The core consists of the dominators and tunnels
Tunnels consist of at most two intermediate non-core nodes
 Core nodes advertise their presence in the three-hop
neighborhood.
 When a host looses its connectivity with its core node due
to mobility, it either finds a core neighbor as its dominator, or
nominates one of its non-core-host neighbors to join the core,
or itself joins the core.
CEDAR: Link State Propagation
 To propagate state information (available bandwidth)
among the core nodes 2 waves are used:
 increase waves
 decrease waves
 These waves are generated when a core node’s available
bandwidth has changed by a certain amount
 Increase waves are propagated periodically, when there
is an increase in a core node’s available bandwidth. It is slow-
moving.
 Decrease waves are propagated periodically, when there
is an decrease in a core node’s available bandwidth. It is fast-
moving.
 The fast-moving decrease wave has higher priority over
slow-moving increase wave and kills the slow-moving
increase wave.
CEDAR: Route Computation

 It includes establishment of the core path from the


source to the destination via the core nodes.
 To establish a route, a source node sends a request
<s,d,b>to its dominator and the dominator initiates a
core broadcast, where s-source node address, d- dest.
address, b- bandwidth requirement.
 The dom(d) sends a core path ack to dom(s). Thus
sets up a valid core route from the source to the
destination via the core nodes.
CEDAR:

 Advantage:
utilization of core nodes reduces the traffic
overhead
 Disadvantage:
 The route establishment and computation is
relied on core nodes
 Core nodes’ movement affects the performance
of the protocol
Ticket-Based QoS Probing
 Ituses tickets to find delay-constrained or bandwidth
-constrained routes.
 Two types of tickets are used during route discovery:
 yellow tickets : used for finding a feasible route with
certain bandwidth/ delay constraints
 green tickets : used for determining low cost routes.
 When a source wants to find QoS paths to destination, it
issues probe messages with some tickets. One ticket
corresponds to one path searching. Hence maximum number of
searched paths to find a feasible route is bounded by the tickets
issued from the source.
 When the destination host receives a probe message, a
possible path from the source to the destination is found.
 Thus more tickets are issued by the source host to increase
the chance of finding a feasible path if the constraints are strict.
Ticket-Based QoS Probing(2)
 To find a delay-constrained path, intermediate hosts
forward tickets to their neighbors. If the delay in
intermediate host exceeds the maximum delay allowed,
the yellow ticket is set as invalid. The destination
chooses the path with the lowest cost among the paths
that have valid tickets.
 To find a bandwidth-constrained path,
intermediate hosts forward tickets to their neighbors. If
none of neighbors has sufficient bandwidth, the yellow
tickets are marked as invalid. Then the destination
chooses the lowest-cost feasible paths that have valid
tickets.
Ad Hoc QoS On-demand Routing
(AQOR)
 It is a on-demand QoS-aware routing protocol with the
following features:
 Available bandwidth estimation and end-to-end delay
measurement
 Bandwidth reservation
 When a route is needed, the source host initiates a route
request, by specifying bandwidth and delay requirements .
 The intermediate hosts check their available bandwidth.
 If the bandwidth at the intermediate host is sufficient to
support the request, an entry will be created in the routing
table with an expiration time.
 If reply packet does not arrive in the allotted time, the entry
will be deleted in order to reduce overhead.
AQOR(2)
 Bandwidth Estimation
To estimate available bandwidth, each node
periodically sends Hello messages with available
bandwidth to their neighbors .
 End-to-end Delay Approximation
 Half of the round trip delay.
By knowing, available bandwidth and end-to-end
delay, the smallest delay path with sufficient
bandwidth is chosen as the QoS route.
 If nodes do not receive data packets in a certain
interval, the node immediately invalidates the
reservation, by releasing the resources, which avoid
using control packets upon route changes.
Adaptive QoS Routing Algorithm
(ADQR)
 It is an adaptive QoS routing algorithm that use signal
strength to predict the route breaks and initiate a fast
reroute of data.
 Uses three levels of signal strength:
Th1, Th2, and Sr (Th1 > Th2 > Sr). Sr is the minimal
signal strength to receive a data packet.
 It also defines 3- different classes:
First node class : if Received Signal Strength>Th1
Second node class : If Th1>Received Signal
Strength>Th2
Third node class : If Th2>Received Signal
Strength>Sr
ADQR(2)
 Each node keeps a neighbor table, that keeps node’s
neighbors and corresponding cumulative signal strength,
defined as:
 SSnew−cummulative = δ × SSold−cummulative + (1 − δ) × SSnew−measured,
where δ is adjusted according to network conditions and the current
received signal strength.
 To indicate the relative motion of 2-nodes, 2-symbols are
used:
 “+” : indicates 2-nodes moving away from each other.
 “-” : indicates 2-nodes moving away from each other.
 Each node keeps a routing table of the form <source,
destination, next hop, hop count, available bw, reserved bw,
active, route class, first class link, second class link, third class
link>.
ADQR(3)
 The Route Request contains <source, destination, request
id, hop cnt, QoS metric, route class, int nodes, first class
link, second class link, third class link>.
 Intermediate nodes append their address in int nodes field,
update QoS metric, route class, and hop cnt fields and
forward the Route Request to their neighbors.
 The destination node checks for a disjoint path among
already found paths and route class not “+3” . After that
destination node creates a Route Reply packet, and inserts
the route information into its routing table.
 After receiving Route Reply intermediate nodes
 inserts the route into its local routing table, if no
corresponding route entry exists; or
 updates its routing table, if the route already exists.
ADQR(4)
 When the source node receives multiple routes, the first
route class routes obtain higher priority than the second route
class and the third route class routes and so on.
 After selecting the desired route(s), bandwidth is reserved
by sending a QoS Reserve packet from the source to the
destination along the selected route(s).
 It uses a fast route maintenance scheme, called two-phase
monitored rerouting,:
Pre Rerouting : occurs when the route changes from first
route class to second route class. Source finds alternate paths in
advance, before current path becomes unavailable.
 Rerouting : occurs when the route changes from second
route class to third route class. Source node uses one of these
alternate paths in advance before current path becomes
unavailable
Topics To Be Discussed . . .
Introduction
Quality of Service
QoS Routing
QoS Models
Security Issues in MANETs
Comparison and Simulation
Conclusion
References
Existing QoS Models
 QoS model also specifies the architecture for
providing some kind of services in the network.
 Two Internet QoS Models:
 Integrated Services (IntServ)
 Per-*flow end-to-end guarantee
 Resource reservation by using RSVP.
 Differentiated Services (DiffServ)
Per-class service differentiation
Traffic differentiation and prioritization
 A flow is an application session between a pair of end users.
The flow-specific state should include the information about
bandwidth requirement, delay bound, jitter, cost etc of the flow
Integrated Services
 Uses an explicit mechanism (RSVP) to signal QoS
requirements to network elements to reserve resources.
 3 classes of service:
Guaranteed Service (GS) – provides bounds on end-to-
end delay
Control Load (CL) – provides performance expected
from an unloaded network
Best-Effort (BE) – what you have today.
 It has 4 components :
Signaling Protocol
Admission Control Routine
Classifier
Packet Scheduler
IntServ(2)
 This model is not suitable for MANETs due to the
resource limitation in MANETs:
 Keeping flow state information in each node implies
huge storage and processing overheads depending
upon the number and duration of flows.
 The RSVP signaling packets will consumes a
substantial percentage of bandwidth in MANETs.
 Every mobile host must perform the processing of
admission control, classification, and scheduling. This
place a heavy burden for the resource-limited mobile
hosts.
 In spite of all these constraints, the main idea of the
IntServ approach can be taken and modified to be
supported in MANETs.
Differentiated Services
 DiffServ deals with bulk flows of data rather than
single flows and maps multiple flows into a few
service levels.
 Avoids scalability problems of IntServ, by defining
the layout of the Type Of Service (TOS) bits in the IP
header, called the DS (Differentiated Services) field,
and a base set of packet forwarding rules, called Per-
Hop-Behavior (PHB).
 When a data packet enters a DiffServ-enabled
domain, a boundary router marks the packet’s DS field
in header and the interior routes forward the packet
according to the PHB associated with the DS field.
DiffServ(2)
 Many services are supported in DiffServ model:
 Premium Service: - provides low loss, low delay,
low jitter, and end-to-end assured bandwidth service.
 Assured Service: - is for applications requiring
better reliability than Best Effort Service.
 Olympic Service: - provides 3- tiers of services:
Gold, Silver, Bronze with decreasing quality.
 Supporting premium service is almost
impossible in MANETs because the strict
requirement of Premium Service is not suitable
in the dynamic MANETs environment
MANET QoS Models
• Does not define specific protocols algorithms or
implementations
• Defines methodology and architecture for providing
certain types of service
• Examples
– FQMM (Flexible QoS Model for MANETs)
CEQMM ( Complete and Efficient QoS Model for
MANETs )
Flexible QoS Model for MANETs
Flexible QoS Model for MANETs (FQMM) is the first QoS
Model for Mobile Adhoc Networks .
 Hybrid provisioning policy

Traffic is divided into classes
• IntServ-like per-flow provisioning for the highest
priority class
• DiffServ-like per-aggregate provisioning for the other classes

 The FQMM hybrid model defines three types of nodes:


Ingress: - An Ingress node is a node that sends data.
Interior: - Interior nodes are the nodes that forward data
to other nodes.
Egress: - An egress node is a destination node.
FQMM (2)
Three types of nodes
• ingress node: sender
• interior node: forwarder
• egress node: receiver
Topics To Be Discussed
Introduction
Quality of Service
QoS Routing
QoS Models
Security Issues in MANETs
Comparison and Simulation
Conclusion
References
Security
Security is a critical aspect in the MANET environment, as security
threats and attacks on routing operations can severely disrupt network
operations, degrade network performance, and adversely affect the QoS .
Security Challenges
Shared radio channel and insecure environment
Limited resources
Lack of permanent association
Physical vulnerability
Security Services:
Authentication: correct identity is known to communicating partner.
Confidentiality: protect confidential information from unauthorized user.
Integrity: message being transferred is not corrupted.
Non-repudiation: node that sent a message cannot deny it
Availability: resources should be made available during transmission
Privacy : having the power to control information about yourself.
Security: Attacks on MANETs
2 types of attacks
Passive Attacks: Do not disrupt the operation but
listen valuable information
 Active Attacks: Disrupt operation by injecting
arbitrary packets, limits availability of packets.
 Active Attacks
 Using Modification
 Using Fabrication
 Using Impersonation
 Attacks Using Modification are of 3 types:
 Redirection by changing route request number
Redirection with modified hop count
DoS(Denial osf Service) Attacks with modified source
routes
Attacks Using Fabrication
 Attacks Using Fabrication
Relay attack: An attacker sends old advertisements
to a node causing it to update its routing table with stale
routes.
Black hole: An attacker advertises a zero metric for
all destinations causing all nodes around it to route
packets towards it so that it can modify/fabricate.
Attacks Using Impersonation
 Impersonation attack is one form of identity theft, in
which malicious nodes hide their real IP address or MAC
address and uses another one.
 2 building blocks:
one in which the attacker never exposes his identity
through requests and responses
one in which the attacker initiates some requests and
responses
 It affects the network in 2 ways:
 prevents a victim from receiving traffic from honest
nodes.
 prevents a victim from sending traffic to honest nodes.
Topics To Be Discussed
Introduction
Quality of Service
QoS Routing
QoS Models
Security Issues in MANETs
Comparison and Simulation
Conclusion
References
Comparison Among Routing Protocols
Properties DSDV HSR AODV DSR TORA ZRP WRP

Routing Proactive Proactive Reactive Reactive Reactive Hybrid(Proactiv Proactive


Philosophy e/Reactive)

Loop Free Yes Yes Yes Yes Yes Yes Yes


Routes Single Single Multiple Multiple Multiple Multiple Single
Route Distributed Heir addr. Broad-cast Broad-cast Broad-cast Boadercast Distributed
Computation

Route Selection Distance Link State Shortest Source Link State DistanceVector, Shortest
Vector Path Routing Link State Path

Method Broadcast Multicast Broadcast Multicast Broadcast Multicast Broadcast

Update Neighbor Nodes in Source Source Neighbor Neighbor Neighbor


Destination Cluster

Broadcast Full Limited Full Limited Local Local, Limited Local


Method

Update Distance Virtual Route Route Error Nodes Update Message Distance
Information Vector Link state Error Height vector
Comparison of QoS-aware Routing

Routing QoS Bandwidth Route Resource Route Redunda


Protocol Metric Estimation Discovery Reservation Break nt Paths
Prediction

CEDAR BW No Proactive Yes No Yes

Ticket- BW, No Proactive No No Yes


based Delay
AQOR BW, Yes Reactive Yes No No
Delay
ADQR BW No Reactive Yes Yes Yes
Simulation
 Performance Metrics of Routing Protocols
 packet delivery ratio: Total no of packets
received divide by total no of packets sent.
Routing overhead : Ratio of no. of control
bytes to total no. of bytes transmitted.
Hop count: Average no. of hops that a message
did travel to reach their final destination
End-to-end delay: Average delay time of all
successfully delivered packets.
Simulation(2)
 Experimentation is done in network with 50-1000
nodes.
 Packet delivery ratio introduced by routing
protocols with number of nodes given below
Simulation(3)

Figure: Variation of Routing overhead with number of nodes


Simulation(4)

Figure: Average hop count variation with number of nodes


Simulation(5)

Figure: Average End To End delay introduced by routing protocols with no


of nodes
Conclusion
 Routing is undoubtedly the most studied aspect of ad
hoc networks
 Due to overheads caused by implementing
security in ad hoc networks, security and QoS must
be considered together.
Yet, many issues remain open such as more robust
security solutions, routing protocol scalability, QoS
support, and so on ….
References
[1] Jun-Zhao Sun, “Mobile Ad Hoc Networking: An Essential Technology for Pervasive
Computing”
[2] Shakeel Ahmed, A K Ramani “Exploring the Requirements for QoS in Mobile Ad hoc
Networks”
[3] R. Asokan, A. M. Natarajan “An Approach for Reducing the End-to-end Delay and
Increasing Network Lifetime in Mobile Ad hoc Networks”
[4] Zeinalipour-Yazti Demetrios “A Glance at Quality of Services in Mobile Ad-Hoc
Networks”
[5] Lei Chen “Protocols For Supporting Quality of Services in Mobile ad hoc Networks.”
[6] Tony Larson, Nicklas Hedman “Routing Protocols in Wireless ad-hoc Networks: A
Simulation Study .”
[7] Morteza Maleki, Massoud Pedram “Power-Aware On-Demand Routing Protocols for
Mobile Ad Hoc Networks.”
[8] Elizabeth M.,Royer, C-K Toh “A Review of Current Routing Protocols for Ad-Hoc
Mobile Wireless Networks. ”
[9] Charles E. Perkins, Pravin Bhagwat “Highly Dynamic Destination-Sequenced
Distance-Vector Routing (DSDV) for Mobile Computers.”
[10] Mr. Ankur Khetrapal, “Routing techniques for Mobile Ad Hoc Networks
Classification and Qualitative/Quantitative Analysis.”
[11] Andrew S. Tanenbaum “Computer Networks.”
[12] Forouzan “Data Comunication and Networking”.
[13] Guojun Wang, Jiannong Cao, Lifan Zhang, Keith C. C. Chan “A Novel QoS Multicast
Model in Mobile Ad Hoc Networks.”
[14] Yasser L.Morgan, Thomas Kunz “A Proposal for an Ad-Hoc Network QoS Gateway.”
[15] Shivanajay Marwaha, Jadwiga Indulska, Marius Portmann “Challenges and Recent
Advances in QoS Provisioning, Signalingg,Routing and MAC protocols for MANETs.”
[16] Zhijiang Chang, Georgi Gaydadjiev, Stamatis Vassiliadis “Routing Protocols for
Mobile Ad-hoc Networks: Current Development and Evaluation.”
[17] Shuyao Yu, Youkun Zhang, Chuck Song, Kai Chen “A security architecture for Mobile
Ad Hoc Networks.”
[18] Prasun Sinha, Raghupathy Sivakumar, Vaduvur Bharghavan “CEDAR: a Core-
Extraction Distributed Ad hoc Routing algorithm”
[19] Markus Jakobsson, Susanne Wetzel, B¨ulent Yener “Stealth Attacks on Ad-Hoc
Wireless Networks.”
[20] Kui Wu, Janelle Harms “QoS Support in Mobile Ad Hoc Networks.”
[21] Nityananda Sarma, Sukumar Nandi “QoS Support in Mobile Ad Hoc Networks.”
[22] Josh Broch, David A. Maltz, David B. Johnson, Yih-Chun Hu, Jorjeta Jetcheva “A
Performance Comparison of Multi-hop Wireless Ad Hoc Network Routing Protocols.”
[23] P. Chenna Reddy, Dr. P. Chandrasekhar “Performance Analysis of Ad Hoc Network
Routing Protocols.”
[24] Prasant Mohapatra, Jian Li ,and Chao Gui “ QoS in Mobile Ad Hoc Networks”.
[25] Kui Wu and Janelle Harms “ QoS support in Mobile Ad Hoc Networks”.
THANK YOU

You might also like