LeZi-Update: An Information-Theoretic Framework for Personal Mobility Tracking in PCS Networks
The DOI matches its Crossref record; 40 of the 40 references it cites were found in a registry or an index.
Overview
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
In the citing paper
“While these sequence prediction algorithms are able to predict the next activity that occurs in a sequence, they do not provide information about when that activity might occur.”
From Forecasting occurrences of activities (2017) · cites this paper as [5]
Citations
Cites
A Mathematical Theory of Communication
Shannon, C. E. (1948) · Bell System Technical Journal · doi:10.1002/j.1538-7305.1948.tb01338.x · Cited by 88,486
A Mathematical Theory of Communication
Shannon, C. E. (1948) · Bell System Technical Journal · doi:10.1002/j.1538-7305.1948.tb00917.x · Cited by 48,949
Compression of individual sequences via variable-rate coding
Ziv, J., & Lempel, A. (1978) · IEEE Transactions on Information Theory · doi:10.1109/tit.1978.1055934 · Cited by 3,432
A Technique for High-Performance Data Compression
Welch (1984) · Computer · doi:10.1109/mc.1984.1659158 · Cited by 2,182 · cited 1×
“How to pick the right mobility model that does not impose fundamental restrictions in terms of richness?”
BackgroundData Compression Using Adaptive Coding and Partial String Matching
Cleary, J., & Witten, I. (1984) · IEEE Transactions on Communications · doi:10.1109/tcom.1984.1096090 · Cited by 1,241
The GSM System for Mobile Communications
Mouly, M., Pautet, M.-B., & Haug, T. (1992) · Cited by 1,213
Bell, T., Cleary, J. G., & Witten, I. H. (1990) · Cited by 988
Entropy optimization principles with applications
Kapur, J. N., & Kesavan, H. K. (1992) · Medical Entomology and Zoology · Cited by 858
A universal data compression system
Rissanen, J. (1983) · IEEE Transactions on Information Theory · doi:10.1109/tit.1983.1056741 · Cited by 631 · cited 1×
“Consequently, we need to formalize the notion of uncertainty we have been talking about since the beginning.”
BackgroundUser mobility modeling and characterization of mobility patterns
Zonoozi, M. M., & Dassanayake, P. (1997) · IEEE Journal on Selected Areas in Communications · doi:10.1109/49.622908 · Cited by 618 · cited 1×
“In this section, we review the basic paging mechanism as well as two kinds of location update techniques, namely static and dynamic update strategies.”
MethodMovement-based location update and selective paging for PCS networks
Akyildiz, I. F., Ho, J. S. M., & Lin, Y.-B. (1996) · IEEE/ACM Transactions on Networking · doi:10.1109/90.532871 · Cited by 612
Mobile users: To update or not to update?
Bar-Noy, A., Kessler, I., & Sidi, M. (1995) · Wireless Networks · doi:10.1007/bf01202540 · Cited by 534
Entropy Optimization Principles and Their Applications
Kapur, J. N., & Kesavan, H. K. (1992) · Water Science and Technology Library · doi:10.1007/978-94-011-2430-0_1 · Cited by 509
Rissanen, J., & Langdon, G. (1981) · IEEE Transactions on Information Theory · doi:10.1109/tit.1981.1056282 · Cited by 454 · cited 1×
“Consequently, we need to formalize the notion of uncertainty we have been talking about since the beginning.”
BackgroundUniversal prediction of individual sequences
Feder, M., Merhav, N., & Gutman, M. (1992) · IEEE Transactions on Information Theory · doi:10.1109/18.144706 · Cited by 373
LeZi-update: an information-theoretic approach to track mobile users in PCS networks
Bhattacharya, A., & Das, S. K. (1999) · Proceedings of the 5th annual ACM/IEEE international conference on Mobile computing and networking · doi:10.1145/313451.313457 · Cited by 307
Self-citationMinimizing the average cost of paging under delay constraints
Rose, C., & Yates, R. D. (1995) · Wireless Networks · doi:10.1007/bf01202543 · Cited by 299 · cited 5×
“The period or time threshold, T , can easily be programmed into the mobile using a hardware or software timer.”
BackgroundMethodInfluentialMobile user location update and paging under delay constraints
Ho, J. S. M., & Akyildiz, I. F. (1995) · Wireless Networks · doi:10.1007/bf01985754 · Cited by 265 · cited 3×
“In this section, we review the basic paging mechanism as well as two kinds of location update techniques, namely static and dynamic update strategies.”
BackgroundMethodMinimizing the average cost of paging and registration: A timer-based method
Rose, C. (1996) · Wireless Networks · doi:10.1007/bf01225634 · Cited by 263 · cited 3×
“The period or time threshold, T , can easily be programmed into the mobile using a hardware or software timer.”
BackgroundMethodDynamic location area management and performance analysis
Xie, H., Tabbane, S., & Goodman, D. J. (2002) · IEEE Vehicular Technology Conference · doi:10.1109/vetec.1993.507529 · Cited by 249 · cited 1×
“They are also global in the sense that all or a batch of mobiles always originate their update messages from the same set of cells.”
BackgroundA universal finite memory source
Weinberger, M. J., Rissanen, J. J., & Feder, M. (1995) · IEEE Transactions on Information Theory · doi:10.1109/18.382011 · Cited by 228 · cited 1×
“Consequently, we need to formalize the notion of uncertainty we have been talking about since the beginning.”
BackgroundPractical prefetching via data compression
Curewitz, K. M., Krishnan, P., & Vitter, J. S. (1993) · Proceedings of the 1993 ACM SIGMOD international conference on Management of data · doi:10.1145/170035.170077 · Cited by 220 · cited 1×
“Such techniques based on compression have earlier been used as predictors in caching and prefetching of database and hypertext documents [11,32], as well as for instruction prefetching and branch prediction in processor architecture [13].”
(2000) · Choice Reviews Online · doi:10.5860/choice.37-6308 · Cited by 212
Optimization of wireless resources for personal communications mobility tracking
Madhow, U., Honig, M. L., & Steiglitz, K. (1995) · IEEE/ACM Transactions on Networking · doi:10.1109/90.477716 · Cited by 167 · cited 2×
“Under these schemes, the mobile updates based only on the user’s activity, but not necessarily at predetermined cells.”
BackgroundTracking mobile users in wireless communications networks
Bar-Noy, A., & Kessler, I. (1993) · IEEE Transactions on Information Theory · doi:10.1109/18.265497 · Cited by 151
A profile-based location strategy and its performance
Pollini, G. P., & Chih‐Lin, I. (1997) · IEEE Journal on Selected Areas in Communications · doi:10.1109/49.634782 · Cited by 147
Optimal prefetching via data compression
Vitter, J. S., & Krishnan, P. (1996) · Journal of the ACM · doi:10.1145/234752.234753 · Cited by 145 · cited 1×
“How to pick the right mobility model that does not impose fundamental restrictions in terms of richness?”
BackgroundDynamic mobile user location update for wireless PCS networks
Akyildiz, I. F., & Ho, J. S. M. (1995) · Wireless Networks · doi:10.1007/bf01202541 · Cited by 145 · cited 2×
“In this section, we review the basic paging mechanism as well as two kinds of location update techniques, namely static and dynamic update strategies.”
BackgroundMethodA selective location update strategy for PCS users
Sen, S. K., Bhattacharya, A., & Das, S. K. (1999) · Wireless Networks · doi:10.1023/a:1019119632106 · Cited by 105 · cited 1×
“Xie et al. [35] have shown how to partition cells into optimal location areas.”
BackgroundSelf-citationMobility management for personal communications systems
Brown, T. X., & Mohan, S. (1997) · IEEE Transactions on Vehicular Technology · doi:10.1109/25.580765 · Cited by 102
A note on the Ziv - Lempel model for compressing individual sequences (Corresp.)
Langdon, G. G. (1983) · IEEE Transactions on Information Theory · doi:10.1109/tit.1983.1056645 · Cited by 85 · cited 1×
“The algorithm in [36] parses the input string “v1 ,v 2 ,...,v n”, where v ∈ ϑ ,i ntoc(n) distinct substrings w1 ,w 2 ,...,w c(n) such that for all j 1, the prefix of substring wj (i.e., all but the last character of wj )i s equal to some wi ,f or 1 i 18 ].”
MethodIntelligent paging strategies for third generation mobile telecommunication systems
Lyberopoulos, G., Markoulidakis, J. G., Polymeros, D. V., Tsirkas, D. F., & Sykas, E. D. (1995) · IEEE Transactions on Vehicular Technology · doi:10.1109/25.406621 · Cited by 83 · cited 1×
“In this section, we review the basic paging mechanism as well as two kinds of location update techniques, namely static and dynamic update strategies.”
MethodKahan, S. (1991) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/103418.103449 · Cited by 78
Location management strategies for mobile cellular networks of 3rd generation
Plassmann, D. (2002) · IEEE Vehicular Technology Conference · doi:10.1109/vetec.1994.345048 · Cited by 58 · cited 1×
“Keywords: location management, update, paging, mobility model, entropy, LZ78 compression”
Modeling and analysis of the dynamic location registration and paging in microcellular systems
Kim, S. J., & Lee, C. Y. (1996) · IEEE Transactions on Vehicular Technology · doi:10.1109/25.481824 · Cited by 54 · cited 1×
“They are also global in the sense that all or a batch of mobiles always originate their update messages from the same set of cells.”
BackgroundBirk, Y., & Nachman, Y. (1995) · Wireless Networks · doi:10.1007/bf01985753 · Cited by 39 · cited 1×
“In this section, we review the basic paging mechanism as well as two kinds of location update techniques, namely static and dynamic update strategies.”
MethodCluster paging for traveling subscribers
Munoz, D. (2002) · IEEE Vehicular Technology Conference · doi:10.1109/vetec.1990.110415 · Cited by 22
Branch prediction based on universal data compression algorithms
Federovsky, E., Feder, M., & Weiss, S. (2002) · Proceedings - International Symposium on Computer Architecture/Proceedings · doi:10.1109/isca.1998.694763 · Cited by 21
Branch prediction based on universal data compression algorithms
Federovsky, E., Feder, M., & Weiss, S. M. (1998) · doi:10.1145/279358.279370 · Cited by 20 · cited 1×
“How to pick the right mobility model that does not impose fundamental restrictions in terms of richness?”
BackgroundBranch prediction based on universal data compression algorithms
Federovsky, E., Feder, M., & Weiss, S. M. (1998) · ACM SIGARCH Computer Architecture News · doi:10.1145/279361.279370 · Cited by 5
Research works printed but not linked: 1
- T.M. Cover and J.A. Thomas, Elements of Information Theory (Wiley, 1991).
Cited by
How smart are our environments? An updated look at the state of the art
Cook, D. J., & Das, S. K. (2007) · Pervasive and Mobile Computing · doi:10.1016/j.pmcj.2006.12.001 · Cited by 589
“Hypothesizing that the inhabitant’s mobility has repetitive patterns that can be learned, and assuming the mobility as a stochastic random process, the following lower bound result was proved by Bhattacharya and Das [ 8 ]: It is impossible to optimally track mobility with less information exchange between the smart en…”
BackgroundInfluentialSelf-citationMavHome: an agent-based smart home
Cook, D. J., Youngblood, M., Heierman, E. O., Gopalratnam, K., Rao, S., Litvin, A., & Khawaja, F. (2004) · Proceedings of the First IEEE International Conference on Pervasive Computing and Communications, 2003. (PerCom 2003). · doi:10.1109/percom.2003.1192783 · Cited by 525
A data mining approach for location prediction in mobile environments
Yavaş, G., Katsaros, D., Ulusoy, Ö., & Manolopoulos, Y. (2004) · Data & Knowledge Engineering · doi:10.1016/j.datak.2004.09.004 · Cited by 327
Prediction-based strategies for energy saving in object tracking sensor networks
Xu, Y., Winter, J., & Lee, W.-C. (2004) · IEEE International Conference on Mobile Data Management, 2004. Proceedings. 2004 · doi:10.1109/mdm.2004.1263084 · Cited by 296
“Prediction based techniques in cellular network reduce the paging overhead by limiting search space to a set of cells that mobile users may enter [1, 23].”
BackgroundNavigate like a cabbie: probabilistic reasoning from observed context-aware behavior
Ziebart, B. D., Maas, A. L., Dey, A. K., & Bagnell, J. A. (2008) · Proceedings of the 10th international conference on Ubiquitous computing · doi:10.1145/1409635.1409678 · Cited by 270
“Bhattacharya and Das used Markov predictors to develop a probability distribution of transitions from one GSM cell to another [3].”
Method
Metadata
- Authors
- Bhattacharya, A., & Das, S. K.
- Affiliations
- The University of Texas at Arlington (US)
- ORCID
- Das, Sajal K.
- Venue
- Wireless Networks
- Published
- 2002-03
- Volume
- 8
- Issue
- 2-3
- Pages
- 121-135
- ISSN
- 1022-0038 (ISSN-L)
- 1572-8196
- OpenAlex
- W1566658900
- Cited by
- 205
- References
- 39
- Citations by year
- 2025: 3 · 2023: 1 · 2022: 1 · 2021: 5 · 2020: 2 · 2019: 4 · 2018: 9 · 2017: 8 · 2016: 4 · 2015: 9 · 2014: 4 · 2013: 6 · 2012: 14
- FWCI
- 18.27
- Type
- journal article
- Language
- en
- Open access
- closed
- Licence
- www.springernature.com/gp/researchers/text-and-data-mining (tdm)
- www.springernature.com/gp/researchers/text-and-data-mining (vor)
- Locations
- Wireless Networks (publishedVersion)
- Funders
- University of North Texas
- Topics
- Physical Sciences › Computer Science › Computer Networks and Communications › Wireless Communication Networks Research
- Physical Sciences › Computer Science › Computer Networks and Communications › Mobile Ad Hoc Networks
- Physical Sciences › Engineering › Electrical and Electronic Engineering › IPv6, Mobility, Handover, Networks, Security
- Keywords
- cellular networks, Shannon entropy, user mobility model, Lempel-Ziv algorithm, lossless compression, adaptive e-learning, user profiling, paging cost reduction, location update
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.