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
Paging area optimization based on interval estimation in wireless personal communication networks
Mobile Networks and Applications
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
FOCS '02 Proceedings of the 43rd Symposium on Foundations of Computer Science
Clustering with Qualitative Information
FOCS '03 Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science
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
An alternative strategy for location tracking
IEEE Journal on Selected Areas in Communications
Location management for next-generation personal communications networks
IEEE Network: The Magazine of Global Internetworking
Correlation clustering in general weighted graphs
Theoretical Computer Science - Approximation and online algorithms
A simulated annealing based location area optimization in next generation mobile networks
Mobile Information Systems - Improving Quality of Service in Mobile Information Systems, Services and Networks
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(logn) 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.