Location Update Cost Research Articles

5G Network with Hexagonal SDN Control for Highly Secure Multimedia Communication

The 5G communication network is a promising technology that offers user-centric connectivity to customers, enabling quick, high-capacity, and latency-free access to many applications. Software Defined Networking Controller (SDNC) is an emerging technology that is used for increasing the security and maintaining the dynamic nature of mobile devices in latency and energy-assured 5G wireless communication. Different SDN topology open flow controllers are used in the literature for increasing the throughput and security of the network but they possess some drawbacks such as frequent location update (LU) overhead, high latency, and high energy consumption. This paper proposes a hexagonal software defined network (H-SDN) controller to overcome these challenges. The proposed H-SDN topology is used to preserve Intermediate Message Layer (IML) location during multimedia data transmission. A Core Switch (CS) updates an IML's location within clusters of cells, as long as it remains within the cluster. However, in the proposed method, there will be a location update on the server if the IML departs the cluster. Experiment results show that the proposed method can increase security, which in turn increases throughput, while reduces the location update costs, energy consumption, and transmission latency.

Artificial intelligence‐based novel scheme for location area planning in cellular networks

AbstractPlanning of location area (LA) in cellular networks plays a vital role in utilizing the resources efficiently and economically. Location update and paging costs directly affect the cost to the service provider. When the size of the Mobile Switching Centre (MSC) is large, the paging cost becomes maximum. Though, no location update is required for this case. On the contrary, paging cost shoots high if each cell forms individual LA, but in this case, location update cost shoots to the maximum value. Therefore, deducing the network to the optimal amount of LA's is an intractable combinatorial optimization problem. In this paper, we intend to optimize the partitions of the MSC service area into an optimal number of LA, to curtail the total location management cost. We propose a novel scheme bearing in mind cell attributes of the network to deduce an optimum number of location areas, leading to minimum cost per call. It is revealed by the results of this work, attained after simulating the scenario on MATLAB 2018a that Cell Attributes Based Algorithm is a very promising scheme for cellular networks, and it outperforms the existing algorithms in a practical scenario.

Proposed variants of charged system search algorithm for location area optimisation in mobile wireless communication networks

Location area optimisation is used to diminish the location update cost and paging cost in mobile wireless communication networks. Retaining heuristic optimisation technique, helps to diminish the location and paging cost, the problem occurs in this technique is combinational optimisation in nature. Handiness of mobile users growing day by day and many users will be allocated to various mobile subscribers and thus forecasting the ideal area is always a big job. Charged system search algorithm (CSSA) is employed to overwhelm the local and global minima that happened often during the peers of the run process. The variants introduced into the CSSA include the wavelet models and the gravitational search algorithm (GSA) models. The prominent features of both wavelet model and GSA model are obtained and are shared with the charged system search algorithm to minimise the total cost experienced for location area optimisation in mobile wireless communication networks (MWCN).

Proposed Variants of Charged System Search Algorithm for Location Area Optimization in Mobile Wireless Communication Networks

Location area optimisation is used to diminish the location update cost and paging cost in mobile wireless communication networks. Retaining heuristic optimisation technique, helps to diminish the location and paging cost, the problem occurs in this technique is combinational optimisation in nature. Handiness of mobile users growing day by day and many users will be allocated to various mobile subscribers and thus forecasting the ideal area is always a big job. Charged system search algorithm (CSSA) is employed to overwhelm the local and global minima that happened often during the peers of the run process. The variants introduced into the CSSA include the wavelet models and the gravitational search algorithm (GSA) models. The prominent features of both wavelet model and GSA model are obtained and are shared with the charged system search algorithm to minimise the total cost experienced for location area optimisation in mobile wireless communication networks (MWCN).

Design and performance evaluation of cost-effective function-distributed mobility management scheme for software-defined smart factory networking

