Mobile Network Layer protocols and mechanisms allow nodes to change their point of attachment to different networks while maintaining ongoing communication. Key concepts include: - Mobile IP adds mobility support to IP, allowing nodes to use the same IP address even when changing networks. It relies on home agents and care-of addresses. - Registration allows mobile nodes to inform their home agent of their current location when visiting foreign networks. Tunneling and encapsulation techniques are used to forward packets to mobile nodes' current locations. - Various routing protocols like DSDV have been developed for mobile ad hoc networks which have no fixed infrastructure and dynamic topologies.

1. Mobile Network Layer

2. Introduction
●
●
●
●
In this protocols and mechanisms developed for
the network layer to support mobility.
It provides protocol enhancement that allows
transparent routing of IP datagrams to mobile
nodes in the internet.
Mobile IP – Adds mobility support to the
internet network layer protocol IP.
RFC 2002 is a reference document for the
complete detail about the mobile IP.

3. Goals, Assumptions and
Requirements
●
Receving of IP datagram after leaving your home network.
●
Now nodes needs a so-called topologically correct address.
Quick Solution
–
–
Assign new IP address when enter into new location.
● Increase problem with higher layer protocols like TCP , as
they rely on IP layer.
● Routers are built for fast forwarding but not for fast update
of routing table.
Quick solution not working.

4. Entities and Terminology
●
Mobile Nodes – a host or router that changes its point of attachment from one
network or subnetwork to another.
–
●
Home Agent – a router on a mobile node's home network which tunnels
datagrams for delivery to the mobile node when it is away from home.
–
●
Mobile node change its location without changing its IP address.
Also, maintain current location information for the mobile node.
Foreign Agent – router on a mobile node's visited network which provides routing
services to the mobile node while registered.
–
It detunnel and deliver the datagram to the mobile node that were tunneled by
the mobile node's home agent

5. Entities and Terminology(Cont.)
●
●
●
●
Correspondent Node (CN) – partner through which MN is connected. It can be
a fixed or mobile node.
Home network – it is subnet the MN belongs to.
Foreign network – it is a current subnet the MN visits and which is not a home
network.
Care-of Address – it defines the current location of the MN from an IP point of
view.
–
All the packets sent to the MN are delivered to the COA,not directly to the IP
address of the MN
–
Marks the tunnel endpoint (i.e address where packets exit the tunnel)
–
Location of COA:●
●
Foreign agent COA – COA could be located at the FA, i.e COA is an IP
address of the FA.
Co-located COA – if the MN temporarily acquired an additional IP
address which acts a COA.This address is topologically correct , and the
tunnel endpoint is at MN.

6. IP packet delivery
●
●
CN wants to send an IP packet to the MN.
Internet , not having info on the current location of MN, routes the packet to the
router(Home Agent) responsible for the home network of MN.
●
HA now intercept the packet(to find current location)
●
Not found in home n/w then encapsulated and tunnelled to the COA.
●
●
●
A new header put in front of the old header showing the (FA) COA as the new
destination.
FA now decapsulates the packets (remove additional header)
Last, MN sends the packets as usual with its own fixed IP address as source and
CN's address as the destination.

7. Agent Discovery
●
●
One initial problem of an MN after moving is
how to find a foreign agent ?.
Two types of methods:
–
–
Agent advertisement – in this HA and FA
advertise their presence.
Agent solicitation – the mobile node send agent
solicitations messages.

8. Agent Advertisement
●
●
●
FA and HA advertise their presence
periodically using special agent
advertisement message.
ICMP messages are used with some mobility
extensions.
Upper part represent ICMP while lower part
represent extention needed for mobility.

9. Agent Advertisement Packet
●
ICMP part
–
–
Code – 0 or 16
–
#addresses – no. of addresses advertised
with this packet
–
Lifetime – length of time this advr. is valid
–
●
Type – 9
Preference – most eager router to get new
node
Extension part – for mobility
–
Type – 16
–
Length – depends on no. of COAs provided
with the msg.
–
Seq. No
–
Reg. Lifetime – max. lifetime in sec. a node
can request during reg.
–
R – reg. , B – busy , H – HA , F – FA ,
M & G – method of encapsulation , V version

10. Agent Solicitation
●
No agent advertisement
●
Mobile node must send agent solicitations.
●
Sould not flood the network
●
●
MN can send three solicitations msgs. , one
per sec. , as soon as enter in new network.
Discovery of new agent can be done
anytime.

11. Registration
●
●
●
Objective – is to inform the HA of the current
location for correct forwarding of packets
After receving COA address the MN has to
register with the HA.
Registration can be done in two ways:–
–
Registration of mobile node via the FA
Or , directly with the HA

12. Registration (COA is the FA)
●
If the COA is at the FA then,
–
–
MN sends its registration request containing the
COA to the FA which then forward the request to the
HA.
Now HA will do the mobility binding containing the
mobile node's home IP adress with the current
COA.

13. Registration (COA is co-locted)
●
●
●
If the COA is co-located.
MN send the request directly to the
HA and vice versa.
Also , a registration procedure for MNs
returning to their home network.

14. Registration request
●
●
●
UDP packets are used for registration requests.
IP source address is the MN interface address and IP destination address is
the FA or HA address.
Type – 1 , S – an MN wants the HA to retain prior mobility binding
B – MN want to receive broadcast packets received by HA in home n/w
●
M & G – minimal or generic routing encapsulation.
●
Destnation port – 434
●
UDP is used because of low overheads and better performance.

