MO D U L E 5

PREPARED BY:
MS. PRITI RUMAO
CONTENT

• Mobility Management: Introduction, IP Mobility, Optimization, IPv6

• Macro Mobility : MIPv6, FMIPv6
• Micro Mobility: CellularIP, HAWAII, HMIPv6
MOBILITY MANAGEMENT
INTRODUCTION

• Traditional mobile communication applications were in two-way voice communication, text, emails and
remote file downloading.

• The emerging applications in video streaming, sensor networking, telemedicine and surveillance are
expected to dominate and shape the next generation of mobile communication systems.

• One critical feature that enables the ubiquitous communication is the mobility management - which is
perceived to provide continuous constant quality of service even under very harsh and unexpected
conditions.

• Basic mobility management operations include location update as mobile units move around and location
lookup as mobile units are wanted.
CONT…

Mobility Issues:

• Radio resource management

• Location info management
• Security
• Temporary loss of connectivity with movement
• Scarce resources : Small devices, low battery power, small CPU, less memory, light weight,….
• React to sudden change in environment due to bandwidth and other resource changes
IP MOBILITY
Location Management:

• Location management schemes are based on users’ mobility and incoming call rate characteristics. The network mobility
process has to face strong antagonism between its two basic procedures: location update (or registration) and paging.

• The location update procedure allows the system to keep location knowledge more or less accurately in order to find the
user. Location registration also is used to bring the user's service profile near its location.

• The paging process by the system sends paging messages in all cells where the mobile terminal could be located. A network
must retain information about the locations of endpoints in the network in order to route traffic to the correct destinations.
Location Tracking:

• Location tracking (also referred to as mobility tracking or mobility management) is the set of mechanisms by which location
information is updated in response to endpoint mobility. It is important to differentiate between the identifier of an
endpoint and its address (i.e., where the endpoint is located).

• Mechanisms for location tracking provide a timevarying mapping between the identifier and the address of each endpoint.
Most location tracking mechanisms may be perceived as updating and querying a distributed database (the location
database) of endpoint identifier-to-address mappings.
CONT…

Two operations of LM:

• The paging operation is performed by the cellular network.

• When an incoming call arrives for a mobile station, the cellular network will page the mobile station in all
possible cells to find out the cell in which the mobile station is located so that the incoming call can be routed
to the corresponding base station. This process is called paging. The number of all possible cells to be paged
is dependent on how the location update operation is performed.

• The location update operation is performed by an active mobile station.

CONT…

Paging Scheme:

• Blanket paging in GSM : Paging the MS in all the cells within a LA (location area) simultaneously. If the LA
update is correct, in the very first paging cycle, the MS will receive a paging request & respond to it. Here the
delay of the paging response is kept to a minimum. The disadvantage is that paging has to be done in several
cells with the same LA!

• Closest-cells first: The cell where the MS was last seen is paged first followed by subsequent rings of cells
that are equidistant from this cell in each paging cycle. Also called sequential paging.
CONT…

Location Tracking:
• It has two components: (1) determining when and how a change in a location database entry should be initiated;
and (2) organizing and maintaining the location database.

• In cellular networks, endpoint mobility within a cell is transparent to the network, and hence location tracking is only
required when an endpoint moves from one cell to another. Location tracking typically consists of two operations:
• (1) updating (or registration), the process by which a mobile endpoint initiates a change in the location database according
to its new location; and
• (2) finding (or paging), the process by which the network initiates a query for an endpoint's location (which also may result in
an update to the location database).

• Most location tracking techniques use a combination of updating and finding in an effort to select the best trade-off
between update overhead and delay incurred in finding. Specifically, updates are not usually sent every time an
endpoint enters a new cell, but rather are sent according to a predefined strategy so that the finding operation can
be restricted to a specific area.
CONT…

• Location Update Algorithms:

• Two types:
• Static
• Dynamic
• A location update scheme can be classified as either global or local. A location update scheme is global if all
subscribers update their locations at the same set of cells, and a scheme is local if an individual subscriber is
allowed to decide when and where to perform location update. A local scheme is also called individualized or
per-user based.
CONT…

Handoff:

• It Involves entire range of actions required to handle an ongoing connection when the mobile terminal
moves from one point of access to another.

• Handoff is very important because of the cellular architecture used for spectrum utilization.
Types of Handoff:

• Hard handoff (further has: Intra and Inter cell handoffs): A firm decision is made when to handoff & has no
simultaneous connection between two or more stations.

