Copyright Alo Sen, KIIT University, Bhubaneswar, India.

A DISTRIBUTED DATABASE ARCHITECTURE FOR GLOBAL ROAMING IN NEXT GENERATION MOBILE NETWORKS
Presented by:ALO SEN
MCA 4th semester Roll-1070003 Section- A

Copyright Alo Sen KIIT University, Bhubaneswar, India.

INTRODUCTION EXISTING SYSTEM PROPOSED SYSTEM MULTITREE DATABASE ARCHITECTURE

OVERVIEW

ORGANISATION OF DATABASE LOCATION TRACKING LOCATION REGISTRATION PROCEDURE

CALL DELIVERY PROCEDURE

CONCLUTION REFERENCES 2

Copyright Alo Sen, KIIT University, Bhubaneswar, India.

INTRODUCTION
THE NEXT GENERATION MOBILE NETWORK :: AN INTEGRATED GLOBAL SYSTEM GLOBAL ROAMING USE OF PTN LOCATION MANAGEMENT

3
Copyright Alo Sen KIIT University, Bhubaneswar, India.

Existing system:
In global roaming, general database design is used to implement. Location tracking is based on two types of location databases: *Home location register (HLR) *Visitor location register (VLR). The profile contains information such as the service types subscribed, the users current location, etc.
4
Copyright Alo Sen KIIT University, Bhubaneswar, India.

Contd..
A VLR is centered with a mobile switching center, controls a group of registration areas.

Whenever area changes, HLR are updated to the new location and deregistered from the old VLR. In the future mobile networks, the updating and querying loads on the location databases will be high.
5
Copyright Alo Sen KIIT University, Bhubaneswar, India.

Proposed system:
The proposed method is used for the next generation of mobile networks as the increase in the number of mobile nodes.The main advantages of this system are: Reduces the database loads

Three-level tree structure Signaling traffic

6
Copyright Alo Sen KIIT University, Bhubaneswar, India.

MULTITREE DATABASE ARCHITECTURE

Multi-database architecture consists of a number of distributed database subsystems.

It is a three level architecture.

The DB0 maintains the service profile for each user currently residing in its service area, and maintains an entry for each user in the global mobile system.

7
Copyright Alo Sen KIIT University, Bhubaneswar, India.

Proposed multitree database architecture.

. Copyright Alo Sen

8
KIIT University, Bhubaneswar, India

ORGANISATION OF DATABASE
The DB0 consists of an index file and a data file.

Every subscriber in the whole mobile system has an

entry in the index file. DB1 has a data item in the index file consists of the

users PTN and a pointer to the DB2 the user is

currently visiting. DB2 area has an entry in the index consists of the users PTN and a pointer to the user record in the data file that stores the service profiles for each user currently visiting this DB2 .
9
Copyright Alo Sen KIIT University, Bhubaneswar, India.

LOCATION TRACKING
The location tracking in the multi-tree structure has
preferred the Memory resident direct file indices and T-tree indices.

In the memory resident direct file it directs the

relationship between record key and Storage Location. T-tree contains a number of data items in each node thus having good storage utilization. To find a value in the T-tree, a search algorithm is needed.
10
Copyright Alo Sen KIIT University, Bhubaneswar, India.

a> T-node

b> T-tree

Copyright Alo Sen

11 KIIT University, Bhubaneswar, India.

12

SEARCH ALGORITHM
Start Node searching

Root node finding

If search node value < minimum value

No

Child node searching

Yes Move to root node

Stop

12
Copyright Alo Sen KIIT University, Bhubaneswar, India.

LOCATION REGISTRATION
Registration request message is sent to the associated DB2 then it sends a request to the DB1 then it registered and it updated to old DB0.If not it moves to new DB0 and registration process closed.

13
Copyright Alo Sen KIIT University, Bhubaneswar, India.

START

NEW USER SEND REGISTRATION MESSAGE TO DATA BASE 1

LOCATION REGISTRATION
YES

IF USER HAS INDEX ENTRY IN THE DATA BASE 1 NO INDEX ENTRY IS CREATED TO NEW DATA BASE 2 AND UPDATE TO DB0

NEW DATA BASE 2 REPLACES THE OLD IN INDEX ENTRY