With the proliferation of mobile devices, Internet of Things (IoT), and edge commuting, and the advancement of ICT, mobile computing has become the norm, rather than the exception. Current network technologies and distributed system architectures make it difficult to meet users’ network trace, and incur high processing costs. To solve this problem, this paper proposes new functional distributed mobility management technologies for the application of the industrial future Internet. This implies the need for an efficient distributed mobility system to apply 5G or TSN (time sensitive network) technologies to the future industry Internet. Thus, it is assumed that various analytical techniques will be applied to provide superior performance in cost analyses, such as location update costs and packet transport costs. In this paper, we propose a cost-effective function-distribution mobility management system that will build a future industrial Internet to meet the needs and convenience of users. It also uses computer simulation to create the mobility provision system, and the electiveness of the cost analysis usage and rental management function models. Software-defined networking in smart factories (SFs) enables them to easily adapt the communication network to changing requirements. Similar to cloud-based systems, such SFs could be seen as producing clusters that could be rented and configured as needed. To achieve the required flexibility, the SF network uses software defined networking combined with network function virtualization. Despite the fact that the technology is not yet ready for deployment in today’s manufacturing networks, a novel network architecture for SFs based on software-defined networking and network virtualization is here proposed, to support smart services, especially for Industry 4.0.

Smart prediction for seamless mobility in F-HMIPv6 based on location based services

This paper proposed a new scheme for smooth handoff over F-HMIPv6 networks based on Location Based Services (LBS). It uses the available information about mobile node (MN) such as user mobility patterns and MN’s velocity to reduce handoff latency. In the proposed scheme, the movement pattern of users plays an important role in the performance analysis. The proposed scheme develops LBS that records a number of mobility patterns based on user daily behavior, and exploits these information to reduce the handoff latency. The proposed scheme is analyzed and compared with F-HMIPv6 protocol. The results show that it improves the performance in terms of handoff latency, packet delivery cost, and location update cost. Specifically, the proposed scheme achieves the tradeoff between realizing a smooth handoff and minimizing the cost that is the demand for all customers of mobile services.

QoS-aware Cross Layer Handover Scheme for High-Speed vehicles

High-Speed vehicles can be considered as multiple mobile nodes that move together in a large-scale mobile network. High-speed makes the time allowed for a mobile node to complete a handover procedure shorter and more frequently. Hence, several protocols are used to manage the mobility of mobile nodes such as Network Mobility (NEMO). However, there are still some problems such as high handover latency and packet loss. So efficient handover management is needed to meet Quality of Service (QoS) requirements for real-time applications. This paper utilizes the cross-layer seamless handover technique for network mobility presented in cellular networks. It extends this technique to propose QoS-aware NEMO protocol which considers QoS requirements for real-time applications. A novel analytical framework is developed to compare the performance of the proposed protocol with basic NEMO using cost functions for realistic city mobility model. The numerical results show that QoS-aware NEMO protocol improves the performance in terms of handover latency, packet delivery cost, location update cost, and total cost.

On PMIPv6-based Cost-Effective Function-distributed Mobility Management Scheme for Industrial Future Internet

As the Internet is applied to various fields, it provides convenience according to user needs. Meeting user’s needs network traffic is disruptive and difficult to cause a distributed system structure resulting in high processing costs. To solve this problem, In this paper new Functionality-Distributed Mobility Management Technology for the Application of the Industrial Future Internet is proposed. Functional distributed mobility systems are considered to provide superior performance in cost analysis, such as location update costs and packet transmission costs, by applying various analysis techniques.

On Hierarchical Crossing-layer Binding Update Scheme for Industrial Mobile Networking

