UNIT III - MOBILE IP

Introduction to wireless networks – mobile IP - issues in mobile IP-

differences between cellular and ad hoc wireless networks- applications
- routing protocols – Proactive & reactive Routing Protocols.
Introduction to wireless networks
• Guglielmo Marconi invented the wireless telegraph in 1896
• Communication by encoding alphanumeric characters in analog signal
• Sent telegraphic signals across the Atlantic Ocean
• Communications satellites launched in 1960s
• Advances in wireless technology
• Radio, television, mobile telephone, communication satellites
• More recently
• Satellite communications, wireless networking, cellular technology
Broadband Wireless Technology
• Higher data rates obtainable with broadband wireless technology
• Graphics, video, audio
• Shares same advantages of all wireless services: convenience and
reduced cost
• Service can be deployed faster than fixed service
• No cost of cable plant
• Service is mobile, deployed almost anywhere
Limitations and Difficulties of Wireless
Technologies
• Wireless is convenient and less expensive
• Limitations and political and technical difficulties inhibit wireless
technologies
• Lack of an industry-wide standard
• Device limitations
• E.g., small LCD on a mobile telephone can only displaying a few lines of text
• E.g., browsers of most mobile wireless devices use wireless markup language
(WML) instead of HTML
 Mobile IP
Motivation for Mobile IP
• Routing
• based on IP destination address, network prefix (e.g. 129.13.42) determines physical subnet
• change of physical subnet implies change of IP address to have a topological correct address (standard
IP) or needs special entries in the routing tables
• Specific routes to end-systems?
• change of all routing table entries to forward packets to the right destination
• does not scale with the number of mobile hosts and frequent changes in the location, security problems
• Changing the IP-address?
• adjust the host IP address depending on the current location
• almost impossible to find a mobile system, DNS updates take too much time
• TCP connections break, security problems

Wireless Networks Spring 2005

Mobile IP Requirements
• Transparency
• mobile end-systems keep their IP address
• continuation of communication after interruption of link possible
• point of connection to the fixed network can be changed
• Compatibility
• support of the same layer 2 protocols as IP
• no changes to current end-systems and routers required
• mobile end-systems can communicate with fixed systems
• Security
• authentication of all registration messages
• Efficiency and scalability
• only little additional messages to the mobile system required (connection typically via a low bandwidth radio
link)
• world-wide support of a large number of mobile systems in the whole Internet

Wireless Networks Spring 2005

Mobile IP – IP Integration
• What does Mobile IP do?
• Extends IP for mobility not wireless networking
• Mobile IP operates between network and transport layers (i.e. on
top of IP but below TCP/UDP)

• Mobile IP provides two addresses:

• Fixed address for identification (home address)
• Dynamic address for routing (care-of address/foreign
address)
• Benefits:
• Stable address for hosts
• Enables TCP to keep track of session data
• Routing based on fixed source/destination
Terminology
• Mobile Node (MN)
• system (node) that can change the point of connection
to the network without changing its IP address
• Home Agent (HA)
• system in the home network of the MN, typically a router
• registers the location of the MN, tunnels IP datagrams to the COA
• Foreign Agent (FA)
• system in the current foreign network of the MN, typically a router
• forwards the tunneled datagrams to the MN, typically also the default router for
the MN
• Care-of Address (COA)
• address of the current tunnel end-point for the MN (at FA or MN)
• actual location of the MN from an IP point of view
• can be chosen, e.g., via DHCP
• Correspondent Node (CN)
• communication partner

Wireless Networks Spring 2005

Mobile IP in detail …

Combination of 3 separable mechanisms:

•  Discovering the care-of address
•  Registering the care-of address
•  Tunneling to the care-of address
Example network
HA
MN

router

home network mobile end-system

Internet
(physical home network
for the MN)
FA foreign
network
router
(current physical network
for the MN)
CN

end-system router
Wireless Networks Spring 2005
Data transfer to the mobile
HA
2
MN

home network 3 receiver

Internet

FA foreign
network

1. Sender sends to the IP address of MN,

1 HA intercepts packet (proxy ARP)
CN 2. HA tunnels packet to COA, here FA,
by encapsulation
3. FA forwards the packet
sender to the MN

Wireless Networks Spring 2005

Data transfer from the
mobile
HA
1 MN

home network sender

Internet

FA foreign
network

1. Sender sends to the IP address

of the receiver as usual,
CN
FA works as default router

receiver

Wireless Networks Spring 2005

Figure 10.3 Remote host and mobile host configuration

Mobile host
Mobile host
when at home
Home agent Foreign agent after move Remote host

Time Time Time Time Time

TCP/IP Protocol Suite 15
Mobile IP – The
• Three major problems:
Protocols
• Discovery of new point of attachment
• Registration of new location with Home domain
• Delivery of datagrams to registered locations

• Agent Discovery
• Mobility agents advertise availability
• MN solicits agent