• Soft handoff (further has: multiway soft handoffs & softer handoffs): A conditional decision is made whether
to handoff or not. Depending on the pilot signal from 2 or more BSs, eventually a hard decision is made. In
the interim period user has simultaneous traffic with all candidate BSs.
CONT…
Handoff Decisions:
• Network-Controlled Handoff: The network makes a handoff decision based on the measurements of the MSs at a number
of BSs. In general, the handoff process (including data transmission, channel switching, and network switching) takes 100–
200 ms. Information about the signal quality for all users is available at a single point in the network that facilitates
appropriate resource allocation. Network-controlled handoff is used in first generation analog systems such as AMPS
(advanced mobile phone system), TACS (total access communication system), and NMT (advanced mobile phone system).

• Mobile-Assisted Handoff: In a mobile-assisted handoff process, the MS makes measurements and the network makes the
decision. In the circuit-switched GSM (global system mobile), the BS controller (BSC) is in charge of the radio interface
management which means allocation and release of radio channels and handoff management. The handoff time between
handoff decision and execution in such a circuit-switched GSM is approximately 1 second.

• Mobile-Controlled Handoff: In mobile-controlled handoff, each MS is completely in control of the handoff process. This
type of handoff has a short reaction time (on the order of 0.1 second). MS measures the signal strengths from surrounding
BSs and interference levels on all channels. A handoff can be initiated if the signal strength of the serving BS is lower than
that of another BS by a certain threshold.
OPTIMIZATION
Problem: Triangular Routing

• Sender sends all packets via Home Agent to Mobile Node

• Higher latency and network load
CONT…
• Solution To triangular problem:
• The route optimization extension adds a conceptual data structure, the binding cache, to the correspondent node and to
the foreign agent. The binding cache contains bindings for mobile nodes' home addresses and their current care-of
addresses. With the binding the correspondent node can tunnel datagrams directly to the mobile node's care-of address.

• Route optimization adds four new UDP-messages to the mobile ipv4 protocol: binding update, binding acknowledgement,
binding request and binding warning.
CONT…
Problem: Change of FA during transmission.

• Solution:
• Packets on-the-fly during the change can be lost.
• New FA informs old FA to avoid packet loss, old FA now forwards remaining packets to new FA.
• This information also enables the old FA to release resources for the MN.
IPv6
CONT…

• There are global addresses and local addresses.

• Global addresses are used for routing of global Internet.
• Link local addresses are available within a subnet.
• IPv6 uses hierarchical addressing with three level of addresses.
• Includes a Public Topology (the 48 bit external routing prefix).
• Site Topology (typically a 16 bit subnet number).
• Interface Identifier (typically an automatically generated 64 bit number unique on the local LAN segment).
CONT…
• Following is a list of the fields in the IPv6 header:
• Version: The Version field indicates the version of IP and is set to 6. The size of this field is 4 bits. While the purpose
of the Version field is defined in the same way for both IPv4 and IPv6, its value is not used to pass the packet to an
IPv4 or IPv6 protocol layer. This identification is done through a protocol identification field in the link-layer header.

• Traffic Class: The Traffic Class field indicates the IPv6 packet’s class or priority. The size of this field is 8 bits. This field
provides functionality similar to the IPv4 Type of Service field.

• Flow Label: The Flow Label field indicates that this packet belongs to a specific sequence of packets between a
source and destination, requiring special handling by intermediate IPv6 routers. The size of this field is 20 bits. The
flow label is used for prioritized delivery.

Fig: IPv6 Header

CONT…
• Payload Length: The Payload Length field indicates the length of the IPv6 payload. The size of this field is 16
bits. The Payload Length field includes the extension headers and the upper-layer PDU. With 16 bits, an IPv6
payload of up to 65,535 bytes can be indicated.

• Next Header: The Next Header field indicates either the type of the first extension header (if present) or the
protocol in the upper-layer PDU (such as TCP, UDP, or ICMPv6). The size of this field is 8 bits.

• Hop Limit: The Hop Limit field indicates the maximum number of links over which the IPv6 packet can travel
before being discarded. The size of this field is 8 bits.

• Source Address: The Source Address field indicates the IPv6 address of the originating host. The size of this
field is 128 bits.

• Destination Address: The Destination Address field indicates the IPv6 address of the current destination
node. The size of this field is 128 bits. In most cases, the Destination Address field is set to the final
destination address.
CONT…
Hierarchical Addressing of IPv6:

• The three types of IPv6 addresses are:

unicast, anycast, and multicast.

• Unicast addresses identify a single

interface.

• Anycast addresses identify a set of

interfaces in such a way that a packet
sent to an anycast address is delivered
to a member of the set.

• Multicast addresses identify a group of

interfaces in such a way that a packet
sent to a multicast address is delivered
to all of the interfaces in the group.
CONT…

Migrating from IPv4 to IPv6:

