Wireless Networks

Wireless
WirelessNetworks
Networks
Unit
UnitIIII
Mobile
MobileNetwork
NetworkLayer
Layer
Dr.T.V.Padmavathy
Dr.T.V.Padmavathy
Professor
Professor
Department
of ECE
Department
RMKEC of ECE
RMKEC
Introduction - Which Technology
1/3/17
Unit - II Mobile Network Layer
Introduction - Which Technology ?

Introduction - Which Technology ?
Cellular Technologies
Wireless LAN Technology
Short range Technologies
Long Range Technologies
1/3/17
History
History
Packet Radio NETwork (PRNET) by DARPA -1972
Survivable Packet Radio Networks (SURAN) 1980s
MANET- IETF -1990s
IEEE released 802.11 PHY and MAC standard 1995
1/3/17
Introduction
Introduction
In this protocols and mechanisms to support mobility.
Allows transparent routing of IP datagrams to mobile nodes
Mobile IP Adds mobility support to the internet
1/3/17
Why an Ad Hoc Networks ?

Why an Ad Hoc Networks ?
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:
Does not depend on pre-existing infrastructure
Easy to deploy
Useful when infrastructure is absent
1/3/17
Problems in Infrastructure based & Ad Hoc

Infrastructure based Network
Access Point placement depends on wired network availability
Obstructions make it difficult to provide total coverage of an area
Each Access Point has limited range
Ad Hoc Network
Communication is only possible between nodes which are directly in
range of each other
1/3/17

If nodes move out of range of the access point (Infrastructure Mode)
OR nodes are not in direct range of each other (Ad Hoc Mode)
Then communication is not possible!!
1/3/17
Mobile Ad hoc Network Example

Mobile Ad hoc Network Example
Communication between nodes may be in single/multi-hop

Each of the nodes acts as a host as well as a router
1/3/17
Challenges in Mobile Environments

Challenges in Mobile Environments
Limitations of the Wireless Network
packet loss due to transmission errors - transport problem
frequent disconnections/partitions
limited communication bandwidth
Limitations Imposed by Mobility
dynamically changing topologies/routes - routing problem
short battery lifetime - energy efficiency problem
limited capacities
1/3/17
10
Typical Applications
Typical Applications
Military environments
soldiers, tanks, planes
Emergency operations
search-and-rescue
Personal area
networking
cell phone, laptop, etc.
Civilian environments
meeting rooms, sports
stadiums, hospitals
Education
virtual classrooms,
conferences
Sensor networks
1/3/17
11
Classes of Wireless Ad Hoc Networks

Classes of Wireless Ad Hoc Networks
Three distinct classes
Mobile Ad Hoc Networks (MANET)
possibly highly mobile nodes
power constrained
Wireless Ad Hoc Sensor/Device Networks
relatively immobile
severely power constrained nodes
Wireless Ad Hoc Backbone Networks
1/3/17
rapidly deployable wireless infrastructure
largely immobile nodes
12
Characteristics of an Ad-hoc Network

Collection of mobile nodes forming a temporary network
Network topology changes frequently and unpredictably
No centralized administration or standard support services
Host is also function as router
1/3/17
13
Ad hoc Network Architecture

Ad hoc Network Architecture
application
application
application
transport
transport
transport
network
network
network
Data link
Data link
Data link
physical
physical
physical
S wireless link
Source
1/3/17
wireless link
Intermediate node
Destination
14
Why Routing?
Why Routing?
Common objective:
Route packets along the optimal path
Routing protocols adapt to changing network conditions and by
definition offers multi-hop paths
Routing protocols differ in route table
construction
maintenance
update
Next-hop routing protocols can be categorized as:
Link-state
Distance-vector
1/3/17
15
Routing Classification
Routing Classification
Ad hoc Routing
Ad
hoc Routing
Protocols
Protocols
Topology Based
Topology Based
Table Driven
Table Driven
1/3/17
Hybrid
Hybrid
Position Based
Position Based
Source Initiated On-Demand

Driven
Location
Location
Services
Services
16
Forwarding
Forwarding
Strategy
Strategy
Ad Hoc Routing Protocols Overview

Ad Hoc Routing Protocols Overview
Ad hoc Routing
Ad
hoc Routing
Protocols
Protocols
Topology Based
Topology Based
Table Driven
Table Driven
CGSR DSDV WRP
1/3/17
Hybrid
Hybrid
Position Based
Position Based
Source Initiated On-Demand

Driven
ZRP AODV
DSR
TORA
ABR
Location
Location
Services
Services
SSR
17
Forwarding
Forwarding
Strategy
Strategy
Why traditional routing protocols are not suitable for