Location update and paging technique are studied widely at traditional single layer (Single-tier) of cellular networks, such as 5G mobile network. We propose and evaluate the location update/paging technique which used the new crossing-layer, which can be used hierarchical macro-cell/micro-cell concept at industrial mobile networks. In this paper, industrial network-based location update is proceeds only in the macro-cell layer which LMA (Local Mobility Area) domain was made from by large macro-cell. An MU (Mobile User) will stay in such the LMA domain for a long time. As a result, location update cost due to the reduced frequency of location update can be reduced. In order to reduce paging delay, when paging load is not high, the paged MU only will be searched in the macro-cell layer. Otherwise, it will be searched at the micro-cell layer which sequential searching method was applied. The operation for the scheme is simple, so the industrial network-based of macro-cell/micro-cell concept can have an advantage because MU can receive signal both overlapped micro-cell and macro-cell. Analytical cost modeling is analyzed and we evaluated delay costs for paging. Numerical results show that the paging delay that a crossing-layer scheme is low occurred in costs low relatively.

MALM: Mobility-Aware Location Management Scheme in Femto/Macrocell Networks

Recently, femtocells are widely deployed to offload the traffic from the macrocell. Since conventional location management schemes of femto/macrocell networks do not consider mobility pattern of the mobile node (MN), unnecessary location updates can occur. Specifically, when an MN moves along the contour of the femtocell coverage, the MN frequently executes location update procedures, which causes significant location update cost. To address this problem, we propose a mobility-aware location management (MALM) scheme, where the MN conducts location update only at specific femtocells in which it is expected that the MN stays for a long time. To optimize MALM, a Markov decision process (MDP) problem is formulated and the optimal policy is determined. Evaluation results demonstrate that MALM with the optimal policy can reduce the number of location updates while providing sufficient offloading gain.

Modeling the Tracking Area Planning Problem Using an Evolutionary Multi-Objective Algorithm

When planning the Tracking Areas (TAs) for a Long Term Evolution (LTE) network, the main concern of mobile operators is to achieve the minimization of both location update cost and paging cost. This paper proposes a new green field TA planning model using multi-objective optimization with constraints, aiming at finding a better trade-off between the two conflicting objectives. This new model integrates the network geographical information, therefore making it more realistic. Considering the impact of constraints, we design an evolutionary multi-objective algorithm based on a population decomposition strategy for the proposed model. Information about infeasible solutions can be fully utilized by population decomposition and thus the algorithmic efficiency can be greatly improved. A new coding scheme inspired by the famous four-color theorem is specially designed for this multi-objective TA planning model. Computer simulations are conducted and the quality of the new model is confirmed by comparing the results of the multi-objective model with those of a single-objective model. The essential role of the population decomposition strategy has also been identified by comparing the proposed algorithm with the Multi-objective Evolutionary Algorithm based on Decomposition (MOEA/D).

RFID Based Indoor Positioning System Using Event Filtering

Recently, location systems using RFID technology have been studied in indoor environments. However, the existing techniques require high computational cost to compute the location of a moving object because they compare the location proximity of all reference tags and objects. In this paper, we propose an RFID based location positioning scheme using event filtering, which reduces the computation cost of calculating the locations of moving objects while maintaining the accuracy of location estimation. In addition, we propose an incremental location update policy to reduce the location update cost for moving objects. We also compare the proposed scheme with one of the localization schemes, LANDMARC using a performance evaluation. As a result, the proposed scheme outperforms LANDMARC in terms of the computational cost of location estimation. The proposed scheme also reduces the cost of location update by using the RFID-based update policy.

Distance-Based Location Management Utilizing Initial Position for Mobile Communication Networks

This paper aims at improving the distance-based location management scheme for mobile communication networks. In location management, a mobile terminal (MT) is tracked based on its location-update area (LA). The improvement is brought about by joint optimization of LA center and LA size. For LA center optimization (LCO), we determine the optimal center position of the LA given the initial position of the MT upon each location update. The investigation of optimal LA center has eluded research to date. Based on the popular continuous-time random walk (CTRW) mobility model, we propose an analytical framework that uses a diffusion equation to determine the optimal LA center that minimizes the total cost of location management, consisting of the location update cost and terminal paging cost. This framework allows us to easily model the non-Markovian movement of the MT and evaluate the impact of various measurable physical parameters (such as length of road section, angle between road sections, and road section crossing time) and LA center. In particular, we show that proper LA center can significantly reduce the total cost. For example, for the circular LA and low Poisson call-arrival rate, optimizing the LA center alone has the potential of reducing the cost by up to 37 percent. Joint optimization of the LA center and terminal paging scheme can reduce the cost even further. Simulations results match the theoretical analysis to a gap within 3 percent, indicating that our theoretical model is very accurate.

