Mobility Chapter-2

 Mobility Management is the Fundamental Task of any mobile

Computing system.
 The First Task which requires maintaining the Current
location of every mobile node in the network, is know as
location management.
 We Focus mainly on Location management Technique that
are essential for achieving Scalability, reliability.
 Need of DHCP For MOBILE IP.

11/17/2019
 The finest granularity at which location can be maintained I
a cell. Used by GSM and Mobile Internet protocol.
 Another important mobility management task, which is
known as handoff.

 mobile-controlled handoff (MCHO), or by the AP, i.e., network-

controlled handoff (NCHO)]

 Access technologies such as Code Division Multiple Access

(CDMA) permit smooth handoff

11/17/2019
Differentiate hard and soft hand . off.
 Hard Hand - Off
 Occurs in GSM
 Available in FDD / TDD modes
 Inter frequency handover, Inter system handover
 Soft Hand - Off
 Occurs in UMTS
 Available only in FDD mode
 Macro diversity

11/17/2019
 The choice of the base station to which to hand off may
depend on such factors as:

 (1)the SNR of the beacon signals from these APs,

 (2) the region the mobile node is expected to move to in the
near future, and
 (3) the availability of resources at the AP.

“Beacon signals are an integral part of various new applications, including all wireless
systems. ”

11/17/2019
11/17/2019
 every time she moves, she has to inform the New York registrar.
 Won’t it be easier (less burdensome) for Alice to tell the New York
registrar that she is currently in Texas and that the person who
wishes to find her current address should contact the Texas registrar
for her current address.
 it is better to maintain a location pointer at the New York registrar
[the average total cost per month is 4 × local update cost + 3 ×
remote search cost for the location pointer scheme
 Versus 4 × (local update cost + remote update cost) + remote
search cost = 4 × local update cost + 5 × remote search cost for
the actual address scheme].
 Techniques that reduce the search cost tend to increase the update
cost, and vice versa.
11/17/2019
 Maintaining a forwarding location pointer at the New York
registrar instead of the actual address reduces the burden on
Alice (update cost) but increases the burden on Bob (search
cost) because now he has to contact the New York registrar
first and then the Texas registrar.
 Which scheme is better, maintaining the actual address at the
home registrar or the location pointer?

11/17/2019
 reduces the update cost (two local updates for each move as
opposed to one remote and one local update) but increases
the search cost
 [(1 + number of links in the chain) × remote access cost as
opposed to 2 × remote access cost].

 Alice’s chain of forwarding pointers is of length three, and

Bob has to contact the following:
four location registrars: New York, Texas, Alaska, and Alabama

11/17/2019
Analyzing cost versus benefit of
location management optimization
techniques
 Let fs and fu be the number of searches per unit time for a
mobile node.
 assume that Cs,u and Cu,u are the respective search and update
costs.
 Cs,o and Cu,o are the respective search and update costs after
optimization.

11/17/2019
 if the average cost of location management before the
optimization is more than the average cost after the
optimization is performed,
 fsCs,u + fuCu,u > fsCs,o + fuCu,o → fs(Cs,u − Cs,o) > fu (Cu,o − Cu,u)…..(2.1)

 if the optimization reduces the search cost, then Cs,u is greater than Cs,o, and Cs,u
− Cs,o is positive.
 preceding inequality as
 → fs/fu > − [(Cu,u − Cu,o)/(Cs,u − Cs,o)] …………………(2.2)

 call-to-mobility ratio (CMR)

11/17/2019
 For the optimization that reduces the update cost, Cs,u − Cs,o
will be negative, so the inequality becomes.
 → fs/fu < −[(Cu,u − Cu,o)/(Cs,u − Cs,o)] ……2.3

 According to equation 2.3 to the forwarding-chain optimization to

determine the maximum chain length for a mobile device m with
fixed CMR Conclusion According to Equation (2.3)
 Forwarding pointers are beneficial as long as the CMR is less than
1/k

11/17/2019
Replicating location information.
 If no replication is used, then mobile node m’s location
information is maintained at one of the n location registrars.

 Flat organization (update and Search in flat organization)

 Hierarchical organization(update and search in hierarchical tree)

 Best value for Replication factor K ?

11/17/2019
11/17/2019