M. Goodarzi, N. Maletic, J. Gutiérrez, V. Sark, E. Grass
{"title":"Next-cell Prediction Based on Cell Sequence History and Intra-cell Trajectory","authors":"M. Goodarzi, N. Maletic, J. Gutiérrez, V. Sark, E. Grass","doi":"10.1109/ICIN.2019.8685910","DOIUrl":null,"url":null,"abstract":"In this work, we study a novel mobility prediction algorithm based on past long-term and short-term trajectories of users. In particular, we perceive the regularity of users’ movements by training a Markov Renewal Process (MRP) using the long-term trajectory history. Moreover, short-term trajectory data, recorded within the current residing cell, is utilized to incorporate possible randomness of users’ behavior into the algorithm. In fact, each neighboring cell is assigned two distinct probabilities of being chosen as next crossing cell, one given by MRP, while another is obtained from the direction of movements across the current cell. Lastly, assigned probabilities, i.e. the pieces of information extracted from the two aforementioned trajectory data sets, are combined with the aid of Dempster-Shafer theory to reach the best possible decision about the future crossing cell. Simulation results illustrate that the algorithm reliably predicts the next crossing cell with around 70% accuracy.","PeriodicalId":162236,"journal":{"name":"2019 22nd Conference on Innovation in Clouds, Internet and Networks and Workshops (ICIN)","volume":"93 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"7","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2019 22nd Conference on Innovation in Clouds, Internet and Networks and Workshops (ICIN)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICIN.2019.8685910","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 7
Abstract
In this work, we study a novel mobility prediction algorithm based on past long-term and short-term trajectories of users. In particular, we perceive the regularity of users’ movements by training a Markov Renewal Process (MRP) using the long-term trajectory history. Moreover, short-term trajectory data, recorded within the current residing cell, is utilized to incorporate possible randomness of users’ behavior into the algorithm. In fact, each neighboring cell is assigned two distinct probabilities of being chosen as next crossing cell, one given by MRP, while another is obtained from the direction of movements across the current cell. Lastly, assigned probabilities, i.e. the pieces of information extracted from the two aforementioned trajectory data sets, are combined with the aid of Dempster-Shafer theory to reach the best possible decision about the future crossing cell. Simulation results illustrate that the algorithm reliably predicts the next crossing cell with around 70% accuracy.