• Registration
• Updating the care-of-address with home network

• Tunneling
• Delivery of data to mobile node’s care-of-address, via permanent
home address
Overview COA

router
home router MN
FA
network HA

foreign
Internet network

CN router

3.
home router router
2. MN
network HA FA
4.
foreign
Internet network

1.
CN router

Wireless Networks Spring 2005

Network integration
• Agent Advertisement
• HA and FA periodically send advertisement messages into their physical
subnets
• MN listens to these messages and detects, if it is in the home or a foreign
network (standard case for home network)
• MN reads a COA from the FA advertisement messages
• Registration (always limited lifetime!)
• MN signals COA to the HA via the FA, HA acknowledges via FA to MN
• these actions have to be secured by authentication
• Advertisement
• HA advertises the IP address of the MN (as for fixed systems), i.e. standard
routing information
• routers adjust their entries, these are stable for a longer time (HA responsible
for a MN over a longer period of time)
• packets to the MN are sent to the HA,
• independent of changes in COA/FA

Wireless Networks Spring 2005

1. Agent Discovery
• One initial problem of an MN after moving is how to find a foreign
agent
• How does the MN discover that it has moved?
• Mobile IP describes two methods:
• Agent advertisement
• Agent solicitation

• Agent Advertisement
• Extends the current ICMP (Internet Control Message Protocol – Router
Advertisement)
• HA and FA periodically send advertisement messages into their physical
subnets
• MN listens to these messages and detects, if it is in the home or a
foreign network (standard case for home network)
• MN reads a COA from the FA advertisement messages
Agent Discovery (cont)
• Agent Solicitation
• Alternatively, mobile node may solicit agent (Broadcast or
Multicast)
• Mobile node can now proceed to register
0 7 8 15 16 23 24 31
Agent Advertisement type code checksum
(ICMP – extension) #addresses addr. size lifetime
router address 1
preference level 1
router address 2
preference level 2
...

type = 16 length sequence number

registration lifetime R B H F M G r T reserved
COA 1
COA 2
...
2. Registration
• Mobile Node requests
registration from Foreign
Agent (or directly for co-
located COA)
• Request is forwarded to Home
Agent
• Includes CAO + home
addresses
• Home Agent replies to Foreign
Agent
• Security
• Authentication between all From: Perkins, C.E., “Mobile networking through Mobile IP,” IEEE Internet
Computing, Volume 2,  Issue 1,  Jan.-Feb. 1998 Page(s):58 – 69.
three parties
• Mobile-Home auth. is based
on shared secret
Registration
MN re FA HA MN re HA
gist gist
requ ration requ ration
es t es t
regi
s
requ tration
es t
tion
stra
regi
y
n repl
i s t ratio
reg
repl
y t
n
i s t ra ti o
reg
y
repl

t Co-located COA

Foreign agent COA

 Mobile IP registration request
Figure 10.5 Registration request format
0 7 8 15 16 23 24 31 UDP packet on port 343
type S B D MGV rsv lifetime Type = 1 for registration request
home address S: retain prior mobility bindings
home agent B: forward broadcast packets
COA D: co-located address=> MN decapsulates packets
identification extensions . . .

Figure 10.6 Registration reply format

Wireless Networks Spring 2005
3. Tunneling & Encapsulation
• Communication between an IP node and a Mobile Node
• Delivery of data to mobile node’s COA via permanent home address
• Tunneling is achieved by encapsulation

IP tunnel

Home Agent Foreign Agent

2
1 3
4
(triangular
routing)
IP Host Mobile Node
 Routing/Encapsulation/Tunneling:
consists of the delivery of the packets to
the mobile node at its current care of
address.
 Sender does not need to know
that the destination is a MN.
 HA intercepts all packets for the
MN and passes them along to MN
using a tunnel.
 MN communicates directly with
the CN.
 Referred to as Triangle Routing
original IP header original data

new IP header new data

outer header inner header original data

• Three types of encapsulation protocols are specified for
Mobile IP:
: required to be supported. Full IP
header added to the original IP packet. The new header
contains HA address as source and Care of Address as
destination.

: optional. Requires less overhead

but requires changes to the original header. Destination
address is changed to Care of Address and Source IP address
is maintained as is.

optional. Allows
packets of a different protocol suite to be encapsulated by
another protocol suite.
• Type of tunneling/encapsulation supported is indicated
in registration.
Encapsulation
• Encapsulation of one packet into another as payload
• e.g. IPv6 in IPv4 , Multicast in Unicast
• here: e.g. IP-in-IP-encapsulation
• IP-in-IP-encapsulation (mandatory, RFC 2003)
• tunnel between HA and COA

original IP header original data

new IP header new data

outer header inner header original data

Mobile IP – Encapsulation
• IP-within-IP encapsulation

MobileIP Header
IP Header IP Header

