An optimal greedy heuristic to color interval graphs
Information Processing Letters
Optimization of wireless resources for personal communications mobility tracking
IEEE/ACM Transactions on Networking (TON)
Movement-based location update and selective paging for PCS networks
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
Validation of real-time traffic information based on personal communication service network
ICIC'05 Proceedings of the 2005 international conference on Advances in Intelligent Computing - Volume Part II
| Hi-index | 0.04 |
An important issue in wireless networks is the design and analysis of strategies for tracking mobile users. Several strategies have been proposed that aim at balancing the cost of updating the user position and the cost of locating a mobile user. The recently proposed reporting center strategy partitions the cellular network into reporting and non-reporting cells, and associates with each reporting cell a set of non-reporting cells, called its vicinity. The users report their position only when they visit a reporting cell. When a call arrives, the user is searched for only in the vicinity of the last visited reporting center. For a given constant Z, the reporting center problem asks for a set of reporting cells of minimum cardinality such that each selected cell has a vicinity of size at most Z so that the update cost is minimized and the locating cost is bounded by Z. The problem was shown to be NP-hard for arbitrary graphs and Z ≥ 2. The main contribution of this work is to propose algorithms to optimally solve the reporting center problem for vicinity 2 on interval graphs and for arbitrary vicinity on proper interval graphs.