2014 IEEE Intelligent Vehicles Symposium Proceedings 2014
DOI: 10.1109/ivs.2014.6856442
|View full text |Cite
|
Sign up to set email alerts
|

Cell phone subscribers mobility prediction using enhanced Markov Chain algorithm

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
10
0
2

Year Published

2016
2016
2022
2022

Publication Types

Select...
4
3
2

Relationship

0
9

Authors

Journals

citations
Cited by 35 publications
(12 citation statements)
references
References 15 publications
0
10
0
2
Order By: Relevance
“…A set of CR user current path states are taken as s = { s 1 , s 2 … s n }, where s 1 , s 2 represents the geographical co‐ordinates (latitude and longitude). The CR user's path from state s 1 to state s n is represented in transition matrix which are formed using Markov's Chain algorithm as follows P=[]ρ11.5emρ120.75em0.75emρ1mρ21.5emρ220.75em0.75emρ2m0.5em0.5em0.5em0.5emρm1.5emρm20.75em0.75emρmm where m is the possible number transitions.…”
Section: Proposed Methodsmentioning
confidence: 99%
“…A set of CR user current path states are taken as s = { s 1 , s 2 … s n }, where s 1 , s 2 represents the geographical co‐ordinates (latitude and longitude). The CR user's path from state s 1 to state s n is represented in transition matrix which are formed using Markov's Chain algorithm as follows P=[]ρ11.5emρ120.75em0.75emρ1mρ21.5emρ220.75em0.75emρ2m0.5em0.5em0.5em0.5emρm1.5emρm20.75em0.75emρmm where m is the possible number transitions.…”
Section: Proposed Methodsmentioning
confidence: 99%
“…In [73], subscriber's mobility is predicted using the enhanced Markov chain algorithm. The core idea is to add the behavior pattern and temporal data of the users from CDR into the Local Prediction Algorithm (LPA) and the Global Prediction Algorithm (GPA).…”
Section: B) Enhanced-markov Chainmentioning
confidence: 99%
“…The mobility history of the user is recorded and probability of user transition into next cell is derived. The common methods of deriving probability of transition into next cell involve Markov chain model [5], hidden markov model [6], neural networks and machine learning [7], route clustering [8] etc. 2) Measurement based: These schemes do not rely on the user mobility history rather they derive probability of user transition to next cell based on real time measurements (e.g., RSSI, geometry, user angle, distance etc).…”
Section: Related Workmentioning
confidence: 99%