Hershey, Pennsylvania
New York, New YorkBeijing, China
The Accuracy of Location Prediction Algorithms Based on Markovian Mobility Models

The Accuracy of Location Prediction Algorithms Based on Markovian Mobility Models

Péter Fülöp (Budapest University of Technology and Economics, Hungary), Sándor Imre (Budapest University of Technology and Economics, Hungary), Sándor Szabó (Budapest University of Technology and Economics, Hungary), and Tamás Szálka (Budapest University of Technology and Economics, Hungary)
Copyright: © 2009 |Pages: 21
DOI: 10.4018/jmcmc.2009040101
OnDemand:
(Individual Articles)
Available
$37.50
Current Special Offers
No Current Special Offers
TOTAL SAVINGS: $37.50

Abstract

The efficient dimensioning of cellular wireless access networks depends highly on the accuracy of the underlying mathematical models of user distribution and traffic estimations. The optimal placement/deployment of e.g. UMTS, IEEE 802.16 WiMAX base stations or IEEE 802.11 WLAN access points is based on user distribution and traffic characteristics in the service area. In this paper we focus on the tradeoff between the accuracy and the complexity of the mathematical models used to describe user movements in the network. We propose a novel Markov chain based model capable of utilizing user’s movement history thus providing more accurate results than other models in the literature. The new model is applicable in real-life scenarios, because it relies on information effectively available in cellular networks (e.g. handover history). The complexity of the proposed model is analyzed, and the accuracy is justified by means of simulation.

Complete Article List

Search this Journal:
Reset
Volume 16: 1 Issue (2025)
Volume 15: 1 Issue (2024)
Volume 14: 1 Issue (2023)
Volume 13: 4 Issues (2022): 2 Released, 2 Forthcoming
Volume 12: 4 Issues (2021)
Volume 11: 4 Issues (2020)
Volume 10: 4 Issues (2019)
Volume 9: 4 Issues (2018)
Volume 8: 4 Issues (2017)
Volume 7: 4 Issues (2016)
Volume 6: 4 Issues (2014)
Volume 5: 4 Issues (2013)
Volume 4: 4 Issues (2012)
Volume 3: 4 Issues (2011)
Volume 2: 4 Issues (2010)
Volume 1: 4 Issues (2009)
View Complete Journal Contents Listing