DataBase0 ENTER A NEW DB0 AREA NO UPDATE THE USER PROFILE TO NEW DATA BASE 1 AND SEND A REGISTRATION CANCELLATION MESSAGE TO OLD BBATABASE 1

YES

REQUESTION FOR THE USER PROFILE AND CREATES NEW RECORD TO NEW DATABASE 2

CREATES THE USER INDEX ENTRY AND USER PROFILE

14
STOP

Copyright Alo Sen KIIT University, Bhubaneswar, India.

CALL DELIVERY PROCEDURE

In call delivery procedure if the call is detected, then it checks to index entry and call delivered to its required one .If not it moves to DB1 for checking .DB1 also not exist it moves to DB0 for checking and the call delivered.

15
Copyright Alo Sen KIIT University, Bhubaneswar, India.

START

IF DB 2 AN INDEX ENTRY FOR CALLCE EXISTS NO

YES

CALL DELIVERY PROCEDURE

IF DB 1 AN INDEX ENTRY FOR CALLCE EXISTS

YES

NO

IF DB 0 THE CALLCE IS WITH ONE DB 1 NO SENDS A MESSAGE TO ANOTHER DATA BASE 0 POINTED BY USER INDEX ENTRY

YES

NEW DATA BASE 2 REPLACES THE OLD IN INDEX ENTRY

NEW DATA BASE 2 REPLACES THE OLD IN INDEX ENTRY

STOP

16
Copyright Alo Sen KIIT University, Bhubaneswar, India.

PRIORITY OF USER

START

IF FREQUEN T USER NO

YES

YES

IF OCCATIONA L USER NO NOT A USER

SEARCHES AT FREQUENT USER ENTRY

SEARCHES AT OCCASIONAL USER ENTRY

STOP

17
Copyright Alo Sen KIIT University, Bhubaneswar, India.

CONCLUTION
The proposed database architecture is scalable, robust, and efficient. Compared to the existing two-level location database architecture, the proposed database architecture can support a much higher user density while reducing signaling load significantly. Compared to the one-root tree architecture, the proposed architecture provides better scalability and reliability while supporting a larger user population at a lower signaling cost. For performance evaluation,analysis model was developed. Numerical results have revealed that the proposed database architecture can effectively handle the anticipated high update and query rates to the location databases in future mobile networks. The proposed database access structures are also suitable for other large centralized databases in mobile networks, such as the authentication center and the equipment identity register. 18
Copyright Alo Sen KIIT University, Bhubaneswar, India.

REFERENCES
[1] I. F. Akyildiz, J. Mcnair, J. S. M. Ho, H. Uzunalioglu, and W. Wang,Mobility management in nextgeneration wireless systems, Proc.IEEE, [2] I.R. Chen, T.-M. Chen, and C. Lee, Agent-based forwarding strategies for reducing location management cost in mobile networks,ACM/Baltzer J. Mobile Netw. Applicat., vol. 6, no. 2, pp. 105115. [3] S.Dolev, D. K. Pradhan, and J. L. Welch, Modified tree structure for location management in mobile environments, Comput. Commun., vol.19, no. 4, pp. 335345. [4] Y.B. Lin and I. Chlamtac, Wireless and Mobile Network Architecture.New York: Wiley, 2001.

19
Copyright Alo Sen , KIIT University, Bhubaneswar, India.

REFERENCES
[5] C. N. Lo and R. S. Wolff, Estimated network database transaction volume to support wireless personal data communications application,in Proc. IEEE Int. Conf. Communications, May 1993, pp. 12571263. [6] A. D. Malyan, L. J. Ng, C. M. Leung, and R. W. Donaldson, Network architecture and signaling for wireless personal communications, IEEE J. Select. Areas Commun., vol. 11, pp. 830840, Aug. 1993. [7] Z. Mao, Location management strategies for personal communications services networks, Ph.D. dissertation, Dept. Electr. Comput. Eng.,Univ. Miami, Miami, FL, 2000. [8] S. Mohan and R. Jain, Two user location strategies for personal communications services, IEEE Pers. Commun., pp. 4250, First Quarter 1994 20
Copyright Alo Sen KIIT University, Bhubaneswar, India.

Questions?

21
Copyright Alo Sen KIIT University, Bhubaneswar, India.

THANK YOU

Copyright Alo Sen , KIIT University, Bhubaneswar, India.