Greedy algorithms for tracking mobile users in special mobility graphs
Olariu S., Pinotti M. C., Wilson L.
Interval graphs Wireless networks Tracking problem Applied Mathematics Discrete Mathematics and Combinatorics
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 graph.
Source: Discrete applied mathematics 121 (2002): 215–227. doi:10.1016/S0166-218X(01)00238-4
Publisher: North-Holland, Amsterdam , Paesi Bassi
[2] J.S.M. Ho, I.F. Akyldiz, Mobile User Location Update and Paging under Delay Constraints, Wireless Networks 1 (1995) 413-425.
[3] I.F. Akyldiz, J.S.M. Ho, Movement-based Location Update and Selective Paging for PCS Networks, IEEE=ACM Trans. on Networking 4 (1995) 629-638.
[4] A. Bar-Noy, I. Kessler, M. Sidi, Mobile Users: to Update or Not to Update?, Wireless Networks 1 (1995) 175-185.
[5] A. Bar-Noy, I. Kessler, Tracking mobile Users in Wireless Communications Networks, IEEE Trans. Inform. Theory 39 (1993) 1877-1886.
[6] A. Bhattacharya, S.K. Das, LeZi-Update: An Information Theoretic Approach to Track Mobile Users in PCS Networks, MobiCom'99, Seattle, 1999.
[7] M.C. Golumbic, Algorithmic Graph Theory and Perfect Graphs, Academic Press, New York, 1980.
[8] P.J. Looges, S. Olariu, Optimal greedy recognition and coloring for indi:erence graphs, Comput. Math. Appl. 25 (1993) 15-25.
[9] S. Olariu, An optimal greedy heuristic to color interval graphs, Inform. Process. Lett. 37 (1991) 21-25.
[10] U. Madhow, M.I. Honig, K. Steiglitz, Optimization of Wireless Resources for Personal Communications mobility Tracking, IEEE=ACM Trans. Networking 3 (1995) 688-707.
[11] C. Rose, Minimizing the Average Cost of Paging and Registration: a Timer-Based Method, Wireless Networks 2 (1996) 109-116.
[12] C. Rose, R. Yates, Minimizing the Average Cost of Paging under Delay Constraints, Wireless Networks 1 (1995) 211-219.
Metrics
Back to previous page
@article{oai:it.cnr:prodotti:43658,
title = {Greedy algorithms for tracking mobile users in special mobility graphs},
author = {Olariu S. and Pinotti M. C. and Wilson L.},
publisher = {North-Holland, Amsterdam , Paesi Bassi},
doi = {10.1016/s0166-218x(01)00238-4},
journal = {Discrete applied mathematics},
volume = {121},
pages = {215–227},
year = {2002}
}
0000-0002-8674-868X