Excluded minors, network decomposition, and multicommodity flow
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Improved bounds for the max-flow min-multicut ratio for planar and Kr,r-free graphs
Information Processing Letters
Movement-based location update and selective paging for PCS networks
IEEE/ACM Transactions on Networking (TON)
PCS mobility management using the reverse virtual call setup algorithm
IEEE/ACM Transactions on Networking (TON)
Mobile users: to update or not to update?
Wireless Networks
Dynamic mobile user location update for wireless PCS networks
Wireless Networks
Minimizing the average cost of paging under delay constraints
Wireless Networks
Mobile user location update and paging under delay constraints
Wireless Networks
LeZi-update: an information-theoretic approach to track mobile users in PCS networks
MobiCom '99 Proceedings of the 5th annual ACM/IEEE international conference on Mobile computing and networking
A selective location update strategy for PCS users
Wireless Networks
Approximation algorithms
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
Approximate Max-Flow Min-(Multi)Cut Theorems and Their Applications
SIAM Journal on Computing
Clustering with Qualitative Information
FOCS '03 Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science
Machine Learning
Geometry of Cuts and Metrics
Reducing location update and paging costs in a PCS network
IEEE Transactions on Wireless Communications
Network issues for wireless communications
IEEE Communications Magazine
A profile-based location strategy and its performance
IEEE Journal on Selected Areas in Communications
Location management for next-generation personal communications networks
IEEE Network: The Magazine of Global Internetworking
A hybrid grouping genetic algorithm for the registration area planning problem
Computer Communications
Performance improvement of LTE tracking area design: a re-optimization approach
Proceedings of the 6th ACM international symposium on Mobility management and wireless access
Location areas planning optimization in mobile networks
PDCS '07 Proceedings of the 19th IASTED International Conference on Parallel and Distributed Computing and Systems
International Journal of Mobile Network Design and Innovation
Network performance model for location area re-planning in GERAN
Computer Networks: The International Journal of Computer and Telecommunications Networking
Distributed cell-centric neighborhood-related location area planning for PCS networks
Computer Communications
Performance and cost trade-off in Tracking Area reconfiguration: A Pareto-optimization approach
Computer Networks: The International Journal of Computer and Telecommunications Networking
Computer Networks: The International Journal of Computer and Telecommunications Networking
Mitigating signaling congestion in LTE location management by overlapping tracking area lists
Computer Communications
Gateway relocation avoidance-aware network function placement in carrier cloud
Proceedings of the 16th ACM international conference on Modeling, analysis & simulation of wireless and mobile systems
| Hi-index | 0.00 |
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 O(log n) more bandwidth than optimal where n 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.