This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Evaluating Next-Cell Predictors with Extensive Wi-Fi Mobility Data
December 2006 (vol. 5 no. 12)
pp. 1633-1649
David Kotz, IEEE Computer Society
Ravi Jain, IEEE
Location is an important feature for many applications, and wireless networks may serve their clients better by anticipating client mobility. As a result, many location predictors have been proposed in the literature, though few have been evaluated with empirical evidence. This paper reports on the results of the first extensive empirical evaluation of location predictors using a two-year trace of the mobility patterns of more than 6,000 users on Dartmouth's campus-wide Wi-Fi wireless network. The surprising results provide critical evidence for anyone designing or using mobility predictors. We implemented and compared the prediction accuracy of several location predictors drawn from four major families of domain-independent predictors, namely, Markov-based, compression-based, PPM, and SPM predictors. We found that low-order Markov predictors performed as well or better than the more complex and more space-consuming compression-based predictors.

[1] D.A. Levine, I.F. Akyildiz, and M. Naghshineh, “The Shadow Cluster Concept for Resource Allocation and Call Admission in ATM-Based Wireless Networks,” Proc. ACM MobiCom, pp. 142-150, 1995.
[2] W. Su and M. Gerla, “Bandwidth Allocation Strategies for Wireless ATM Networks Using Predictive Reservation,” Proc. IEEE Globecom, vol. 4, pp. 2245-2250, Nov. 1998.
[3] Y. Gwon, J. Kempf, R. Dendukuri, and R. Jain, “Experimental Results on IP-Layer Enhancement to Capacity of VoIPv6 over IEEE 802.11b Wireless LAN,” Proc. First Workshop Wireless Network Measurements (WinMee '05), Apr. 2005.
[4] G. Liu and G. Maguire Jr., “A Class of Mobile Motion Prediction Algorithms for Wireless Mobile Computing and Communications,” ACM/Baltzer Mobile Networks and Applications (MONET), vol. 1, no. 2, pp. 113-121, 1996.
[5] S.K. Das and S.K. Sen, “Adaptive Location Prediction Strategies Based on a Hierarchical Network Model in a Cellular Mobile Environment,” The Computer J., vol. 42, no. 6, pp. 473-486, 1999.
[6] A. Bhattacharya and S.K. Das, “LeZi-Update: An Information-Theoretic Approach to Track Mobile Users in PCS Networks,” ACM/Kluwer Wireless Networks, vol. 8, nos. 2-3, pp. 121-135, Mar.-May 2002.
[7] F. Yu and V.C.M. Leung, “Mobility-Based Predictive Call Admission Control and Bandwidth Reservation in Wireless Cellular Networks,” Computer Networks, vol. 38, no. 5, pp. 577-589, 2002.
[8] C. Cheng, R. Jain, and E. van den Berg, “Location Prediction Algorithms for Mobile Wireless Systems,” Handbook of Wireless Internet, M. Illyas and B. Furht, eds. CRC Press, 2003.
[9] S.K. Das, D.J. Cook, A. Bhattacharya, E. Heierman, and T.-Y. Lin, “The Role of Prediction Algorithms in the MavHome Smart Home Architecture,” IEEE Wireless Comm., vol. 9, no. 6, pp. 77-84, 2002.
[10] L. Song, U. Deshpande, U. Kozat, D. Kotz, and R. Jain, “Predictability of WLAN Mobility and Its Effects on Bandwidth Provisioning,” Proc. IEEE INFOCOM, Apr. 2006.
[11] D. Kotz and K. Essien, “Analysis of a Campus-Wide Wireless Network,” Wireless Networks, vol. 11, pp. 115-133, 2005.
[12] T. Henderson, D. Kotz, and I. Abyzov, “The Changing Usage of a Mature Campus-Wide Wireless Network,” Proc. ACM MobiCom'04, pp. 187-201, Sept. 2004.
[13] J.S. Vitter and P. Krishnan, “Optimal Prefetching via Data Compression,” J. ACM, vol. 43, no. 5, pp. 771-793, 1996.
[14] J. Ziv and A. Lempel, “Compression of Individual Sequences via Variable-Rate Coding,” IEEE Trans. Information Theory, vol. 24, no. 5, pp. 530-536, Sept. 1978.
[15] P. Krishnan and J.S. Vitter, “Optimal Prediction for Prefetching in the Worst Case,” SIAM J. Computing, vol. 27, no. 6, pp. 1617-1636, 1998.
[16] M. Feder, N. Merhav, and M. Gutman, “Universal Prediction of Individual Sequences,” IEEE Trans. Information Theory, vol. 38, no. 4, pp. 1258-1270, July 1992.
[17] T.C. Bell, J.G. Cleary, and I.H. Witten, Text Compression. Prentice Hall, 1990.
[18] J.G. Cleary and I.H. Witten, “Data Compression Using Adaptive Coding and Partial String Matching,” IEEE Trans. Comm., vol. 32, no. 4, pp. 396-402, Apr. 1984.
[19] P. Jacquet, W. Szpankowski, and I. Apostol, “An Universal Predictor Based on Pattern Matching, Preliminary Results,” Mathematics and Computer Science: Algorithms, Trees, Combinatorics and Probabilities, D. Gardy and A. Mokkadem, eds., chapter 7, pp.75-85, Birkhauser, 2000.
[20] L. Song, D. Kotz, R. Jain, and X. He, “Evaluating Location Predictors with Extensive Wi-Fi Mobility Data,” Proc. IEEE INFOCOM, Mar. 2004.
[21] J.G. Cleary and W.J. Teahan, “Unbounded Length Contexts for PPM,” The Computer J., vol. 40, nos. 2-3, 1997.

Index Terms:
Mobility prediction, location prediction, mobility management, location-aware applications, wireless network, cellular network, WLAN, Wi-Fi.
Citation:
Libo Song, David Kotz, Ravi Jain, Xiaoning He, "Evaluating Next-Cell Predictors with Extensive Wi-Fi Mobility Data," IEEE Transactions on Mobile Computing, vol. 5, no. 12, pp. 1633-1649, Dec. 2006, doi:10.1109/TMC.2006.185
Usage of this product signifies your acceptance of the Terms of Use.