DISTRIBUTED DATABASE ARCHITECTURE FOR GLOBAL ROMING IN MOBILE AD-HOC NETWORKS - Printable Version +- Free Academic Seminars And Projects Reports (https://easyreport.in) +-- Forum: Project Ideas And Disscussion (https://easyreport.in/forumdisplay.php?fid=32) +--- Forum: Engineering Project Ideas (https://easyreport.in/forumdisplay.php?fid=33) +---- Forum: Computer Science Project Ideas (https://easyreport.in/forumdisplay.php?fid=36) +---- Thread: DISTRIBUTED DATABASE ARCHITECTURE FOR GLOBAL ROMING IN MOBILE AD-HOC NETWORKS (/showthread.php?tid=35287) |
DISTRIBUTED DATABASE ARCHITECTURE FOR GLOBAL ROMING IN MOBILE AD-HOC NETWORKS - tejus2608 - 08-17-2017 DISTRIBUTED DATABASE ARCHITECTURE FOR GLOBAL ROMING IN MOBILE AD-HOC NETWORKS ABSTRACT This mobile network will support terminal mobility, personal mobility, and service provider portability, making global roaming seamless. A location-independent Personal Telecommunication Number (PTN) scheme is conducive to implementing such a global mobile system. However, the non geographic PTNs coupled with the anticipated large number of mobile user s in future mobile networks may introduce very large centralized databases. 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. This is scalable, robust, efficient location database architecture based on the location- independent PTNs. The proposed multi tree 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. 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. 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. Analysis model and numerical results are presented to evaluate the efficiency of the proposed database architecture. Results have revealed that the proposed database architecture for location management can effectively support the anticipated high user density in the future mobile networks. EXISTING SYSTEM: The previous mobile network was use different server and each has decentralized databases. A local server is stored only its area user s information, but not stored the other area user s information. 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. It takes more time to find the user location because of decentralized databases. The communication traffic also occur when search client side. Disadvantages of today mobile communication system May differ between different service providers, countries, protocol versions, and data base architecture. Roaming can be expensive cross talking calls, database inconvenience In roaming area cannot support clear call services, thus incurring a much longer call setup delay Network busy (database concurrent access) etc Its based on location dependent PTN. (if the user can anywhere to shifted, the number is roaming, service provider cannot support that area (any other country) A mobile subscriber can not lifelong PTN. Does not have a mobile freedom for global wise. Etc So we can move to Globalize Distributed Database Architecture . PROPOSED SYSTEM: In proposed system, the mobile network search only in server but not in client mobile. Because all user s information maintained in centralized database server. It is avoid the communication traffic, because this is only search in server part and easily find the user. This is a scalable, robust, efficient location database architecture based on the location-independent PTNs. The proposed multi tree 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. 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. 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. Analysis model and numerical results are presented to evaluate the efficiency of the proposed database architecture. Results have revealed that the proposed database architecture for location management can effectively support the anticipated high user density in the future mobile networks. Advantages of today mobile communication system To design a scalable, robust, efficient location database architecture based on the 1. Location independent - user can move any where the world without roaming cost, maintain life long PTN number. 2. Personal Mobility 3. Terminal Mobility - while in motion, to access telecommunication services from different locations, and the capability of the network to identify and locate that terminal. 4. Service Provider portability 3.4 SYSTEM REQUIREMENT: SOFTWARE REQUIREMENTS .NET 2003 SQL SERVER 2000 Windows XP. HARDWARE REQUIREMENTS Hard disk : 40 GB RAM : 512mb Processor : Pentium IV Monitor : 17 Color monitor |