Multi Tree Data Base Architecture for Location Tracking

download Multi Tree Data Base Architecture for Location Tracking

of 15

Transcript of Multi Tree Data Base Architecture for Location Tracking

  • 8/6/2019 Multi Tree Data Base Architecture for Location Tracking

    1/15

    REVIEW - 1

    UNDER THE GUIDANCE

    OF

    MR. K. JEGADEESWARAN

    ASSISTANT PROFESSOR

  • 8/6/2019 Multi Tree Data Base Architecture for Location Tracking

    2/15

  • 8/6/2019 Multi Tree Data Base Architecture for Location Tracking

    3/15

    ABSTRACTy The next-generation mobile network will support terminal mobility,

    personal mobility, and service provider portability, making Location

    Tracking seamless.

    y A location-independent personal telecommunication number (PTN) scheme

    is conducive to implementing such a global mobile system.

    y In this paper, I propose multi tree database architecture consists of a number

    of database subsystems, each of which is a three-level.

    y It also proposes indexing schemes for each type of location databases and

    analyzes their efficiency and cost in terms of database access time andstorage requirement.

    y Results have revealed that the proposed database architecture for location

    management can effectively support the anticipated high user density in the

    future mobile networks.

  • 8/6/2019 Multi Tree Data Base Architecture for Location Tracking

    4/15

    INTRODUCTIONy THE next-generation mobile network will be an integrated global system

    that provides heterogeneous services across network providers, network

    backbones, and geographical regions.

    y Location Tracking is a basic service of the future mobile networks, where

    terminal mobility, personal mobility, and service provider portability must

    be supported.

    y In a wireless network, a node (mobile-phone) will be present in a region and

    each region will have a MSS.

    y

    Mss is mobile-switching-station or tower. Each mss will have up to dateinformation of all the nodes under its control. Nodes will be continuously

    roaming i.e. it will change its location randomly.

    y When ever a node leaves a region and enters another region, two region's

    mss will be updated. Each mss contains two databases namely HLR and

    VLR.

  • 8/6/2019 Multi Tree Data Base Architecture for Location Tracking

    5/15

    LITERATURE SURVEYy A Distributed Database Architecture for Global Roaming in Next-

    Generation Mobile Networks.

    y

    Distributed Mobility Management for Target Tracking in Mobile SensorNetworks

    y BASE PAPER:

    yMULTI TREE DATA BASE ARCHITECTURE FOR LOCATIONTRACKING IN NEXT GENERATION MOBILE NETWORK

  • 8/6/2019 Multi Tree Data Base Architecture for Location Tracking

    6/15

    CONT..y The next-generation mobile network will support terminal mobility,

    personal mobility, and service provider portability, making global roamingseamless.

    y A location-independent personal telecommunication number (PTN) scheme

    is conducive to implementing such a global mobile system.

    y However, the nongeographic PTNs coupled with the anticipated large

    number of mobile users in future mobile networks may introduce very large

    centralized databases.

    y This necessitates research into the design and performance of high-throughput database technologies used in mobile systems to ensure that

    future systems will be able to carry efficiently the anticipated loads.

    y This paper proposes a scalable, robust, efficient location database

    architecture based on the location- independent PTNs.

  • 8/6/2019 Multi Tree Data Base Architecture for Location Tracking

    7/15

    y The proposed multitree database architecture consists of a number of

    database subsystems, each of which is a three-level tree structure and is

    connected to the others only through its root.

    y By exploiting the localized nature of calling and mobility patterns, the

    proposed architecture effectively reduces the database loads as well as the

    signaling traffic incurred by the location registration and call delivery

    procedures.

    y In addition, two memory-resident database indices, memory-resident direct

    file and T-tree, are proposed for the location databases to further improve

    their throughput.

    y Analysis model and numerical results are presented to evaluate the

    efficiency of the proposed database architecture.

    y Results have revealed that the proposed database architecture for location

    management can effectively support the anticipated high user density in the

    future mobile networks.

  • 8/6/2019 Multi Tree Data Base Architecture for Location Tracking

    8/15

    CONT..y Mobility management is a major challenge in mobile ad hoc networks

    (MANETs) due in part to the dynamically changing network topologies.

    y For mobile sensor networks that are deployed for surveillance applications,

    it is important to use a mobility management scheme that can empower

    nodes to make better decisions regarding their positions such that strategic

    tasks such as target tracking can benefit from node movement.

    y In this paper, I describe a distributed mobility management scheme for

    mobile sensor networks.

    yThe proposed scheme considers node movement decisions as part of adistributed optimization problem which integrates mobility-enhanced

    improvement in the quality of target tracking data with the associated

    negative consequences of increased energy consumption due to locomotion,

    potential loss of network connectivity, and loss of sensing coverage.

  • 8/6/2019 Multi Tree Data Base Architecture for Location Tracking

    9/15

    CHARACTERISTICS

    y MANET generally has the following characteristics:

    y New members can join and leave the network any time.

    y No base station is available to provide connectivity to backbone

    hosts or to other mobile hosts.

    y It is difficult to implement this scheme for handover and

    location management.

    y Each node acts as a router, forwarding packets from others

    nodes.

    y Communication connectivity is usually weak in the sense that

    it is easily broken due to node movement.

  • 8/6/2019 Multi Tree Data Base Architecture for Location Tracking

    10/15

    y The previous mobile network was use different server and

    each has decentralized databases.

    y A local server is stored only its area users information, but

    not stored the other area users information.

    y For example Chennai mobile user call to the Srilanka user

    means, First it search in the local mobile user and after

    finished search in India and then find it in the Srilanka

    server.

    y It takes more time to find the user location because ofdecentralized databases.

    y The communication traffic also occur when search client

    side.

    EXISTING SYSTEM

  • 8/6/2019 Multi Tree Data Base Architecture for Location Tracking

    11/15

    LIMITATION OF EXISTING SYSTEM

    y Its based on location dependent PTN.

    y Does not have a mobile freedom for global wise.

    y Database will vary for each and every country and will not access by other

    country.

    y We cant able to get the clear database details of other country.

    y The PTN will not able to access from one country to other country.

    y PTN will vary from country to country.

  • 8/6/2019 Multi Tree Data Base Architecture for Location Tracking

    12/15

    PROPOSED SYSTEM

    y In proposed system, the mobile network search only in server but not inclient mobile. Because all users information maintained in centralized

    database server.

    y The proposed multi tree database architecture consists of a number of

    database subsystems, each of which is a three-level tree structure and isconnected to the others only through its root.

    y By exploiting the localized nature of calling and mobility patterns, the

    proposed architecture effectively reduces the database loads as well as the

    signaling traffic incurred by the location registration and call deliveryprocedures.

    y In addition, two memory-resident database indices, memory-residentdirect file and T-tree are proposed for the location databases to further

    improve their throughput

  • 8/6/2019 Multi Tree Data Base Architecture for Location Tracking

    13/15

    PROPOSED MULTI TREE

    ARCHITECTURE

    Res lts a e re eale t at t e

    r se ata ase arc itect re

    f r l cati a a e e t ca

    effecti el s rt t e

    a tici ate i ser e sit it e f t re ile et r s.

  • 8/6/2019 Multi Tree Data Base Architecture for Location Tracking

    14/15

    REFERENCE

    y I .-R. Chen, T.-M. Chen, and C. Lee, Agent-based forwarding strategies for

    reducing location management cost in mobile networks, ACM/Blitzer J.

    Mobile Newt. Applicants, vol. 6, no. 2, pp.105115, 2001.

    y I.F. Akyildiz, J. McNairy, J. S. M. Ho, H. Uzunalioglu, and W. Wang,Mobility management in next-generation wireless systems, Proc. IEEE,

    vol. 87, pp. 13471384, Aug. 1999.

    y J . S . M . Ho an d I. F. Ak yildiz, Dynamic hierarchical database

    architecture for location management in PCS networks, IEEE/ACMTrans. Networking, vol. 5, pp. 646660, Oct. 1997.

  • 8/6/2019 Multi Tree Data Base Architecture for Location Tracking

    15/15

    THANK YOU,

    By,V.Nandakumar0986101

    III MCA B