基于配对函数和数据分析的移动样本编码新方案

P. Fazio, M. Mehic, P. Partila, J. Továrek, M. Voznák
{"title":"基于配对函数和数据分析的移动样本编码新方案","authors":"P. Fazio, M. Mehic, P. Partila, J. Továrek, M. Voznák","doi":"10.1109/DS-RT50469.2020.9213601","DOIUrl":null,"url":null,"abstract":"In the modern telecommunication systems, mobility is one of the key advantage of wireless communications, given that it is possible to transmit/receive data, without caring of having a static position into the network. Of course, mobility poses special issues such as degradations, channel quality fluctuations, fast topology changes, and so on. Modern researches focus their attention on predicting mobile future node positions, in order to a-priori know, for example, what the evolution of the network topology will be or which level of stability each node will reach. Each prediction scheme is based on the storage and analysis of several historical mobility trajectories, in order to train the proper prediction algorithm. In this paper, we focus our attention on the optimization of the space needed to store historical mobility samples, encoding their values and evaluating the conversion error, comparing different encoding functions. Several simulation campaigns have been carried out in order to evaluate the goodness and feasibility of our proposal.","PeriodicalId":149260,"journal":{"name":"2020 IEEE/ACM 24th International Symposium on Distributed Simulation and Real Time Applications (DS-RT)","volume":"64 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2020-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"A New Mobility Samples Encoding Scheme Based on Pairing Functions and Data Analytics\",\"authors\":\"P. Fazio, M. Mehic, P. Partila, J. Továrek, M. Voznák\",\"doi\":\"10.1109/DS-RT50469.2020.9213601\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In the modern telecommunication systems, mobility is one of the key advantage of wireless communications, given that it is possible to transmit/receive data, without caring of having a static position into the network. Of course, mobility poses special issues such as degradations, channel quality fluctuations, fast topology changes, and so on. Modern researches focus their attention on predicting mobile future node positions, in order to a-priori know, for example, what the evolution of the network topology will be or which level of stability each node will reach. Each prediction scheme is based on the storage and analysis of several historical mobility trajectories, in order to train the proper prediction algorithm. In this paper, we focus our attention on the optimization of the space needed to store historical mobility samples, encoding their values and evaluating the conversion error, comparing different encoding functions. Several simulation campaigns have been carried out in order to evaluate the goodness and feasibility of our proposal.\",\"PeriodicalId\":149260,\"journal\":{\"name\":\"2020 IEEE/ACM 24th International Symposium on Distributed Simulation and Real Time Applications (DS-RT)\",\"volume\":\"64 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2020-09-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2020 IEEE/ACM 24th International Symposium on Distributed Simulation and Real Time Applications (DS-RT)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/DS-RT50469.2020.9213601\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2020 IEEE/ACM 24th International Symposium on Distributed Simulation and Real Time Applications (DS-RT)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/DS-RT50469.2020.9213601","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

在现代电信系统中,移动性是无线通信的关键优势之一,因为它可以传输/接收数据,而不必关心网络中的静态位置。当然,移动性会带来一些特殊的问题,比如性能下降、信道质量波动、快速拓扑变化等等。现代研究的重点是预测未来移动节点的位置,以便先验地知道网络拓扑将如何演变,或者每个节点将达到哪个稳定水平。每种预测方案都是基于对多个历史移动轨迹的存储和分析,以训练合适的预测算法。在本文中,我们的重点是优化存储历史移动样本所需的空间,编码它们的值并评估转换误差,比较不同的编码函数。为了评估我们的建议的有效性和可行性,进行了几次仿真活动。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
A New Mobility Samples Encoding Scheme Based on Pairing Functions and Data Analytics
In the modern telecommunication systems, mobility is one of the key advantage of wireless communications, given that it is possible to transmit/receive data, without caring of having a static position into the network. Of course, mobility poses special issues such as degradations, channel quality fluctuations, fast topology changes, and so on. Modern researches focus their attention on predicting mobile future node positions, in order to a-priori know, for example, what the evolution of the network topology will be or which level of stability each node will reach. Each prediction scheme is based on the storage and analysis of several historical mobility trajectories, in order to train the proper prediction algorithm. In this paper, we focus our attention on the optimization of the space needed to store historical mobility samples, encoding their values and evaluating the conversion error, comparing different encoding functions. Several simulation campaigns have been carried out in order to evaluate the goodness and feasibility of our proposal.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术文献互助群
群 号:481959085
Book学术官方微信