Professional Documents
Culture Documents
Mants
Mants
MOBILE IP
DR. KULOTHUGAN.K,ASST. PROF
ANNA UNIVERSITY , CHENNAI-25
COMPUTERS FOR THE NEXT DECADES?
• Advances in technology
• more computing power in smaller devices
• flat, lightweight displays with low power consumption
• new user interfaces due to small dimensions
• more bandwidth per cubic meter
• multiple wireless interfaces: wireless LANs, wireless WANs, regional wireless
telecommunication networks etc. („overlay networks“)
• Vehicles
• transmission of news, road condition, weather, music via DAB/DVB-T
• personal communication using GSM/UMTS/LTE
• position via GPS
• local ad-hoc network with vehicles close-by to prevent accidents, guidance
system, redundancy
• vehicle data (e.g., from busses, high-speed trains) can be transmitted in
advance for maintenance
• Emergencies
• early transmission of patient data to the hospital, current status, first
diagnosis
• replacement of a fixed infrastructure in case of earthquakes, hurricanes, fire
etc.
• crisis, war, ...
UMTS, WLAN,
DAB, DVB, GSM, c
ho
cdma2000, TETRA, ... ad
UMTS
2 Mbit/s
• Traveling salesmen
• direct access to customer files stored in a central location
• consistent databases for all agents
• mobile office
• Replacement of fixed networks
• remote sensors, e.g., weather, earth activities
• flexibility for trade shows
• LANs in historic buildings
• Entertainment, education, ...
• outdoor Internet access
• intelligent travel guide with up-to-date
location dependent information History
Smartphone
• tiny keyboard
Mobile phones • simple versions
• voice, data of standard applications
• simple graphical displays
• performance
• Power consumption
• limited computing power, low quality displays, small disks due to limited
battery capacity
• CPU: power consumption ~ CV2f
• C: internal capacity, reduced by integration
• V: supply voltage, can be reduced to a certain limit
• f: clock frequency, can be reduced temporally
• Loss of data
• higher probability, has to be included in advance into the design (e.g.,
defects, theft)
• Limited user interfaces
• compromise between size of fingers and portability
• integration of character/voice recognition, abstract symbols
• Limited memory (always in relation to e.g. PCs)
• limited usage of mass memories with moving parts
• flash-memory or ? as alternative
Application Application
Transport Transport
Radio Medium
service location
Application layer new/adaptive applications
multimedia
congestion/flow control
Transport layer quality of service
media access/control
Data link layer multiplexing
encryption
modulation
interference
Physical layer attenuation
frequency
• 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
• 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 of the
MN
MIPv4 MIPv6
MN FA HA CN MN FA HA CN
MIPv4 MIPv6
MN FA HA CN MN FA HA CN
• Example network
HA
MN
router
home network
Internet
(physical home network
for the MN)
FA foreign
network
router
(current physical network
for the MN)
CN
end-system router
05/08/24 Mobile Network Layer 37
MOBILE IP
HA
2 MN
HA
1 MN
FA foreign
network
• Change of FA
• Packets on-the-fly during the change can be lost
• new FA informs old FA to avoid packet loss, old FA forwards remaining packets to
new FA
• this information also enables the old FA to release resources for the MN
CN HA FAold FAnew MN
request
update
ACK
data data
MN changes
registration registration location
update
data ACK
data data
warning
update
ACK
data
data
t
05/08/24 Mobile Network Layer 42
MOBILE IP
Reverse tunneling:
HA
2
MN
FA foreign
network
1. MN sends to FA
3 2. FA tunnels packets to HA
CN by encapsulation
3. HA forwards the packet to the
receiver (standard case)
05/08/24 receiver Mobile Network Layer 43
MOBILE IP
05/08/24
Mobile Network Layer 45
[modified from Ericsson Tech. Rep. 11/0362-FCB, Dec
ROUTE OPTIMIZATIONS
• 4 types of messages
• Binding update
• Binding request
• Binding warning
• Binding acknowledge
Home Agent
BU BW
BR
BA
Corresponding Host Foreign Agent
BW
Mobile Host
• Mobile IP was developed for IPv4, but IPv6 simplifies the protocols
• security is integrated and not an add-on, authentication of registration is included
• COA can be assigned via auto-configuration (DHCPv6 is one candidate), every
node has address autoconfiguration
• no need for a separate FA, all routers perform router advertisement which can be
used instead of the special agent advertisement; addresses are always co-located
• MN can signal a sender directly the COA, sending via HA not needed in this case
(automatic path optimization)
• „soft“ hand-over, i.e. without packet loss, between two subnets is supported
• MN sends the new COA to its old router
• the old router encapsulates all incoming packets for the MN and forwards them to the new
COA
• authentication is always granted
• 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!
• Micro-mobility support:
• Efficient local handover inside a foreign domain
without involving a home agent
• Reduces control traffic on backbone
• Especially needed in case of route optimization
• Example approaches:
• Cellular IP
• HAWAII
• Hierarchical Mobile IP (HMIP)
• Important criteria:
Security Efficiency, Scalability, Transparency, Manageability
05/08/24 Mobile Network Layer 55
DHCP
DYNAMIC HOST CONFIGURATION PROTOCOL
DHCPDISCOVER
DHCPDISCOVER
server client
client relay
selection of configuration
DHCPREQUEST DHCPREQUEST
confirmation of
(reject) (options)
configuration
DHCPACK
initialization completed
release
DHCPRELEASE delete context
05/08/24 Mobile Network Layer 58
DHCP CHARACTERISTICS
• Server
• several servers can be configured for DHCP, coordination not yet
standardized (i.e., manual configuration)
• Renewal of configurations
• IP addresses have to be requested periodically, simplified protocol
• Options
• available for routers, subnet mask, NTP (network time protocol)
timeserver, SLP (service location protocol) directory, DNS (domain
name system)
• Challenges
• Design Goals Specified by MANET (for now…)
• Types of Routing
• Protocols in Detail
A B C
05/08/24 Mobile Network Layer 62
SOLUTION: WIRELESS AD-HOC NETWORKS
• Examples
• Single-hop: All partners max. one hop apart
• Bluetooth piconet, PDAs in a room,
gaming devices…
• Multi-hop: Cover larger distances,
circumvent obstacles
• Bluetooth scatternet, TETRA police network,
car-to-car networks…
Mobile
Router
Manet
Mobile
Devices
Mobile IP,
DHCP
Fixed
Network
Router End system
N4 N4
N5 N5
time = t1 time = t2
good link
weak link
• Distance Vector
• 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
• Reasons
• Classical approaches from fixed networks fail
• Very slow convergence, large overhead
• High dynamicity, low bandwidth, low computing power
• Dynamic Topologies
• Bandwidth-constrained, variable capacity links
• Energy-constrained
• Limited Physical security
• Scalability
7
5
Source 1
3
8 Destination
6
4
7
5
Source 1
3
8 Destination
6
4
2 <1,2>
<1>
7 <1,3,5,7>
<1,3> 5
<1,3,5>
<1>
Source 1
3
8 Destination
<1>
<1,4,6>
6
4
<1,4>
7
5
Source 1 Destination
3
8
<1,4,6>
<1,4,6>
6
4
<1,4,6>
Internet
Base station Cluster head
Cluster
Super cluster
05/08/24 Mobile Network Layer 89
THE ZONE ROUTING PROTOCOL (ZRP)
• Hybrid Scheme
• Proactively maintains routes within a local region (routing
zone)
• Also a globally reactive route query/reply mechanism
available
• Consists of 3 separate protocols
• Protocols patented by Cornell University!
• Things in common:
• IP based operation
• Distributed operation
• Loop-free routing
• Very little or no support for sleep period operation and security
Source No No Yes No
Routing
• Network Size
• Connectivity (average degree of a node)
• Topology rate of change
• Link capacity (bps)
• Fraction of unidirectional links
• Traffic patterns
• Mobility
• Fraction/frequency of sleeping nodes
• Distributed operation
• Loop freedom
• Demand-based operation
• Proactive operation
• Security
• “Sleep” period operation
• Unidirectional link support
• Introduction
• Applications
• Post-office analogy
• Registration and Tunneling
• Mobile IP Optimizations
• DHCP
• Ad hoc routing protocols
• DSR, AODV, DSDV & ZRP
• Network perfomances
• Discover a path
• only if a path for sending packets to a certain destination is needed and
no path is currently available
• Maintaining a path
• only while the path is in use one has to make sure that it can be used
continuously
• Path discovery
• broadcast a packet with destination address and unique ID
• if a station receives a broadcast packet
• if the station is the receiver (i.e., has the correct destination address) then return the
packet to the sender (path was collected in the packet)
• if the packet has already been received earlier (identified via ID) then discard the packet
• otherwise, append own address and broadcast packet
• sender receives packet with the current path (address list)
• Optimizations
• limit broadcasting if maximum diameter of the network is known
• caching of address lists (i.e. paths) with help of passing packets
• stations can use the cached information for path discovery (own paths or paths for other
hosts)
Sending from C to O
P R
C
G Q
B I
E
K M O
A
H
D L
F J N
Broadcast P R
[O,C,4711]
C
[O,C,4711] G Q
B I
E
K M O
A
H
D L
F J N
P R
[O,C/G,4711]
C
G [O,C/G,4711] Q
[O,C/B,4711]
B I
E
K M O
A
[O,C/E,4711] H
D L
F J N
P R
C
G Q
B I [O,C/G/I,4711]
E
K M O
A
H
[O,C/E/H,4711]
L
[O,C/B/A,4711] D N
F J
[O,C/B/D,4711]
05/08/24
(alternatively: [O,C/E/D,4711])
Mobile Network Layer 108
DSR: ROUTE DISCOVERY
P R
C
G Q
B I [O,C/G/I/K,4711]
E
K M O
A
H
D L
F J N
[O,C/E/H/J,4711]
05/08/24
[O,C/B/D/F,4711]
Mobile Network Layer 109
DSR: ROUTE DISCOVERY
P R
C
G Q
B I [O,C/G/I/K/M,4711]
E
K M O
A
H
D L
F J N
[O,C/E/H/J/L,4711]
(alternatively: [O,C/G/I/K/L,4711])
05/08/24 Mobile Network Layer 110
DSR: ROUTE DISCOVERY
P R
C
G Q
B I
E
K M O
A
H
D L
F J N
[O,C/E/H/J/L/N,4711
P R
C
G Q
B I Path: M, K, I, G
E
K M O
A
H
D L
F J N
• Maintaining paths
• after sending a packet
• wait for a layer 2 acknowledgement (if applicable)
• listen into the medium to detect if other stations forward the packet (if
possible)
• request an explicit acknowledgement
• if a station encounters problems it can inform the sender of a packet or
look-up a new path locally
R1
S1 N3
N4
N5 N6 R2
S2
N8 N9
N7
neighbors
05/08/24 Mobile Network Layer 114
(i.e. within radio range)
EXAMPLES FOR INTERFERENCE BASED
ROUTING