Mobile phones are the most common communication devices in history. For this reason, the number of mobile subscribers will increase dramatically in the future. Therefore, the determining the location of a mobile station will become more and more difficult. The mobile station must be authenticated to inform the network of its current location even when the user switches it on or when its location is changed. The most basic weakness in the GSM authentication protocol is the unilateral authentication process where the customer is verified by the system, yet the system is not confirmed by the customer. This creates numerous security issues, including powerlessness against man-in-the-middle attacks, vast bandwidth consumption between VLR and HLR, storage space overhead in VLR, and computation costs in VLR and HLR. In this paper, we propose a secure authentication mechanism based new mobility management method to improve the location management in the GSM network, which suffers from a lot off drawbacks, such as transmission cost and database overload. Numerical analysis is done for both conventional and modified versions and compared together. The numerical results show that our protocol scheme is more secure and that it reduces mobility management costs the most in the GSM network.

Mobility arises naturally in the Internet of Things networks, since the location of mobile objects, e.g., mobile agents, mobile software, mobile things, or users with wireless hardware, changes as they move. Tracking their current location is essential to mobile computing. To overcome the scalability problem, hierarchical architectures of location databases have been proposed. When location updates and lookups for mobile objects are localized, these architectures become effective. However, the network signaling costs and the execution number of database operations increase particularly when the scale of the architectures and the numbers of databases becomes large to accommodate a great number of objects. This disadvantage can be alleviated by a location caching scheme which exploits the spatial and temporal locality in location lookup. In this paper, we propose a hierarchical location caching scheme, which acclimates the existing location caching scheme to a hierarchical architecture of location databases. The performance analysis indicates that the adjustment of such thresholds has an impact on cost reduction in the proposed scheme.

Indexing

JIPS is also selected as the Journal for Accreditation by NRF (National Research Foundation of Korea).

This is an Open Access article distributed under the terms of the Creative Commons Attribution Non-Commercial License.

Society

ABOUT THE SOCIETY

Ever since information processing became one of the most important industries in the country, computing professionals have encountered a growing number of challenges.
Along with scholars and colleagues in related fields, they have gathered together at a variety of forums and meetings over the last few decades to share their knowledge and experiences,
and the outcomes of their research. These exchanges led to the founding of the Korea Information Processing Society (KIPS) on January 15, 1993. The KIPS was registered as an incorporated association under the Ministry of Science,
ICT and Future Planning under the government of the Republic of Korea. The main purpose of the KIPS organization is to improve our society by achieving the highest capability possible in the domain of information technology.
As such, it focuses on close collaboration with the nationâs industry, academic, and research communities to foster technological innovation,
to enhance its members' careers, and to promote the advanced information processing industry.