• Migration of the network components to be able to support IPv6 packets: Using IP tunneling, IPv6 packets
can propagate over an IPv4 envelope. Existing routers can support IP tunneling.

• Migration of the computing nodes in the network: This will need the operating system upgrades so that they
support IPv6 along with IPv4. Upgraded systems will have both IPv4 and IPv6 stacks.

• Migration of networking applications in both client and server systems: This requires porting of the
applications from IPv4 to IPv6 environment.
MACRO MOBILITY
MIPV6

Fig: Mobile IPv6

CONT…

• IPv6’s increased address space and inherent support for security and autoconfiguration have made it suitable to
support mobility for the next-generation Internet. Mobile IPv6 is the protocol to support mobility for IPv6 nodes.

• Since address autoconfiguration is a standard part of MIPv6, the MH will always obtain a CoA routable to a
foreign network.

• Thus, there is no need to have a foreign agent in MIPv6. When the mobile node moves to a new foreign
network, it acquires a temporary care-of-address using stateless autoconfiguration or via DHCPv6.

• Figure above shows the functional components of Mobile IPv6. The visited networks do not have any foreign
agents. MIPv6’s route optimization feature also enables direct data delivery from the correspondent host (CH) to
the mobile node.

• Although Mobile IPv6 is defined as a network layer approach and one needs to install an MIPv6 stack so as to
support mobility in an IPv6 space, any standard operating system will in future come with inherent Mobile IPv6
support.
CONT…
• While Mobile IPv6 provides a way of making sure of the uniqueness of an address as a mobile moves to a new
router space, it also adds delay to the binding update and binding acknowledgement as in Mobile IPv4.

• Route optimization is a standard feature of MIPv6, and thus there is no need for the CH to be equipped with
additional software like MIP-RO.

• The MH sends a binding update directly to the CH and makes use of the home address destination option as part
of the binding update. This allows the correspondent host to keep a binding cache that maps the care-of address
of the mobile to the mobile’s home address.

• For the ongoing traffic, this avoids triangular routing, and thus packets from the CH to the MH need not be
encapsulated but are sent directly to the MH with its CoA as the source route. However, when a new CH needs to
communicate with the mobile for the first time, the packets from the CH need to travel to the home agent and be
tunneled to the mobile host.

• As the mobile moves during the packet transfer process, the subsequent packets are tunneled directly to the
mobile host without being routed via the home agent.
FMIPv6

Fig: Fast Mobile IPv6

CONT…

• While Mobile IPv6 takes care of session continuity during handoff, by itself it lacks the ability to provide the
low-latency handoff and reduced packet loss that are essential for many interactive applications such as Voice
over IP, gaming, and conferencing.

• Fast Mobile IPv6 (FMIPv6) proposes mechanisms to reduce the handoff delay by way of localizing the binding
updates to the edges of the network, reducing the delay due to IP address acquisition, and buffering at the
edge routers.

• This involves additional protocol exchange between the mobile host, the current router (pAR), and the next
access router (nAR). These mechanisms can be categorized into two types of handover, namely predictive
and reactive.

• The FMIPv6 protocols work in conjunction with the existing MIPv6 stack.
CONT…

• The mobile host sends a router solicitation for a proxy (RtSolPr) message to its default access router (pAR) in
order to obtain information related to the link layer addresses of the neighboring access points discovered
during the layer 2 scanning process, and the prefixes associated with the neighboring access router (nAR).

• The current access router (pAR) communicates with the nAR using protocols such as Candidate Access Router
Discovery (CARD) to obtain the relevant information about the neighboring network elements.

• The pAR serving the user responds with a proxy router advertisement (PrRtAdv) containing the requested
information, thus allowing the mobile host to perform address autoconfiguration prior to its movement to
the new network.

• The host, after formulating a prospective new CoA, sends a fast binding update (FBU) to its default router
instructing it to tunnel packets addressed to its old CoA (oCoA) towards its new CoA (nCoA).
CONT…

• The access router currently serving the host (pAR) starts buffering newly arriving packets with the oCoA as
their destination and exchanges handover initiate (HI) and handover acknowledge (HAck) messages with the
nAR to initiate the process of the MH’s handover.

• This HI/HAck message exchange can also serve for validation of the nCoA already formed by the host. The
pAR responds to the MH with a fast binding acknowledge (FBack) message on both links (old and new) and
starts the tunneling of buffered and arriving data to the nCoA.

• These packets are also buffered at the nAR until the mobile arrives at the new point of attachment. The MH,
as soon as it attaches to the new link, transmits a UNA (unsolicited network advertisement) to inform the
nAR of its presence.

