Greedy algorithms for tracking mobile users in special mobility graphs
Discrete Applied Mathematics, ISSN: 0166-218X, Vol: 121, Issue: 1, Page: 215-227
2002
- 3Citations
- 4Captures
Metric Options: CountsSelecting the 1-year or 3-year option will change the metrics count to percentiles, illustrating how an article or review compares to other articles or reviews within the selected time period in the same journal. Selecting the 1-year option compares the metrics against other articles/reviews that were also published in the same calendar year. Selecting the 3-year option compares the metrics against other articles/reviews that were also published in the same calendar year plus the two years prior.
Example: if you select the 1-year option for an article published in 2019 and a metric category shows 90%, that means that the article or review is performing better than 90% of the other articles/reviews published in that journal in 2019. If you select the 3-year option for the same article published in 2019 and the metric category shows 90%, that means that the article or review is performing better than 90% of the other articles/reviews published in that journal in 2019, 2018 and 2017.
Citation Benchmarking is provided by Scopus and SciVal and is different from the metrics context provided by PlumX Metrics.
Example: if you select the 1-year option for an article published in 2019 and a metric category shows 90%, that means that the article or review is performing better than 90% of the other articles/reviews published in that journal in 2019. If you select the 3-year option for the same article published in 2019 and the metric category shows 90%, that means that the article or review is performing better than 90% of the other articles/reviews published in that journal in 2019, 2018 and 2017.
Citation Benchmarking is provided by Scopus and SciVal and is different from the metrics context provided by PlumX Metrics.
Article Description
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.
Bibliographic Details
http://www.sciencedirect.com/science/article/pii/S0166218X01002384; http://dx.doi.org/10.1016/s0166-218x(01)00238-4; http://www.scopus.com/inward/record.url?partnerID=HzOxMe3b&scp=84867922187&origin=inward; https://linkinghub.elsevier.com/retrieve/pii/S0166218X01002384; https://api.elsevier.com/content/article/PII:S0166218X01002384?httpAccept=text/xml; https://api.elsevier.com/content/article/PII:S0166218X01002384?httpAccept=text/plain; http://linkinghub.elsevier.com/retrieve/pii/S0166218X01002384; http://api.elsevier.com/content/article/PII:S0166218X01002384?httpAccept=text/xml; http://api.elsevier.com/content/article/PII:S0166218X01002384?httpAccept=text/plain; http://dx.doi.org/10.1016/s0166-218x%2801%2900238-4; https://dx.doi.org/10.1016/s0166-218x%2801%2900238-4
Elsevier BV
Provide Feedback
Have ideas for a new metric? Would you like to see something else here?Let us know