Combinatorial optimization: algorithms and complexity
Combinatorial optimization: algorithms and complexity
Assignment of cells to switches in PCS networks
IEEE/ACM Transactions on Networking (TON)
Reducing location update cost in a PCS network
IEEE/ACM Transactions on Networking (TON)
The GSM System for Mobile Communications
The GSM System for Mobile Communications
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Modeling techniques for large-scale PCS networks
IEEE Communications Magazine
IEEE Communications Magazine
Location management methods for third generation mobile systems
IEEE Communications Magazine
From optimal search theory to sequential paging in cellular networks
IEEE Journal on Selected Areas in Communications
A profile-based location strategy and its performance
IEEE Journal on Selected Areas in Communications
A caching strategy to reduce network impacts of PCS
IEEE Journal on Selected Areas in Communications
A cost-minimization algorithm for fast location tracking in mobile wireless networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
A hybrid grouping genetic algorithm for the registration area planning problem
Computer Communications
Probability criterion paging area planning in future mobile communications systems
Computer Communications
| Hi-index | 0.00 |
Efficient resource utilisation infuture cellular systems is partly related to thelocation update and paging operations, which rely on’’proper‘‘ planning of location and paging areas, andthe application of efficient paging schemes. Importantis the design of low complexity planning algorithmsthat may enable the system to dynamically adapt to newtraffic and mobility conditions. In this paper wedefine and solve versions of the location and pagingarea planning problems focusing also on algorithmsthat are applicable in real-time. Thus, they can beused to adapt location and paging areas to traffic andmobility conditions. Starting from a formal definitionand an optimal formulation, we solve efficiently bymeans of a low complexity heuristic, a general versionof the location area planning problem. Regardingpaging area planning, we provide a low complexityalgorithm, under the assumption that the schemeapplied falls within the last interaction basedpaging (LIBP) category. The results presented, andthe low cost and complexity induced by the proposedschemes, indicates that the real-time application ofthe schemes is feasible.