Advertisement

On Detecting Unsteady Demand in Mobile Networking Environment

  • V. V. Shakhov
  • H. Choo
  • H. Y. Youn
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2331)

Abstract

One of the key issues in mobile communication system is how to predict the number of calls per each cell. It is an important parameter and usually assumed as random Poisson value. For effective management of cellular network, the average number of calls should be traced and the changes in the numbers need to be promptly detected. In this paper we propose an algorithm detecting the changes in the behavior of the users using the technique proposed for point-of-change problem based only on the number of call arrivals. Computer simulation reveals that the proposed method can effectively detect the discord, and the developed model is very accurate as showing mostly less than 1% differences.

References

  1. 1.
    W. Lee, Mobile Cellular Telecommunications: analog and digital systems, Second Edition, New York: McGraw-Hill, 1995.Google Scholar
  2. 2.
    R. Thomas, H. Gilbert, and G. Mazziotto, “Influence of the Movement of Mobile Station on the Performance of the Radio Cellular Network,” Proceeding of the 3rd Nordic Seminar, Copenhagen, September 1988.Google Scholar
  3. 3.
    C.Y. Park, Y.H. Han, C.S. Hwang, and Y.S. Jeong, “Simulation of a Mobility Prediction Scheme Based on Neuro-Fuzzy Theory in Mobile Computing,” Simulation, v. 75, No 1, p. 6–17, 2000.zbMATHCrossRefGoogle Scholar
  4. 4.
    D. Hong and S. Rappaport, “Traffic Model and Performance Analysis for Cellular Mobile Radio Telephone Systems with Prioritized and Non-Prioritized Handoff Procedures,” IEEE Transactions on Vehicular Technology, v. 35, No 3, pp. 77–91, August, 1986.CrossRefGoogle Scholar
  5. 5.
    G. Liu and Jr. Maguire, “Class of Mobile Motion Prediction Algorithms for Wireless Mobile Computing and Communications,” Mobile Networks and Application, v. 1, pp. 113–121, 1996.CrossRefGoogle Scholar
  6. 6.
    T. Lui, P. Bahl, and I. Chlamtac, “An Optimal Self-Learning Estimation for Predicting Inter-cell User Trajectory in Wireless Radio Networks,” IEEE 6th International Conference on Universal Personal Communications, v. 2, pp. 438–442, 1997.CrossRefGoogle Scholar
  7. 7.
    Y. Fang, I. Chlamtac, and Y.-B. Lin, “Call completion probability for a PCS network”, IEEE 6th International Conference on Universal Personal Communications, v. 2, pp. 567–571, 1997.CrossRefGoogle Scholar
  8. 8.
    E.S. Page, Continuous inspection schemes. Biometrika, 1954, v. 41, N2, p. 100–114.zbMATHMathSciNetGoogle Scholar
  9. 9.
    B. Yakir, “Dynamic sampling policy for detecting a change in distribution, with a probability bound on false alarm,” Ann. Statist, v. 24, pp. 2199–2214, 1996.zbMATHCrossRefMathSciNetGoogle Scholar
  10. 10.
    M. Molloy, Fundamentals of Performance Modeling, New York: Macmillan Publishing Company, 1988.Google Scholar
  11. 11.
    D.E. Knuth, The art of computer programming, 3rd ed., v. 2, pp. 137, Addison-Wesley, 1998.Google Scholar
  12. 12.
    S.M. Ermakov and G.A. Michaelov, Statistics modelling, oscow: Nauka, 1982 (in Russian).Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2002

Authors and Affiliations

  • V. V. Shakhov
    • 1
  • H. Choo
    • 1
  • H. Y. Youn
    • 1
  1. 1.School of Electrical and Computer EngineeringSungkyunkwan UniversitySuwonKorea

Personalised recommendations