Paper Improvement of the Performance of Database Access Operations in Cellular Networks (original) (raw)
Related papers
Improvement of the Performance of Database Access Operations in Cellular Networks
Journal of telecommunications and information technology, 2012
Reducing the traffic volume of location updating is a critical issue for tracking mobile users in a cellular network. Besides, when user x wants to communicate with user y, the location of user y must be extracted from databases. Therefore, one or more databases must be accessed for updating, recording, deleting, and searching. Thus, the most important criterion of a location tracking algorithm is to provide a small database access time. In this paper, we propose a new location tracking scheme, called Virtual Overlap Region with Forwarding Pointer (VF), and compare the number of database accesses required for updating, deleting, and searching operations for the proposed scheme and other approaches proposed for cellular networks. Our VF scheme like Overlap Region scheme reduces the updating information when a user frequently moves in boundaries of LAs. Unlike Overlap Region, the VF can reduce number of database accesses for searching users’ information. Keywords—Cellular networks, de...
International Journal of Wireless Information Networks, 2012
Reducing the volume of location updates and cost of searching for location information are two important issues for tracking mobile users in personal communication systems. Many approaches have been proposed to improve both the location update traffic and searching costs. Some of these approaches can reduce access cost and some other approaches can reduce the location update cost and location update rate. In this paper, we shall propose a new approach for reducing both location update cost and searching cost (for finding mobile users location information). The new scheme called Virtual Overlap Region with Forwarding Pointer (VORFP) uses the forwarding pointer and the virtual overlap region concepts. The virtual overlap region technique is a good method for reducing the location update traffic, especially when a user backs and forths between adjacent cells. Our performance evaluations show that VORFP can significantly reduce searching cost and update cost.
An efficient hierarchical scheme for locating highly mobile users
1998
To accommodate the increase in user population in future personal communication systems, hierarchical architectures of location databases have been proposed. In this paper, a scheme based on forwarding pointers is presented, that reduces the cost of the overall network and database tra c generated by frequent location updates in such hierarchical architectures. To reduce the number of forwarding pointers that need to be traversed to locate a user, auxiliary caching techniques are presented. Various conditions for purging the chain of forwarding pointers and updating the database are also introduced. Special care is given so that the scheme correctly supports the concurrent execution of updates and lookups. The applicability of the scheme and the performance of the caching techniques are demonstrated through a number of experiments for a range of call to mobility ratios and for a variety of moving and calling behaviors.
In near future, anticipated large number of mobile users may introduce very large centralized databases and increase end-to-end delays in location registration and call delivery on HLR-VLR database and will become infeasible. After observing several problems we propose some guidelines. Multitree distributed database, high throughput index structure, memory oriented database organization are used. Location management guidelines for moving user in overlapping network, neighbor discovery protocol (NDP), and global roaming rule are adopted. Analytic model and examples are presented to evaluate the efficiency of proposed guidelines.
Storage-based Location Tracking in Mobile Networks
2011
with the increasing number of mobile terminals, it is a challenge how to reduce the cost and provide fast and efficient call delivery to the mobile terminals. In the existing mobile networks, the call connection between the two terminals is based on the registration of their identity in the databases known as home location register and visitor location register. Conventional registration strategies will incur a high volume of signaling traffic. These strategies can work well up to a certain level of call to mobility ratio. In this paper, we propose a storage-based location tracking scheme based on the storage of the location of a mobile terminal at the repository database, which efficiently reduces the location updates and searching cost in the mobile networks. Keywords-Repository; Visitor location register; Home location Register; Call to mobility ratio; mobile networks.
A Distributed Database Architecture for Global Roaming in Next-Generation Mobile Networks
IEEE/ACM Transactions on Networking, 2004
The next-generation 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 nongeographic PTNs coupled with the anticipated large number of mobile users 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 paper proposes a scalable, robust, efficient location database architecture based on the location-independent PTNs. 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. 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.
INTELLIGENT LOCATION TRACKING SCHEME FOR HANDLING USER'S MOBILITY
Present group of mobile systems afford access to a wide range of services and permit mobile users to join irrespective of their environmental position and their roaming features. Due to growing the number of mobile users, global connectivity and the small size of cells, one of the most serious matters regarding these networks is position management. In current years, several schemes have been proposed to improve the performance of the location management. In the Proposed work a predefined geographical area is considered. For Every base station and it should maintain geographical data base such as blocking area. The base station should warn the mobile station when it moves towards the blocking area. The different speed mobile stations are safeguarded from dropping out. The high speed nodes are warned many a times before it enters the blocking area. This is carried out to reduce call dropping and encourage complete utilization of resources hence we can improve the services provided by the service provider. __________________________________________________________________________________________ Volume: 03 Special Issue: 03 | May-2014 | NCRIET-2014, Available @ http://www.ijret.org 920
A built-in memory model for reducing location update cost in mobile wireless networks
Computer Communications, 2002
This paper proposes a new model for reducing the signaling and database access traf®c due to users' mobility in wireless networks. It requires a small built-in memory in the Mobile Unit (MU) that stores the same location data (MU's location area address) as in the Home Location Register (HLR). When the MU changes its Location Area (LA), it queries the LA whose address is stored in the MU built-in memory to create a pointer between that LA and the MU's current LA. Hence, no location update operation is performed in the HLR. When the MU is called, its HLR is queried to determine its LA. If the MU no longer resides in that LA, then its current LA is reached by traversing a single pointer. Preliminary results show that the proposed model may result in signi®cant reductions in location update costs and outperforms the IS-41 scheme whenever the higher level elements of the SS7 network constitute the performance bottleneck. q
Reducing overhead in movement based dynamic location management scheme for cellular networks
Telecommunication Systems, 2013
One of the key issues in cellular mobile communication is to find the current location of mobile terminal (MT) to deliver the services, which is called location management (LM). Much research has been done on dynamic LM that reduced the LM cost up to a large extent. In movement based dynamic LM scheme, the location area is defined in the form of ring of cells for individual user. Whenever an MT visits a cell outside of its current location area (LA), it triggers location update (LU). For this purpose, network must inform the mobile terminal about ID of all the cells present in its current location area. In this paper, a simple way of cell-ID assignment is proposed under which, network sends only the ID of center cell of LA ring to MT and then MT can compute IDs of all other cells in its location area. This saves a significant amount of wireless bandwidth by minimizing the signaling traffic at VLR level and thus reduces the mobility management overhead.