Why traditional routing protocols are not suitable for
MANET networks ?
MANET networks ?
Hidden Terminal Problem
Exposed node problem
1/3/17
18
Routing Protocols
Routing Protocols
Proactive Protocols
Determine routes independent of traffic pattern
Traditional (link-state, distance-vector) routing protocols are proactive

Reactive Protocols
Determine a route only if needed

Hybrid protocols
1/3/17
Adaptive; Combination of proactive and reactive
19
Protocol Trade-offs
Protocol Trade-offs
Proactive protocols
Always maintain routes
Little or no delay for route determination
Consume bandwidth to keep routes up-to-date
Maintain routes which may never be used
Reactive protocols
Lower overhead since routes are determined on demand
Significant delay in route determination
Employ flooding (global search)
1/3/17
20
Reactive Routing Protocols

Reactive Routing Protocols
1/3/17
21
Characteristics of Reactive Routing Protocols

Characteristics of Reactive Routing Protocols
Determine route if and when needed
Determine route if and when needed
Less control packet overhead
Less control packet overhead
Source initiates route discovery process
Source initiates route discovery process
More route discovery delay
More route discovery delay
Example:
Example:
Dynamic Source Routing (DSR)
Ad hoc On-Demand Distance Vector Routing (AODV)
Ad hoc On-Demand Distance Vector Routing (AODV)
1/3/17
22
Dynamic Source Routing (DSR) [Johnson96]

Dynamic Source Routing (DSR) [Johnson96]
Two major phases:
Route Discovery,
Route Maintenance.
Node S initiates a route discovery
Source node S floods Route Request (RREQ)
Each node appends own identifier when forwarding RREQ
1/3/17
23
Route Discovery in DSR

S
B
A
B
C
A
H
E
F
J
G
G
H
I
M
M
J
D
D
N
Represents a node that has received RREQ for D from S
1/3/17
24

Broadcast transmission
[S]
[S]
[S]
B
A
A
H
F
J
G
G
H
I
M
M
J
D
D
N
Represents transmission of RREQ
[X,Y]
1/3/17
Represents list of identifiers appended to RREQ

25

S
[S,B]
[S,E]
B
[S,B]
[S,C]
[S,C]
H
I
M
M
J
D
D
N
Node H receives packet RREQ from two neighbors: Potential Collision

1/3/17
26

E
F
M
M
A
I
[S,C,G]
D
N
Node C receives RREQ from G and H, but does not forward it again,
because node C has already forwarded RREQ
1/3/17
G
H
[S,E,F]
27

E
[S,E,F,J]
G
H
K
I
[S,C,G,K]
Nodes J and K both broadcast RREQ to node D

Since nodes J and K are hidden from each other, their transmissions may
collide
1/3/17
28

[S,E,F,J,M]
G
H
K
I
Node D does not forward RREQ, because node D is the intended target of the
route discovery
1/3/17
29

Destination D on receiving the first RREQ, sends a Route Reply
Destination D on receiving the first RREQ, sends a Route Reply
(RREP)
(RREP)
RREP is sent on a route obtained by reversing the route appended
RREP is sent on a route obtained by reversing the route appended
to received RREQ
to received RREQ
RREP includes the route from S to D on which RREQ was received
RREP includes the route from S to D on which RREQ was received
by node D
by node D
1/3/17
30
Route Reply in DSR

Route Reply in DSR
RREP [S,E,F,J,D]
F
G
H
K
I
Represents RREP control message

1/3/17
31
Route Reply in DSR

Route Reply in DSR
Route Reply can be sent by reversing the route in Route Request
(RREQ) only if links are guaranteed to be bi-directional
To ensure this, RREQ should be forwarded only if it received on a
link that is known to be bi-directional
If unidirectional (asymmetric) links are allowed, then RREP may

need a route discovery for S from node D
Unless node D already knows a route to node S
If a route discovery is initiated by D for a route to S, then the Route
Reply is piggybacked on the Route Request from D.
1/3/17
32

Node S on receiving RREP, caches the route included in the RREP
When node S sends a data packet to D, the entire route is included
in the packet header
hence the name source routing
Intermediate nodes use the source route included in a packet to
determine to whom a packet should be forwarded
1/3/17
33
Data Delivery in DSR

Data Delivery in DSR
DATA [S,E,F,J,D]
S
E
F
G
H
K
I
Packet header size grows with route length

1/3/17
34
DSR Optimization: Route Caching

Each node caches a new route
When node S finds route [S,E,F,J,D]
to node D, node S also learns route
[S,E,F] to node F
When
node
receives
Route
Request [S,C,G] destined for node, A

