Pub Date : 2018-02-01DOI: 10.1109/NTMS.2018.8328684
Massimo Gallo, S. Ghamri-Doudane, Fabio Pianese
The emergence of the Internet of Things (IoT) as an increasingly pervasive influx of connected devices into people's everyday lives calls for an appropriate level of support by the network. Considering societal issues related to the data produced by IoT devices such as privacy and data ownership, together with technical issues of confidentiality, isolation, and scalability of the IoT server infrastructure, we observe that the present cloud computing model based on large-scale consolidated databases and services may not be universally applicable. In this paper we make a case for supporting IoT backends via network function virtualization (NFV) as a way to better align user privacy needs with the strong technical guarantees that purpose-built virtualized network functions can provide.
{"title":"CliMBOS: A Modular NFV Cloud Backend for the Internet of Things","authors":"Massimo Gallo, S. Ghamri-Doudane, Fabio Pianese","doi":"10.1109/NTMS.2018.8328684","DOIUrl":"https://doi.org/10.1109/NTMS.2018.8328684","url":null,"abstract":"The emergence of the Internet of Things (IoT) as an increasingly pervasive influx of connected devices into people's everyday lives calls for an appropriate level of support by the network. Considering societal issues related to the data produced by IoT devices such as privacy and data ownership, together with technical issues of confidentiality, isolation, and scalability of the IoT server infrastructure, we observe that the present cloud computing model based on large-scale consolidated databases and services may not be universally applicable. In this paper we make a case for supporting IoT backends via network function virtualization (NFV) as a way to better align user privacy needs with the strong technical guarantees that purpose-built virtualized network functions can provide.","PeriodicalId":140704,"journal":{"name":"2018 9th IFIP International Conference on New Technologies, Mobility and Security (NTMS)","volume":"105 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121201792","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2018-02-01DOI: 10.1109/NTMS.2018.8328738
Mikael Asplund, Jakob Lovhall, S. Nadjm-Tehrani
The possibility of in-store payments would further increase the potential usefulness of cryptocurrencies. However, this would require much faster transaction verification than current solutions provide (one hour for Bitcoin) since customers are likely not prepared to wait a very long time for their purchase to be accepted by a store. We propose a solution for enabling in-store payments with waiting times in the order of a few seconds, which is still compatible with the current Bitcoin protocol. The idea is based on a payment card in combination with a protocol for ensuring that losing a card does not mean losing the money on it. We analyse the required transaction verification delay and also the potentially added risks that the solution brings compared to current systems.
{"title":"In-Store Payments Using Bitcoin","authors":"Mikael Asplund, Jakob Lovhall, S. Nadjm-Tehrani","doi":"10.1109/NTMS.2018.8328738","DOIUrl":"https://doi.org/10.1109/NTMS.2018.8328738","url":null,"abstract":"The possibility of in-store payments would further increase the potential usefulness of cryptocurrencies. However, this would require much faster transaction verification than current solutions provide (one hour for Bitcoin) since customers are likely not prepared to wait a very long time for their purchase to be accepted by a store. We propose a solution for enabling in-store payments with waiting times in the order of a few seconds, which is still compatible with the current Bitcoin protocol. The idea is based on a payment card in combination with a protocol for ensuring that losing a card does not mean losing the money on it. We analyse the required transaction verification delay and also the potentially added risks that the solution brings compared to current systems.","PeriodicalId":140704,"journal":{"name":"2018 9th IFIP International Conference on New Technologies, Mobility and Security (NTMS)","volume":"465 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115629141","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2018-02-01DOI: 10.1109/NTMS.2018.8328707
Jen-Chieh Hsu, R. Tso, Yu-Chi Chen, Mu-En Wu
Oblivious transfer (OT) protocol is a fundamental building block of cryptography and can be applied widely in many fields. A secure oblivious transfer protocol is supposed to ensure the privacy of both senders and receivers. The privacy of receivers means that the information being selected by receivers would never be revealed to senders. On the other hand, the privacy of senders means that receivers have no further information except for the one that has been selected. In this case, senders are able to deceive receivers by sending same messages. Likewise, in existing 1-out-of-n OT protocols, malicious senders can make all the n messages the same, so that receivers will always get the specific one assigned by senders. This indicates that privacy of receivers wouldnt work under the 1-out-of-n OT protocol. To prevent this kind of attack, this paper provides a general framework on how to design a secure OT protocol based on commutative and ciphertext equality test and take RSA as an example to explain how the protocol is processed.
遗忘传输(OT)协议是密码学的基本组成部分，在许多领域有着广泛的应用。安全无关传输协议应该确保发送方和接收方的隐私。接收方的隐私性意味着接收方选择的信息永远不会泄露给发送方。另一方面，发送者的隐私意味着接收者除了已选择的信息之外没有其他信息。在这种情况下，发送方可以通过发送相同的消息来欺骗接收方。同样，在现有的1 / n OT协议中，恶意的发送方可以使所有n条消息都相同，因此接收方总是得到发送方分配的特定消息。这表明接收者的隐私在1-out- n OT协议下无法工作。为了防止这种攻击，本文提供了一个基于交换和密文相等性检验的安全OT协议设计的一般框架，并以RSA为例说明了协议的处理过程。
{"title":"Oblivious Transfer Protocols Based on Commutative Encryption","authors":"Jen-Chieh Hsu, R. Tso, Yu-Chi Chen, Mu-En Wu","doi":"10.1109/NTMS.2018.8328707","DOIUrl":"https://doi.org/10.1109/NTMS.2018.8328707","url":null,"abstract":"Oblivious transfer (OT) protocol is a fundamental building block of cryptography and can be applied widely in many fields. A secure oblivious transfer protocol is supposed to ensure the privacy of both senders and receivers. The privacy of receivers means that the information being selected by receivers would never be revealed to senders. On the other hand, the privacy of senders means that receivers have no further information except for the one that has been selected. In this case, senders are able to deceive receivers by sending same messages. Likewise, in existing 1-out-of-n OT protocols, malicious senders can make all the n messages the same, so that receivers will always get the specific one assigned by senders. This indicates that privacy of receivers wouldnt work under the 1-out-of-n OT protocol. To prevent this kind of attack, this paper provides a general framework on how to design a secure OT protocol based on commutative and ciphertext equality test and take RSA as an example to explain how the protocol is processed.","PeriodicalId":140704,"journal":{"name":"2018 9th IFIP International Conference on New Technologies, Mobility and Security (NTMS)","volume":"63 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115740466","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2018-02-01DOI: 10.1109/NTMS.2018.8328730
A. Adli
Star projection was always the central part of planetarium since the first planetarium opened its doors to the public in 1923. Since then a lot of things changes, and new technologies become available with the digital planetariums and their advantages. We will briefly describe some of these technologies and the industry possible future trends.
{"title":"Star Projection Technologies in the Modern Planetarium Industry","authors":"A. Adli","doi":"10.1109/NTMS.2018.8328730","DOIUrl":"https://doi.org/10.1109/NTMS.2018.8328730","url":null,"abstract":"Star projection was always the central part of planetarium since the first planetarium opened its doors to the public in 1923. Since then a lot of things changes, and new technologies become available with the digital planetariums and their advantages. We will briefly describe some of these technologies and the industry possible future trends.","PeriodicalId":140704,"journal":{"name":"2018 9th IFIP International Conference on New Technologies, Mobility and Security (NTMS)","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114374812","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2018-02-01DOI: 10.1109/NTMS.2018.8328675
J. E. Rubio, Cristina Alcaraz, Javier López
The Open Charge Point Protocol (OCPP) is a communication standard for the exchange of data between a Charge Point (CP) and the Central Server (CS) in the electric vehicle domain. This protocol is envisioned to offer interoperability between the different manufacturers of charging points, network systems and IT back-end vendors. However, the current version of the specification is quite vague in terms of handling security and privacy, which results in a set of non-addressed threats, which we look at in this paper. Specifically, this paper focuses on Man-in-the-Middle attacks between the CP and the CS that may expose sensitive data of special interest to the various stake-holders involved in this context. As a counter-measure, we present a feasible solution and assess its behaviour in a simulator. The inclusion of additional security mechanisms is also studied, in compliance with the IEC 62351 standard.
{"title":"Addressing Security in OCPP: Protection Against Man-in-the-Middle Attacks","authors":"J. E. Rubio, Cristina Alcaraz, Javier López","doi":"10.1109/NTMS.2018.8328675","DOIUrl":"https://doi.org/10.1109/NTMS.2018.8328675","url":null,"abstract":"The Open Charge Point Protocol (OCPP) is a communication standard for the exchange of data between a Charge Point (CP) and the Central Server (CS) in the electric vehicle domain. This protocol is envisioned to offer interoperability between the different manufacturers of charging points, network systems and IT back-end vendors. However, the current version of the specification is quite vague in terms of handling security and privacy, which results in a set of non-addressed threats, which we look at in this paper. Specifically, this paper focuses on Man-in-the-Middle attacks between the CP and the CS that may expose sensitive data of special interest to the various stake-holders involved in this context. As a counter-measure, we present a feasible solution and assess its behaviour in a simulator. The inclusion of additional security mechanisms is also studied, in compliance with the IEC 62351 standard.","PeriodicalId":140704,"journal":{"name":"2018 9th IFIP International Conference on New Technologies, Mobility and Security (NTMS)","volume":"60 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114869986","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2018-02-01DOI: 10.1109/NTMS.2018.8328724
Dong Kyoo Kim
This study presents wireless vital signal tracking results of multi-carrier micro-Doppler radar installed in driver's seatback, which can be used to develop new e-healthcare services of smart cars in the future. The multi-carrier micro-Doppler radar utilize multiple frequencies to measure driver's vital signal in order to overcome the measurement deterioration by unwanted radar and radar movement. The method is briefly described in this paper. To evaluate the performance of the method for the driver's vital signal tracking, we installed the radar into driver's seatback in an automobile. In some scenarios, driver's heartbeat and respiration rate are measured in the automobile. We present the experiment setup and results for four volunteers' measurement data. The results show that the heartbeat rate tracking performance of the driver's seatback radar is better than the respiration tracking.
{"title":"Wireless Vital Signal Tracking for Drivers Using Micro-Doppler Seatback Radar","authors":"Dong Kyoo Kim","doi":"10.1109/NTMS.2018.8328724","DOIUrl":"https://doi.org/10.1109/NTMS.2018.8328724","url":null,"abstract":"This study presents wireless vital signal tracking results of multi-carrier micro-Doppler radar installed in driver's seatback, which can be used to develop new e-healthcare services of smart cars in the future. The multi-carrier micro-Doppler radar utilize multiple frequencies to measure driver's vital signal in order to overcome the measurement deterioration by unwanted radar and radar movement. The method is briefly described in this paper. To evaluate the performance of the method for the driver's vital signal tracking, we installed the radar into driver's seatback in an automobile. In some scenarios, driver's heartbeat and respiration rate are measured in the automobile. We present the experiment setup and results for four volunteers' measurement data. The results show that the heartbeat rate tracking performance of the driver's seatback radar is better than the respiration tracking.","PeriodicalId":140704,"journal":{"name":"2018 9th IFIP International Conference on New Technologies, Mobility and Security (NTMS)","volume":"184 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122856210","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2018-02-01DOI: 10.1109/NTMS.2018.8328683
Yoshitaka Nakamura, Shihori Kanazawa, H. Inamura, Osamu Takahashi
Recently, cyber attacks through Web sites such as Drive-by download attacks or phishing attacks are increasing rapidly. The attackers can illegally acquire personal information of users by these attacks and cause economical damages. We aim to detect malicious Web sites which cause economic damages. The analysis of the features of the network address part of the IP address revealed that the features of malicious IP address has time change. Therefore, reflecting the time changes of these features, we classified unknown malicious Web sites. As a result of the evaluation experiment, classification accuracy could be improved.
{"title":"Classification of Unknown Web Sites Based on Yearly Changes of Distribution Information of Malicious IP Addresses","authors":"Yoshitaka Nakamura, Shihori Kanazawa, H. Inamura, Osamu Takahashi","doi":"10.1109/NTMS.2018.8328683","DOIUrl":"https://doi.org/10.1109/NTMS.2018.8328683","url":null,"abstract":"Recently, cyber attacks through Web sites such as Drive-by download attacks or phishing attacks are increasing rapidly. The attackers can illegally acquire personal information of users by these attacks and cause economical damages. We aim to detect malicious Web sites which cause economic damages. The analysis of the features of the network address part of the IP address revealed that the features of malicious IP address has time change. Therefore, reflecting the time changes of these features, we classified unknown malicious Web sites. As a result of the evaluation experiment, classification accuracy could be improved.","PeriodicalId":140704,"journal":{"name":"2018 9th IFIP International Conference on New Technologies, Mobility and Security (NTMS)","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129848763","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2018-02-01DOI: 10.1109/NTMS.2018.8328677
D. Rao, D. S. Kumar, P. S. Thilagam
Searchable Encryption (SE) schemes provide security and privacy to the cloud data. The existing SE approaches enable multiple users to perform search operation by using various schemes like Broadcast Encryption (BE), Attribute-Based Encryption (ABE), etc. However, these schemes do not allow multiple users to perform the search operation over the encrypted data of multiple owners. Some SE schemes involve a Proxy Server (PS) that allow multiple users to perform the search operation. However, these approaches incur huge computational burden on PS due to the repeated encryption of the user queries for transformation purpose so as to ensure that users' query is searchable over the encrypted data of multiple owners. Hence, to eliminate this computational burden on PS, this paper proposes a secure proxy server approach that performs the search operation without transforming the user queries. This approach also returns the top-k relevant documents to the user queries by using Euclidean distance similarity approach. Based on the experimental study, this approach is efficient with respect to search time and accuracy.
{"title":"An Efficient Multi-User Searchable Encryption Scheme without Query Transformation over Outsourced Encrypted Data","authors":"D. Rao, D. S. Kumar, P. S. Thilagam","doi":"10.1109/NTMS.2018.8328677","DOIUrl":"https://doi.org/10.1109/NTMS.2018.8328677","url":null,"abstract":"Searchable Encryption (SE) schemes provide security and privacy to the cloud data. The existing SE approaches enable multiple users to perform search operation by using various schemes like Broadcast Encryption (BE), Attribute-Based Encryption (ABE), etc. However, these schemes do not allow multiple users to perform the search operation over the encrypted data of multiple owners. Some SE schemes involve a Proxy Server (PS) that allow multiple users to perform the search operation. However, these approaches incur huge computational burden on PS due to the repeated encryption of the user queries for transformation purpose so as to ensure that users' query is searchable over the encrypted data of multiple owners. Hence, to eliminate this computational burden on PS, this paper proposes a secure proxy server approach that performs the search operation without transforming the user queries. This approach also returns the top-k relevant documents to the user queries by using Euclidean distance similarity approach. Based on the experimental study, this approach is efficient with respect to search time and accuracy.","PeriodicalId":140704,"journal":{"name":"2018 9th IFIP International Conference on New Technologies, Mobility and Security (NTMS)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128802407","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2018-02-01DOI: 10.1109/NTMS.2018.8328710
Hesham H. Alsaadi, M. Aldwairi, May Al Taei, Mansoor AlBuainain, Maktoom AlKubaisi
This research presents a penetration testing approach to help secure OpenSSH service on Raspberry Pi 2. The study discusses a technique for penetrating Debian v7.1p2, installed on Raspberry Pi 2, using Kali Linux. We exploit the vulnerability found in SSH protocol exchange keys, which causes multiple CRLF injections in Raspberry Pi 2 Model B, allowing remote authenticated users to bypass intended shell-command restrictions via well crafted X11 data forwarding. We propose an innovative security model to solve the issues of allowing remote authentication access using SSH protocol exchange keys without affecting the encrypted protocols transmissions. We conclude with recommendations on how to securely mitigate MITM attacks using our secure proposed model.
本研究提出了一种渗透测试方法来帮助确保Raspberry Pi 2上OpenSSH服务的安全。该研究讨论了一种使用Kali Linux渗透安装在Raspberry Pi 2上的Debian v7.1p2的技术。我们利用在SSH协议交换密钥中发现的漏洞，该漏洞导致Raspberry Pi 2 Model B中的多个CRLF注入，允许远程认证用户通过精心制作的X11数据转发绕过预期的shell命令限制。我们提出了一种创新的安全模型来解决使用SSH协议交换密钥允许远程身份验证访问而不影响加密协议传输的问题。最后，我们就如何使用我们建议的安全模型安全地减轻MITM攻击提出了建议。
{"title":"Penetration and Security of OpenSSH Remote Secure Shell Service on Raspberry Pi 2","authors":"Hesham H. Alsaadi, M. Aldwairi, May Al Taei, Mansoor AlBuainain, Maktoom AlKubaisi","doi":"10.1109/NTMS.2018.8328710","DOIUrl":"https://doi.org/10.1109/NTMS.2018.8328710","url":null,"abstract":"This research presents a penetration testing approach to help secure OpenSSH service on Raspberry Pi 2. The study discusses a technique for penetrating Debian v7.1p2, installed on Raspberry Pi 2, using Kali Linux. We exploit the vulnerability found in SSH protocol exchange keys, which causes multiple CRLF injections in Raspberry Pi 2 Model B, allowing remote authenticated users to bypass intended shell-command restrictions via well crafted X11 data forwarding. We propose an innovative security model to solve the issues of allowing remote authentication access using SSH protocol exchange keys without affecting the encrypted protocols transmissions. We conclude with recommendations on how to securely mitigate MITM attacks using our secure proposed model.","PeriodicalId":140704,"journal":{"name":"2018 9th IFIP International Conference on New Technologies, Mobility and Security (NTMS)","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116745842","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2018-02-01DOI: 10.1109/NTMS.2018.8328691
C. Bouras, N. Kanakis
The fifth generation of mobile technology (5G) is positioned to address the demands and business contexts of 2020 and beyond. Therefore, in 5G, there is a need to push the envelope of performance to provide, where needed, for example, much greater throughput, much lower latency, ultra-high reliability, much higher connectivity density, and higher mobility range. A crucial point in the effective provisioning of 5G Next Generation Mobile Networks (NGMN) lies in the efficient error control and in more details in the utilization of Forward Error Correction (FEC) codes on the application layer. FEC is a method for error control of data transmission adopted in several mobile multicast standards. FEC is a feedback free error recovery method where the sender introduces redundant data in advance with the source data enabling the recipient to recover from different arbitrary packet losses. Recently, the adoption of FEC error control method has been boosted by the introduction of powerful Application Layer FEC (AL-FEC) codes. Furthermore, several works have emerged aiming to address the efficient application of ALFEC protection introducing deterministic or randomized online algorithms. In this work we propose a novel AL-FEC scheme based on online algorithms forced by the well stated AL-FEC policy online problem. We present an algorithm which exploits feedback capabilities of the mobile users regarding the outcome of a transmission, and adapts the introduced protection respectively. Moreover, we provide an extensive analysis of the proposed ALFEC algorithm accompanied by a performance evaluation against common error protection schemes.
{"title":"Evolving AL-FEC Application Towards 5G NGMN","authors":"C. Bouras, N. Kanakis","doi":"10.1109/NTMS.2018.8328691","DOIUrl":"https://doi.org/10.1109/NTMS.2018.8328691","url":null,"abstract":"The fifth generation of mobile technology (5G) is positioned to address the demands and business contexts of 2020 and beyond. Therefore, in 5G, there is a need to push the envelope of performance to provide, where needed, for example, much greater throughput, much lower latency, ultra-high reliability, much higher connectivity density, and higher mobility range. A crucial point in the effective provisioning of 5G Next Generation Mobile Networks (NGMN) lies in the efficient error control and in more details in the utilization of Forward Error Correction (FEC) codes on the application layer. FEC is a method for error control of data transmission adopted in several mobile multicast standards. FEC is a feedback free error recovery method where the sender introduces redundant data in advance with the source data enabling the recipient to recover from different arbitrary packet losses. Recently, the adoption of FEC error control method has been boosted by the introduction of powerful Application Layer FEC (AL-FEC) codes. Furthermore, several works have emerged aiming to address the efficient application of ALFEC protection introducing deterministic or randomized online algorithms. In this work we propose a novel AL-FEC scheme based on online algorithms forced by the well stated AL-FEC policy online problem. We present an algorithm which exploits feedback capabilities of the mobile users regarding the outcome of a transmission, and adapts the introduced protection respectively. Moreover, we provide an extensive analysis of the proposed ALFEC algorithm accompanied by a performance evaluation against common error protection schemes.","PeriodicalId":140704,"journal":{"name":"2018 9th IFIP International Conference on New Technologies, Mobility and Security (NTMS)","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128404847","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：