Handover Management Based on Location Based Services in F-HMIPv6 Networks

In this paper, a new mathematical scheme of Macro Handover Management (MHM) in F-HMIPv6 networks based on Location Based Services (LBS) is proposed. Previous schemes based on F-HMIPv6 protocol usually suffer from three major drawbacks: First, They don’t exploit the information about the user mobility behavior in order to reduce handover effects. Second, they only focus on the micro mobility level. Third, they don’t consider the quality of service (QoS) of the traffic. The proposed MHM scheme avoids these drawbacks using the available information about Mobile Node (MN) such as user mobility patterns and MN’s velocity to predict handover and improve network’s QoS. It also takes the traffic type in consideration since it presents a major factor in locating QoS for the user. MHM is analyzed and compared with the F-HMIPv6. The results show that MHM improves the performance in terms of packet delivery cost, location update cost, and handover latency. The design of MHM comprises software package in the MN in addition to a hardware part in the network side. It has implications for communication, design, and pricing of mobile services.

Design and performance evaluation of distributed mobility management schemes for network mobility

Distributed Mobility Management (DMM) is a current alternative paradigm for developing IP mobility management schemes to address the centralised mobility management problems in existing IP mobility management schemes. This is to allow these schemes to cope with the current increase in the number of mobile users and mobile data traffic volume, as well as the trend in the mobile Internet towards a flat architecture. To date, schemes׳ development based on DMM approach is still at preliminary stages in the IETF, and there is no current standard in place. In this paper, we develop network-based DMM schemes for the Network Mobility (NEMO). The schemes are developed for non-nested and nested NEMO scenarios – with the goal of mitigating the sub-optimal routing, high packet overhead and packet delivery latency, especially in a nested NEMO scenario, due to the employment of a centralized mobility management approach in NEMO. Additionally, the proposed scheme improves the packet delivery and location update (i.e., binding update) costs. The paper presents in detail the schemes’ design, operation mechanism, and the performance evaluation (through analytical and simulation in ns-2). Both the analytical and simulation results show that the proposed schemes yield a significant improvement – in terms of reducing packet overhead and packet delivery latency, as well as binding update and packet delivery costs.

An SIP-Based Location Management Framework in Opportunistic WiFi Networks

In this paper, we propose a novel session-initiation-protocol-based location management framework in opportunistic WiFi networks. In the proposed framework, a mobile terminal needs to update its attachment to the network only when it connects to a new WiFi access point to reduce its location update traffic. In addition, to find out the exact point of attachment, a timer-based session setup procedure is introduced, which can intelligently reduce the session setup latency by looking for a user in either WiFi or cellular systems. We develop analytical models for the location update cost and the session setup latency and investigate the optimization of the timer under the realistic WiFi hotspot residence time model.

Efficient network mobility support scheme for proxy mobile IPv6

The recent rapid proliferation of mobile devices has significantly increased the importance of network mobility (NEMO) technology for Internet access, which enables all the nodes within a mobile network to provide session continuity when the mobile network moves. This paper proposes an efficient network mobility support scheme with direct home network prefix (HNP) assignment to reduce the location update cost and packet tunneling cost. In the proposed scheme, the moving mobile access gateway (mMAG), instead of the local mobility anchor (LMA), assigns a mobile node (MN)’s HNP using a sub-prefix of its own HNP when an MN is attached to the mMAG. An IP address swapping mechanism is used to deliver the packets destined for MNs moved to the mMAG without an additional tunnel header. In the proposed scheme, the mMAG also performs a location update on behalf of the MNs. Therefore, the proposed scheme can reduce both the location update cost and the packet tunneling cost. Numerical analysis and simulation results show that the proposed scheme outperforms the existing schemes in terms of the total cost, throughput, and signaling overhead.