IP Payload IP Payload
Problems with Mobile IP
• Security
• authentication with FA problematic, for the FA typically belongs to another organization
• no protocol for key management and key distribution has been standardized in the Internet
• patent and export restrictions
• Firewalls
• typically mobile IP cannot be used together with firewalls, special set-ups are needed (such as reverse
tunneling)
• QoS
• many new reservations in case of RSVP
• tunneling makes it hard to give a flow of packets a special treatment needed for the QoS
• Security, firewalls, QoS etc. are topics of current research and discussions!

Wireless Networks Spring 2005

Cellular and ad hoc wireless
networks
• Cellular Wireless Networks: infrastructure dependent network
• Ad Hoc Networks: multi-hop radio relaying and without support of
infrastructure
– Wireless Mesh Networks
– Wireless Sensor Networks
Cellular and ad hoc wireless
networks
A BSS without an AP is called an ad hoc network;
a BSS with an AP is called an infrastructure network.
Cellular and ad hoc wireless
networks
Cellular VS Ad hoc wireless networks
Cellular VS Ad hoc wireless networks
Applications
 Routing in
Why Routing?
Mobile Ad hoc Networks
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
Traditional routing
• Distance Vector
algorithms
• periodic exchange of messages with all physical neighbors that
contain information about who can be reached at what distance
• selection of the shortest path if several paths available
• Link State
• periodic notification of all routers about the current state of all
physical links
• router get a complete picture of the network
• Example
• ARPA packet radio network (1973), DV-Routing
• every 7.5s exchange of routing tables including link quality
• updating of tables also by reception of packets
• routing problems solved with limited flooding
Problems of traditional routing
algorithms
• Dynamic of the topology
• frequent changes of connections, connection quality, participants

• Limited performance of mobile systems

• periodic updates of routing tables need energy without contributing to the
transmission of user data, sleep modes difficult to realize
• limited bandwidth of the system is reduced even more due to the exchange of
routing information
• links can be asymmetric, i.e., they can have a direction dependent
transmission quality (TCP RTT)
Ad Hoc Routing Protocols Overview

Ad hoc Routing Protocols

Table Driven Hybrid Source-Initiated

(Proactive) On-demand Driven
(Reactive)
ZRP

CGSR DSDV WRP

AODV DSR TORA ABR SSR
Proactive vs. Reactive Routing Protocols

• Proactive Protocols (table driven)

• Maintain routing information in the routing table
• – Routing information is flooded in the whole network
• – Runs path-finding algorithm with the routing table
• have lower latency due to maintenance of routes at all times
• can result in much higher overhead due to frequent route updates

• Reactive Protocols (on demand) may have

• Unlike the table-driven routing protocols, on-demand
routing protocols execute the path-finding process and exchange routing
information only when a path is required by a node to communicate with a
destination.
• Obtain the necessary path while required
Destination-Sequenced Distance-Vector Routing (DSDV)

Full dump
Carries all available routing info and can require multiple network protocol
data units. Infrequently transmitted while there is not much movement.
Incremental packets
These smaller packets are for relaying only the information that was updated
since the last full dump

– New route broadcasts: destination address + the # of hops to get to

destination + the sequence # of the information received about the
destination + new sequence # unique to the broadcast at hand
– The route with the most recent sequence # (in increasing order) is always
used
 Destination-Sequenced Distance-Vector Routing (DSDV)

– If there is an occurrence of two updates with the same sequence # ,

the route with the smaller hop count is used in order to obtain
optimized (shorter) path
– Mobiles keep track of other metrics such as settling time of routes,
or the weighted average time
– The broadcast of a routing update is delayed by the settling time
in order to reduce network traffic, as well as optimizing routes
 Dynamic Source Routing (DSR)
[Johnson+ 1996]

• When node S wants to send a packet to node D, but does not know a
route to D, node S initiates a route discovery

• Source node S floods Route Request (RREQ)

• Each node appends own identifier when forwarding RREQ

© 2001 Nitin Vaidya

Route Discovery in DSR
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

© 2001 Nitin Vaidya

Route Discovery in DSR
Broadcast transmission Y

[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

© 2001 Nitin Vaidya

Route Discovery in DSR
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

© 2001 Nitin Vaidya

Route Discovery in DSR
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

© 2001 Nitin Vaidya

Route Discovery in DSR
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

© 2001 Nitin Vaidya

Route Discovery in DSR
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

© 2001 Nitin Vaidya

Route Discovery in DSR

• 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

© 2001 Nitin Vaidya

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

© 2001 Nitin Vaidya

 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.

• If IEEE 802.11 MAC is used to send data, then links have to be bi-directional (since
Ack is used)

© 2001 Nitin Vaidya

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

© 2001 Nitin Vaidya

Data Delivery in DSR
Y

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

© 2001 Nitin Vaidya

Route Error (RERR) Y

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

Nodes hearing RERR update their route cache to remove link J-D

© 2001 Nitin Vaidya