node K learns route [K,G,C,S] to node
S
DATA [S,E,F,J,D]
S
E
F
B
C
J
G
H
K
I
When node F forwards Route Reply

RREP [S,E,F,J,D], node F learns
route [F,J,D] to node D
1/3/17
35
D
N

When
node
forwards
Data
[S,E,F,J,D] it learns route [E,F,J,D]

to node D
A node may also learn a route

when it overhears Data packets
B
A
DATA [S,E,F,J,D]
C
G
1/3/17
M
D
N
36
L
N
Use of Route Caching

Use of Route Caching
When node S learns that a route to node D is broken, it uses another

route from its local cache
Use of route cache
can speed up route discovery
can reduce propagation of route requests
1/3/17
37
Dynamic Source Routing: Advantages

Dynamic Source Routing: Advantages
Routes maintained only between nodes who need to communicate

reduces overhead of route maintenance
Route caching can further reduce route discovery overhead
A single route discovery may yield many routes to the destination,
due to intermediate nodes replying from local caches
1/3/17
38
Dynamic Source Routing: Disadvantages

Dynamic Source Routing: Disadvantages
Packet header size grows
Flood of route requests may potentially reach all nodes in the
network
Potential
collisions
between
route
requests
propagated
by
neighboring nodes
insertion of random delays before forwarding RREQ
Increased contention if too many route replies come back due to
nodes replying using their local cache
Route Reply Storm problem
1/3/17
39
Proactive Routing Protocols

Proactive Routing Protocols
1/3/17
40
Characteristics of Proactive Routing Protocols

Characteristics of Proactive Routing Protocols
Distributed, shortest-path protocols
Maintain routes between every host pair at all times
Based on Periodic updates of routing table
High routing overhead and consumes more bandwidth
Example: Destination Sequence Distance Vector (DSDV)
1/3/17
41
Distance-Vector [Ford+ 1962]

Distance-Vector [Ford+ 1962]
known also as Distributed Bellman-Ford or RIP (Routing Information
Protocol)
The Meaning of Distance Vector:
A router using distance vector routing protocols knows 2 things:
Distance to final destination
Vector, or direction, traffic should be directed
Every node maintains a routing table
all available destinations
the next node to reach to destination
the number of hops to reach the destination
Periodically send table to all neighbors to maintain topology
1/3/17
42
Distance Vector (Tables)

Distance Vector (Tables)
A
B
C
D
E
1/3/17
43
Routing Tables
Routing Tables
information, routing table at A
is -->
B
C
D
E
1/3/17
Cost
Next Hop
44
Evolution of the Table

Evolution of the Table
Cost
Next Hop
B
C
D
E
Each node sends a message to neighbors with a list of distances.

F --> A with G is at a distance 1
C --> A with D at distance 1.
1/3/17
45
Final Distance Matrix

Final Distance Matrix
B
C
D
E
1/3/17
46
Distance-Vector (Disadvantages)
A
A
Link 2
Link 4
C
C
Link 1
B
B
D
D
Destination
Link
Hop
Link 4
Link 4
Link 4
Local
Link 6
Link 6
Link 3
Link 5
Initially nothing in routing table.

When it receives an update from C and E, it notes that these nodes
are one hop away.
Subsequent route updates allow D to form its routing table.
1/3/17
47
Link 2 is broken, Node A routes
packets to C, D, and E through
Node B.
Node B detects that Link 3 is
Link 2
Link 1
broken.
Broken
C
Broken
It sets the distance to nodes C, D
Link 5
Link 3
Node B thinks it can route

packets to C, D, and E via Node
Network partitions into two

isolated islands
A.
1/3/17
48
Link 6
and E to be infinity.
Link 4
Node A thinks it can route packets to C, D, and E, via Node B.
A routing loop is formed Counting to Infinity problem.
New Solution -> DSDV Protocol
1/3/17
49
Destination Sequenced Distance Vector Routing (DSDV)

[Perkins+ 1994]
[Perkins+ 1994]
Basic Routing Protocol
Based on Bellman ford routing algorithm with some improvement
Each node maintains a list of all destinations and number of hops

to each destination.
Each entry is marked with a sequence number.
Periodically send table to all neighbors to maintain topology
1/3/17
50

Protocol Overview
Route Advertisements
Routing Table Entry Structure
1/3/17
51
Protocol Overview
Protocol Overview
Each Routing Table List all destinations and number of hops to each
node
Each Route is tagged with a sequence number originated by
destination
Updates are transmitted periodically and when there is any
significant topology change
Routing information is transmitted by broadcast
1/3/17
52
Route Table Entry Structure

