Efficient location area planning for personal communication systems

Abstract

A central problem in personal communication systems is to optimize bandwidth usage, while providing Quality of Service (QoS) guarantees to mobile users. Network mobility management, and in particular, location management, consumes a significant portion of bandwidth, which is a necessary overhead for supporting mobile users. We focus our efforts on minimizing this overhead. Unlike previous works, we concentrate on optimizing existing schemes, and so the algorithms we present are easily incorporated into current networks. We present the first polynomial time approximation algorithms for minimum bandwidth location management. In planar graphs, our algorithm provably generates a solution that uses no more than a constant factor more bandwidth than the optimal solution. In general graphs, our algorithm provably generates a solution that uses just a factor (log ) more bandwidth than optimal where is the number of base stations in the network. We show that, in practice, our algorithm produces near-optimal results and outperforms other schemes that are described in the literature. For the important case of the line graph, we present a polynomial-time optimal algorithm. Finally, we illustrate that our algorithm can also be used for optimizing the handoff mechanism.

A grouping biogeography-based optimization for location area planning

“…Almedia-Luz et al [1] also use the differential evolution to find the best location area planning (LAP) and to report cell location solutions for the networks. Simulated annealing [31] and a combined genetic-neural algorithm [34] are both applied to optimize the objective function of the problem for minimizing the location update cost with a bound on paging cost [2]. Genetic algorithm and other bioinspired algorithms have also been used in this problem [30,33].…”

Location Area Planning with complete homogenous traffic

“…Bejerano et al [16] prove that the LAP problem is NP-hard even when the given graph topology is a star. They study the LAP problem with a variety of system-imposed constraints such as size and connectivity constraints.…”

A Combination of Optimal Partitioning and Location Prediction to Assist Paging in Mobile Cellular Networks

“…LA optimization is amenable by considering the antagonizing procedures of location update and paging, as shown in [1,2], where the standard simultaneous paging approach is employed to identify the serving base station of a mobile.…”