Pervasive Location Management Using Genetic Algorithm

In mobile environment, mobility plays an important role i.e. without mobility there won’t be any transaction inmobile networks. A mobile user calls stir from anywhere on the network. To keep the mobile connected, the networks should keep track of the incoming mobile receptive system.Both network should be effective, efficient to identify the optimum path and faster to find the number of mobile users.This is called location management, which contains the above two things in an efficient and effective manner. Here location update means the process of tracking the mobile terminals and paging means to find the correct mobile terminals. The main aim of this paper is to compute the least location update cost in pervasive environment. Actually this paper is used to integrate the intelligence in mobile environment to identify the least location updation and paging cost. By use of this intelligence, the extraction of output and its level of accuracy are very high.Here intelligence is used to manage the location. Here we have proposed to implement the above two aspects by using various operators of genetic algorithm to solve the reporting cells planning problem because the solution space to be searched is huge and its popularity & robustness. And also the new version of mobility pattern is used to minimize the total cost and to balance the Location update and search Paging. In the new system one mobility pattern is maintained in each and every visited cell. If the number of pattern is increased then the movement weight is reduced and the updating cost and seeking cost is also reduced. Mobile terminals update their positions upon entering one of these reporting cells.In our previous paper, we have used network size of 4X4 for testing purpose and in conclusion, we have mentioned the 6X6 and 8X8 network size as future extension. In this paper we have implemented that extension work for number of generation are 500 and 1,000 for executing various existing algorithms like POFLA, UMP and MIPN. Comparatively the new system is better than any other existing system we have mentioned. The main drawback here is same time taken for first call and maintain less time for subsequent calls only.

Particle Swarm Optimization Based Approach for Location Area Planning in Cellular Networks

Location area planning problem plays an important role in cellular networks because of the trade-off caused by paging and registration signalling (i.e., location update). Compromising between the location update and the paging costs is essential in order to improve the performance of the network. The trade-off between these two factors can be optimized in such a way that the total cost of paging and location update can be minimized along with the link cost. Due to the complexity of this problem, meta-heuristic techniques are often used for analysing and solving practical sized instances. In this paper, we propose an approach to solve the LA planning problem based on the Particle Swarm Optimization (PSO) algorithm. The performance of the approach is investigated and evaluated with respect to the solution quality on a range of problem instances. Moreover, experimental work demonstrated the performance comparison in terms of different degree of mobility, paging load, call traffic load, and TRX load. The performance of the proposed approach outperform other existing meta-heuristic based approaches for the most problem instances.

An Embedded Markov Chain Modeling Method for Movement-Based Location Update Scheme

In this paper, an embedded Markov chain model is proposed to analyze the signaling cost of the Movement-Based Location Update (MBLU) scheme under which a Location Update (LU) occurs whenever the number of cells crossed reaches a threshold, called movement threshold. Compared with existing literature, this paper has the following advantages. 1) This paper proposes an embedded Markov chain model in which the cell residence time follows Hyper-Erlang distribution. 2) This paper considers the Location Area (LA) architecture. 3) This paper emphasize the dependency between the cell and LA residence times using a fluid flow model. Close-form expressions for the signaling cost produced by LU and paging operations are derived, and their accuracy is validated by simulation. Based on the derived analytical expressions, we conduct numerical studies to investigate the impact of diverse parameters on the signaling cost. Index Terms—Embedded markov chain, hyper-erlang distribution, Location Management (LM), Movement-Based Location Update (MBLU).