WN

Wireless Networks
Unit II
Mobile Network Layer
Dr.T.V.Padmavathy
Professor
Department of ECE
RMKEC
Introduction - Which Technology
12/23/2016
Unit - II Mobile Network Layer
Introduction - Which Technology ?
Cellular Technologies
Wireless LAN Technology
Short range Technologies
Long Range Technologies
12/23/2016
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
12/23/2016
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
12/23/2016
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
12/23/2016
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
12/23/2016
Problems in Infrastructure based & Ad Hoc

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!!
12/23/2016
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
12/23/2016
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
12/23/2016
10
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
homes, environmental applications
12/23/2016
11
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
rapidly deployable wireless infrastructure
largely immobile nodes
12/23/2016
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
12/23/2016
13
Ad hoc Network Architecture
application
application
application
transport
transport
transport
network
network
network
Data link
Data link
Data link
physical
physical
physical
S
Source
12/23/2016
wireless link
wireless link
Intermediate node
D
Destination
14
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
12/23/2016
15
Routing Classification
Ad hoc Routing
Protocols
Topology Based
Table Driven
12/23/2016
Hybrid
Position Based
Source Initiated On-Demand

Driven
Location
Services
Forwarding
Strategy
16
Ad Hoc Routing Protocols Overview
Ad hoc Routing
Protocols
Topology Based
Table Driven
CGSR DSDV WRP
12/23/2016
Position Based
Source Initiated On-Demand

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

MANET networks ?
Hidden Terminal Problem
Exposed node problem
12/23/2016
18
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
Adaptive; Combination of proactive and reactive
12/23/2016
19
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)
12/23/2016
20
Reactive Routing Protocols
12/23/2016
21
Characteristics of Reactive Routing Protocols

Determine route if and when needed
Less control packet overhead
Source initiates route discovery process
More route discovery delay
Example:
Dynamic Source Routing (DSR)
Ad hoc On-Demand Distance Vector Routing (AODV)
12/23/2016
22
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
12/23/2016
23
Route Discovery in DSR
E
F
G
H
Represents a node that has received RREQ for D from S
12/23/2016
24

Broadcast transmission
[S]
[S]
[S]
F
C
G
H
Represents transmission of RREQ
[X,Y]
12/23/2016
Represents list of identifiers appended to RREQ

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

12/23/2016
26
E
F
[S,E,F]
G
H
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

12/23/2016
27
E
[S,E,F,J]
J
A
G
H
D
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
12/23/2016
28
[S,E,F,J,M]
G
H
K
I
D
N
Node D does not forward RREQ, because node D is the intended target of the
route discovery
12/23/2016
29
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
12/23/2016
30
Route Reply in DSR
RREP [S,E,F,J,D]
F
G
H
K
I
D
N
Represents RREP control message

12/23/2016
31
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.
12/23/2016
32
Dynamic Source Routing (DSR)
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
12/23/2016
33
Data Delivery in DSR
DATA [S,E,F,J,D]
S
E
F
G
H
K
I
D
N
Packet header size grows with route length

12/23/2016
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
DATA [S,E,F,J,D]
S
E
F
B
C
M L
J
G
H
D
K
I
N
S
When node F forwards Route Reply
RREP [S,E,F,J,D], node F learns
route [F,J,D] to node D
12/23/2016
35
DSR Optimization: Route Caching
When
node
forwards
Data
[S,E,F,J,D] it learns route [E,F,J,D]
DATA [S,E,F,J,D]
to node D
A node may also learn a route

when it overhears Data packets
E
F
C
G
H
I
12/23/2016
J
K
D
N
36
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
12/23/2016
37
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
12/23/2016
38
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
12/23/2016
39
Proactive Routing Protocols
12/23/2016
40
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)
12/23/2016
41
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
12/23/2016
42
Distance Vector (Tables)

A
B
C
A
D
E
12/23/2016
43
Routing Tables
information, routing table at A
is -->
B
C
Cost
Next Hop
D
E
12/23/2016
44
Evolution of the Table
Cost
Next Hop
B
C
A
D
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.
12/23/2016
45
Final Distance Matrix
B
C
A
D
E
12/23/2016
46
Distance-Vector (Disadvantages)
Link 4
Link 2
Link 1
Link 6
Link 3
Link 5
Destination
Link
Hop
Link 4
Link 4
Link 4
Local
Link 6
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.
12/23/2016
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
Broken
Link 1
Broken
broken.
It sets the distance to nodes C, D
Link 6
B
Link 3
Link 5
and E to be infinity.
Link 4
Node B thinks it can route
Network partitions into two

isolated islands
packets to C, D, and E via Node

A.
12/23/2016
48
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
12/23/2016
49
Destination Sequenced Distance Vector Routing (DSDV)

[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
12/23/2016
50

Protocol Overview
Route Advertisements
Routing Table Entry Structure
12/23/2016
51
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
12/23/2016
52
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)
12/23/2016
53
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
=
12/23/2016
54
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.
12/23/2016
55
Example of DSDV in operation
MH3
MH4
MH2
MH5
MH8
MH6
MH7
MH1
12/23/2016
Destination
Next Hop
MH4
MH1
MH2
MH3
MH5
MH6
MH7
MH8
MH4
MH2
MH2
MH2
MH6
MH6
MH6
MH6
Metric
0
2
1
2
2
1
2
3
Seq. No
S406_MH4
S128_MH1
S564_MH2
S710_MH3
S392_MH5
S076_MH6
S128_MH7
S050_MH8
56
DSDV (Disadvantages)
Node As update is state
Link 4
Broken
Sequence number indicated for nodesLink 1

C,D, and E is lower than the sequence
number maintained at B.
Link 2
Broken
B
Link 3
Link 5
Looping avoided
E
Network partitions into two
isolated islands
12/23/2016
57
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
12/23/2016
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
12/23/2016
59
Thank You
12/23/2016
60

WN

Hochgeladen von

Dokumentinformationen

Originaltitel

Copyright

Verfügbare Formate

Dieses Dokument teilen

Dokument teilen oder einbetten

Freigabeoptionen

Stufen Sie dieses Dokument als nützlich ein?

Sind diese Inhalte unangemessen?

Copyright:

Verfügbare Formate

WN

Hochgeladen von

Copyright:

Verfügbare Formate

Wireless Networks

Introduction - Which Technology

Unit - II Mobile Network Layer

Introduction - Which Technology ?

Unit - II Mobile Network Layer

Packet Radio NETwork (PRNET) by DARPA -1972

MANET- IETF -1990s

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

Personal area networking

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

Collection of mobile nodes forming a temporary 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

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

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

because node C has already forwarded RREQ