Next-cell Prediction Based on Cell Sequence History and Intra-cell Trajectory

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.
基于细胞序列历史和细胞内轨迹的下一个细胞预测
在这项工作中,我们研究了一种新的基于用户过去长期和短期轨迹的移动性预测算法。特别是,我们通过使用长期轨迹历史训练马尔可夫更新过程(MRP)来感知用户运动的规律性。此外,利用记录在当前驻留单元内的短期轨迹数据,将用户行为的可能随机性纳入算法。事实上,每个相邻的细胞被分配了两个不同的概率被选为下一个交叉细胞,一个由MRP给出,而另一个由当前细胞的运动方向获得。最后,将分配的概率,即从上述两个轨迹数据集中提取的信息片段,结合Dempster-Shafer理论,得出关于未来交叉单元的最佳决策。仿真结果表明,该算法预测下一个交叉单元的准确率在70%左右。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信
小红书