• Buffered packets at the nAR can be delivered immediately to the MH on the new link.
MICRO MOBILITY
INTRODUCTION

• IP micro-mobility protocols can complement mobile IP by offering fast and almost seamless handover control
in limited geographical areas.

• The following presents three of the most prominent approaches:

• CellularIP
• HAWAII
• HMIPv6
CELLULAR IP
• Cellular IP provides local handovers without renewed
registration by installing a single cellular IP gateway
(CIPGW) for each domain, which acts to the outside world
as a foreign agent.

• Inside the cellular IP domain, all nodes collect routing

information for accessing MNs based on the origin of
packets sent by the MNs towards the CIPGW.

• Soft handovers are achieved by allowing simultaneous

forwarding of packets destined for a mobile node along
multiple paths. A mobile node moving between adjacent
cells will temporarily be able to receive packets via both old
and new base stations (BS) if this is supported by the lower
protocol layers.
Fig: Basic architecture of cellular IP
CONT…
• Cellular IP has a simple and elegant architecture and is mostly self-configuring.
• Cellular IP requires changes to the basic mobile IP protocol and is not transparent to existing systems.
• The foreign network’s routing tables are changed based on messages sent by mobile nodes. These should not be trusted
blindly even if they have been authenticated as this could be exploited by systems in the foreign network for wiretapping
packets destined for an MN by sending packets to the CIPGW with the source address set to the MN’s address.

• Advantage:
• Manageability: Cellular IP is mostly self-configuring, and integration of the CIPGW into a firewall would facilitate
administration of mobility-related functionality.

• Disadvantages:
• Efficiency: Additional network load is induced by forwarding packets on multiple paths.
• Transparency: Changes to MNs are required.
• Security: All systems in the network can easily obtain a copy of all packets destined for an MN by sending packets with the
MN’s source address to the CIPGW.
HAWAII
• HAWAII (Handoff-Aware Wireless Access Internet Infrastructure) tries to
keep micro-mobility support as transparent as possible for both home
agents and mobile nodes.

• Itsconcrete goals are performance and reliability improvements and

support for quality of service mechanisms. On entering an HAWAII
domain, a mobile node obtains a co-located COA (step 1) and registers
with the HA (step 2).

• When moving to another cell inside the foreign domain, the MN sends a
registration request to the new base station as to a foreign agent (step 3),
thus mixing the concepts of co-located COA and foreign agent COA.

• The base station intercepts the registration request and sends out a
handoff update message, which reconfigures all routers on the paths from
the old and new base station to the so-called crossover router (step 4).

Fig: Basic architecture of HAWAII

CONT…

• When routing has been reconfigured successfully, the base station sends a registration reply to the mobile node, again
as if it were a foreign agent. The use of challenge-response extensions for authenticating a mobile node is mandatory.

• In contrast to cellular IP, routing changes are always initiated by the foreign domain’s infrastructure, and the
corresponding messages could be authenticated, reducing the risk of malicious rerouting of traffic initiated by bogus
mobile hosts.
Advantages:

• Security: Challenge-response extensions are mandatory. In contrast to Cellular IP, routing changes are always initiated by
the foreign domain’s infrastructure.

• Transparency: HAWAII is mostly transparent to mobile nodes.

Disadvantages:

• Security: There are no provisions regarding the setup of IPSec tunnels.

• Implementation: No private address support is possible because of collocated COAs.
HMIPv6
• HMIPv6 provides micro-mobility support by installing a mobility anchor point
(MAP), which is responsible for a certain domain and acts as a local HA within
this domain for visiting MNs.

• The MAP receives all packets on behalf of the MN, encapsulates and forwards
them directly to the MN’s current address (link COA, LCOA).

• As long as an MN stays within the domain of a MAP, the globally visible COA
(regional COA, RCOA) does not change.

• A MAP domain’s boundaries are defined by the access routers (AR) advertising
the MAP information to the attached MNs.

• A MAP assists with local handovers and maps RCOA to LCOA. MNs register their
RCOA with the HA using a binding update. When a MN moves locally it must only
register its new LCOA with its MAP.

• The RCOA stays unchanged. To support smooth handovers between MAP

domains, an MN can send a binding update to its former MAP.

Fig: Basic architecture of hierarchical

mobile IP
CONT…

Advantages:

• Security: MNs can have (limited) location privacy because LCOAs can be hidden.
• Efficiency: Direct routing between CNs sharing the same link is possible.
Disadvantages:

• Transparency: Additional infrastructure component (MAP).

• Security: Routing tables are changed based on messages sent by mobile nodes. This requires strong
authentication and protection against denial of service attacks. Additional security functions might be
necessary in MAPs
THANK YOU!!!