Route Table Entry Structure
Destinations Address
Number of hops required to reach the destination
Destination Sequence Number
Sequence
number
originated
from
destination.
Ensures
loop freeness.
Install Time when entry was made (used to delete stale entries from
table)
1/3/17
53
DSDV (Route Advertisements)

DSDV (Route Advertisements)
Advertise to each neighbor own routing information
Destination Address
Metric = Number of Hops to Destination
Destination Sequence Number
Rules to set sequence number information
On each advertisement increase own destination sequence
number (use only even numbers)
If a node is no more reachable (timeout) increase sequence
number of this node by 1 (odd sequence number) and set metric
=
1/3/17
54
DSDV (Route Selection)

DSDV (Route Selection)
Update information is compared to own routing table
Select route with higher destination sequence number (This
ensure to use always newest information from destination)
Select the route with better metric when sequence numbers are
equal.
1/3/17
55
Example of DSDV in operation

Example of DSDV in operation
MH3
MH4
MH2
MH5
MH8
MH6
MH7
MH1
1/3/17
Destination
Next Hop
MH4
Metric
0
MH4
S406_MH4
MH1
MH2
S128_MH1
MH2
MH2
S564_MH2
MH3
MH2
S710_MH3
MH5
MH6
S392_MH5
MH6
MH6
S076_MH6
MH7
MH6
S128_MH7
MH8
MH6
S050_MH8
56
Seq. No
DSDV (Disadvantages)
DSDV (Disadvantages)
Node As update is state
Sequence number indicated for nodesLink 1

C,D, and E is lower than the sequence
number maintained at B.
Link 2
Broken
Broken
Looping avoided
Link 3
Link 5
E
Network partitions into two
isolated islands
1/3/17
Link 4
57
Responding to Topology Changes

Responding to Topology Changes
Broken links indicated by
Any route through a hop with a broken link is also assigned
routes are immediately broadcast
Sequence number of Destination is incremented and information is
broadcast
Nodes with same or higher sequence number broadcast their metric
information
Data broadcast by full dump and incremental
1/3/17
58

Advantages
Simple (almost like Distance Vector)
Loop free through destination seq. numbers
No latency caused by route discovery
Disadvantages
Overhead: most routing information never used
1/3/17
59
Thank
You
Thank You
1/3/17
60

Wireless Networks

Uploaded by

Document Information

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Wireless Networks

Uploaded by

Copyright:

Available Formats

Wireless

Introduction - Which Technology

Unit - II Mobile Network Layer

Introduction - Which Technology ?

Unit - II Mobile Network Layer

Unit - II Mobile Network Layer

Unit - II Mobile Network Layer

Why an Ad Hoc Networks ?

Unit - II Mobile Network Layer

Problems in Infrastructure based & Ad Hoc

Unit - II Mobile Network Layer

Problems in Infrastructure based & Ad Hoc

Unit - II Mobile Network Layer

Mobile Ad hoc Network Example

Communication between nodes may be in single/multi-hop

Unit - II Mobile Network Layer

Challenges in Mobile Environments

Unit - II Mobile Network Layer

Classes of Wireless Ad Hoc Networks

rapidly deployable wireless infrastructure

largely immobile nodes

Unit - II Mobile Network Layer

Characteristics of an Ad-hoc Network

Unit - II Mobile Network Layer

Ad hoc Network Architecture

Unit - II Mobile Network Layer

Unit - II Mobile Network Layer

Source Initiated On-Demand

Unit - II Mobile Network Layer

Ad Hoc Routing Protocols Overview

CGSR DSDV WRP

Source Initiated On-Demand

Unit - II Mobile Network Layer

Why traditional routing protocols are not suitable for

Unit - II Mobile Network Layer

Determine routes independent of traffic pattern

Traditional (link-state, distance-vector) routing protocols are proactive

Determine a route only if needed

Adaptive; Combination of proactive and reactive

Unit - II Mobile Network Layer

Unit - II Mobile Network Layer

Reactive Routing Protocols

Unit - II Mobile Network Layer

Characteristics of Reactive Routing Protocols

Unit - II Mobile Network Layer

Dynamic Source Routing (DSR) [Johnson96]

Unit - II Mobile Network Layer

Route Discovery in DSR

Represents a node that has received RREQ for D from S

Unit - II Mobile Network Layer

Route Discovery in DSR

Represents transmission of RREQ

Represents list of identifiers appended to RREQ

Route Discovery in DSR

Node H receives packet RREQ from two neighbors: Potential Collision

Unit - II Mobile Network Layer

Route Discovery in DSR

Unit - II Mobile Network Layer

Route Discovery in DSR

Nodes J and K both broadcast RREQ to node D

Unit - II Mobile Network Layer

Route Discovery in DSR

Unit - II Mobile Network Layer