15. Registration Reply
●
Type – 3
●
code – result of the registration request
●
lifetime – validity of the registration ,
●
Home IP address
●
Home Agent address
●
64-bit identification used to match the registration request with reply

16. Tunneling & Encpsulation
●
●
●
●
●
It is mechanisms used for forwrding packets between the HA and
COA.
Packets entering a tunnel are forwarded inside the tunnel and leave the
tunnel unchanged.
It can be achieved by using encapsulation.
Encapsulation is the mechanism of taking a packet consisting of
packet header and data and putting it into the data part of a new
packet.
The reverse of encapsulation is decapsulation.

17. Encapsulation Methods
IP-in-IP encapsulation
●
Ver – IP protocol version no.
●
IHL – internet header length
●
●
●
●
TOS – type of services (copied from
inner header)
Length – complete encapsulated
packet length.
IP id. , flags , frag. offset – used
for fragments
TTL -time to live
●
IP-in-IP – upper layer protocol
●
IP checksum – error detection
IP-in-IP encapsulation packet format

18. Minimal Routing Encapsulation
●
In IP-in-IP several fields re redundant
●
Minimal encapsulation will remove these redundancy
●
Type – 55
●
If S bit is set , the original sender address of the CN is
included.

19. Generic Routing Encapsulation
●
Minimal and IP-in-IP only works for IP while
generic routing also supports other
network layer protocols
●
GRE header starts with several flags
●
C – checksum is present
●
R – offset and routing info present
●
K – key field , used for the aunthentication
●
S – sequence number present
●
●
●
s – strict source source routing is used
rsv. - is used to distinguishes GRE from IPin-IP and minimal encapsulation
Protocol – the protocol of the packet
following the GRE.

20. Optimization
●
●
●
●
●
Mobile IP is having inefficient behavior which is
known to be as a triangular routing
HA
To optimize the route is to inform the CN of the
current location of the MN.
And , CN will cache it in a binding chache.
1
2
The entity to inform the CN of the location is the
HA.
Optimized mobile IP protocol needs four
additional messages :–
Binding request
–
Binding update
–
Binding acknowledgement
–
Binding warning
CN
COA/MN
3

21. Optimized mobile IP
●
●
CN request current location from HA using
binding request.
HA return the COA address using binding
update.
●
Now CN directly send to FA old.
●
Tunnel is formed between CN nd FA old.
MN now change its location
●
●
●
●
Register with FA new
This info is forwarded to HA to update its
location.
FA new will inform FA old about the new
registration.
Still CN send data to FA old which forward the
data to FA new.
●
FA old will send the binding warning to CN.
●
then , CN sends binding request to HA
●
and get the updated FA of the MN.

22. DHCP
●
Dynamic Host Configuration Protocol
●
Self Study

23. Mobile Ad-hoc networks
●
●
●
●
●
Till now mobility of the nodes is supported by the at least some
infrastructure.(home agent, tunnel etc.)
Their are situations where their no infrastructure.
Mobiles nodes in an ad-hoc scenario comprise routing and end
system functionality.
Under those conditions we use multi-hop ad-hoc network when
describing ad-hoc networking.
Use of such network
–
–
–
Instant infrastructure
Disaster relief
Remote areas

24. Routing
Differences between wired n/w and ad-hoc n/w
●
●
●
●
Asymmetric link – signal quality uneven in both direction
of the link.
Redundant links – wired n/w have few redundant links
while ad-hoc will have many redundant links.
Interference – it is very high in case of wireless ad-hoc
n/w
Dynamic topology – change in topology is very frequent
which affects the routing table and routing methods.

25. DSDV Routing
●
●
Destination Sequence Distance Vector is an enhancement
to ditance vector routing for ad-hoc network.
Distance Vector – exchange distance vector to its
neighbors for all destination.
●
Problem with DV is the cout-to-infinity.
●
DSDV adds two things to the DV
–
–
Sequence No. - each routing adv. comes with a seq. no. Seq. no.
help to apply the advertisement in correct order.
Damping – Transient change in topology that re of short
duration should not destabilize the routing mechanisms.

26. DSDV Routing
●
If the sequence number of one node in the
newly received same as the corresponding
sequence number in the routing table , then
the metric will be compared and the route
with the smallest metric will be used.

27. DSDV Example

28. DSDV Example

29. DSR
●
Dynamic Source Routing
Problem associated with DSDV
●
Previous routing exchange routing information with all nodes ,
although currently their may be no data to exchange.
●
Cause unnecessary traffic and consumes more battery power.
●
DSR , divides the task into two :–
–
●
Route discovery – a node only discover route to a destination
want to send somthing to this destination.
Route maintenance – if a node is continuously sending packet
via a route, it has to make sure that the route is held upright.
DSR eliminates all periodic routing updates.

30. DSR
●
If the node receive a route request:If the node has already received the request (which is
identified using the unique identifier) , it drops the request
packet.
– If node recognizes its own address as the destination , the
request has reached its target.
– Otherwise, the node appends its own address to a list of
traversed hops in the packets and broadcast this update
request.
Destination may receive several list containing different paths
from the initiator.It could return the best path, the first path or
several path.
–
●

31. AODV