Pub Date : 2019-01-01DOI: 10.1109/ICOIN.2019.8718173
Yuya Kumai, Koki Hongyo, Tomotaka Kimura, K. Hirata
In the past, the concept of self-evolving botnets, where computing resources of infected hosts are exploited to discover vulnerabilities, have been introduced in the literature. This paper proposes a deterministic epidemic model that represents the infection dynamics of self-evolving botnets. The proposed epidemic model represents the infection dynamics of the self-evolving botnet with ordinary differential equations based on a Susceptible-Infected-Recovered-Susceptible model, which is widely used for general epidemic models of malware infection. Through numerical calculations, we show the infection behavior of self-evolving botnets.
{"title":"Infection Dynamics of Self-Evolving Botnets with Deterministic Modeling","authors":"Yuya Kumai, Koki Hongyo, Tomotaka Kimura, K. Hirata","doi":"10.1109/ICOIN.2019.8718173","DOIUrl":"https://doi.org/10.1109/ICOIN.2019.8718173","url":null,"abstract":"In the past, the concept of self-evolving botnets, where computing resources of infected hosts are exploited to discover vulnerabilities, have been introduced in the literature. This paper proposes a deterministic epidemic model that represents the infection dynamics of self-evolving botnets. The proposed epidemic model represents the infection dynamics of the self-evolving botnet with ordinary differential equations based on a Susceptible-Infected-Recovered-Susceptible model, which is widely used for general epidemic models of malware infection. Through numerical calculations, we show the infection behavior of self-evolving botnets.","PeriodicalId":422041,"journal":{"name":"2019 International Conference on Information Networking (ICOIN)","volume":"79 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116416239","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 : 2019-01-01DOI: 10.1109/ICOIN.2019.8718198
Varun Amrutiya, S. Jhamb, Pranjal Priyadarshi, Ashutosh Bhatia
Two-factor authentication (2FA) is widely prevalent in banking, emails and virtual private networks (VPN) connections or in accessing any secure web service. In 2FA, to get authenticated the users are expected to provide additional secret information along with the password. Typically, this secret information (tokens) is generated by a centralized trusted third party upon receiving an authentication request from users. Thus, this additional layer of security comes at the cost of inherently trusting the third party for their services. The security of such authentication systems is always under the threat of the trusted party is being compromised. In this paper, we propose a novel approach to make server authentication even more secure by building 2FA over the blockchain platform which is distributed in nature. The proposed solution does not require any trusted third party between claimant (user) and the verifier (server) for the authentication purpose. To demonstrate the idea of using blockchain technology for 2FA, we have added an extra layer of security component to the OpenSSH server a widely used application for Secure Shell (SSH) protocol.
{"title":"Trustless Two-Factor Authentication Using Smart Contracts in Blockchains","authors":"Varun Amrutiya, S. Jhamb, Pranjal Priyadarshi, Ashutosh Bhatia","doi":"10.1109/ICOIN.2019.8718198","DOIUrl":"https://doi.org/10.1109/ICOIN.2019.8718198","url":null,"abstract":"Two-factor authentication (2FA) is widely prevalent in banking, emails and virtual private networks (VPN) connections or in accessing any secure web service. In 2FA, to get authenticated the users are expected to provide additional secret information along with the password. Typically, this secret information (tokens) is generated by a centralized trusted third party upon receiving an authentication request from users. Thus, this additional layer of security comes at the cost of inherently trusting the third party for their services. The security of such authentication systems is always under the threat of the trusted party is being compromised. In this paper, we propose a novel approach to make server authentication even more secure by building 2FA over the blockchain platform which is distributed in nature. The proposed solution does not require any trusted third party between claimant (user) and the verifier (server) for the authentication purpose. To demonstrate the idea of using blockchain technology for 2FA, we have added an extra layer of security component to the OpenSSH server a widely used application for Secure Shell (SSH) protocol.","PeriodicalId":422041,"journal":{"name":"2019 International Conference on Information Networking (ICOIN)","volume":"48 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116943978","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 : 2019-01-01DOI: 10.1109/ICOIN.2019.8718180
Taketo Fukushima, M. Iio, K. Hirata, M. Yamamoto
In-network caching is a technique that stores contents in caches of routers, and thus reduces the loads for content servers and networks. To further enhance the performance of in-network caching, this paper proposes a popularity-based content cache management method. The proposed method divides the cached contents into some groups based on their popularity and manages information on content placement of each group in a distributed manner with a distributed hash table mechanism. The proposed method enables users to download contents stored in near routers with low overheads. This paper shows that the proposed method enhances the cache utilization efficiently through simulation experiments.
{"title":"Popularity-Based Content Cache Management for in-Network Caching","authors":"Taketo Fukushima, M. Iio, K. Hirata, M. Yamamoto","doi":"10.1109/ICOIN.2019.8718180","DOIUrl":"https://doi.org/10.1109/ICOIN.2019.8718180","url":null,"abstract":"In-network caching is a technique that stores contents in caches of routers, and thus reduces the loads for content servers and networks. To further enhance the performance of in-network caching, this paper proposes a popularity-based content cache management method. The proposed method divides the cached contents into some groups based on their popularity and manages information on content placement of each group in a distributed manner with a distributed hash table mechanism. The proposed method enables users to download contents stored in near routers with low overheads. This paper shows that the proposed method enhances the cache utilization efficiently through simulation experiments.","PeriodicalId":422041,"journal":{"name":"2019 International Conference on Information Networking (ICOIN)","volume":"59 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134512557","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 : 2019-01-01DOI: 10.1109/ICOIN.2019.8718176
Masaki Ueno, G. Hasegawa, M. Murata
Handling congestion in LTE/5G cellular networks has become a critical issue due to recent, rapid increase in cellular network traffic. Control plane congestion becomes particularly serious when accommodating massive M2M/IoT terminals into cellular networks. Although various methods have been proposed for accommodation of M2M/IoT terminals, most of them are mainly based on mathematical analysis and simulation experiments. In this paper, we show the experimental evaluation results of the performance of a mobile core network to assess the impact of bursty access from M2M/IoT terminals. First, we constructed our experimental environment based on open-source implementation of mobile core networks and emulated user terminals. Then, we conducted experiments on simultaneous attach requests from multiple user terminals and measured the processing delay at each mobile core node. The results of our evaluations proved that concentrating attach requests from forty user terminals increases the processing time at a mobility management entity (MME) by up to around 510% when an MME node is operated on a virtual machine with 1 GHz / 1 core CPU.
{"title":"Experimental Evaluation of Mobile Core Networks on Simultaneous Access from M2M/IoT Terminals","authors":"Masaki Ueno, G. Hasegawa, M. Murata","doi":"10.1109/ICOIN.2019.8718176","DOIUrl":"https://doi.org/10.1109/ICOIN.2019.8718176","url":null,"abstract":"Handling congestion in LTE/5G cellular networks has become a critical issue due to recent, rapid increase in cellular network traffic. Control plane congestion becomes particularly serious when accommodating massive M2M/IoT terminals into cellular networks. Although various methods have been proposed for accommodation of M2M/IoT terminals, most of them are mainly based on mathematical analysis and simulation experiments. In this paper, we show the experimental evaluation results of the performance of a mobile core network to assess the impact of bursty access from M2M/IoT terminals. First, we constructed our experimental environment based on open-source implementation of mobile core networks and emulated user terminals. Then, we conducted experiments on simultaneous attach requests from multiple user terminals and measured the processing delay at each mobile core node. The results of our evaluations proved that concentrating attach requests from forty user terminals increases the processing time at a mobility management entity (MME) by up to around 510% when an MME node is operated on a virtual machine with 1 GHz / 1 core CPU.","PeriodicalId":422041,"journal":{"name":"2019 International Conference on Information Networking (ICOIN)","volume":"34 10","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114021006","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 : 2019-01-01DOI: 10.1109/ICOIN.2019.8718196
Daiki Takemura, Atsusuke Murata, Kensei Miyakoshi, T. Yokotani, Y. Kobayashi, Y. Kobayashi
In manufacturing fields, the deployment of IoT has been discussed for creating new functionalities of products and for enhancing the manufacturing efficiency. However, most machines in a factory do not support communication interfaces for IoT. This study proposes monitoring systems using sensors and wireless networks for machines used in manufacturing, which lack communication interfaces. In addition, this study proposes monitoring the power consumption of machines using clamping current sensors and the status of machines using color sensors. These monitoring schemes do not impact traditional machines that lack communication interfaces. Furthermore, the network performance of the proposed monitoring system and the implementation of prototyping systems are also discussed.
{"title":"System Designing and Plototyping on IoT for a Factory","authors":"Daiki Takemura, Atsusuke Murata, Kensei Miyakoshi, T. Yokotani, Y. Kobayashi, Y. Kobayashi","doi":"10.1109/ICOIN.2019.8718196","DOIUrl":"https://doi.org/10.1109/ICOIN.2019.8718196","url":null,"abstract":"In manufacturing fields, the deployment of IoT has been discussed for creating new functionalities of products and for enhancing the manufacturing efficiency. However, most machines in a factory do not support communication interfaces for IoT. This study proposes monitoring systems using sensors and wireless networks for machines used in manufacturing, which lack communication interfaces. In addition, this study proposes monitoring the power consumption of machines using clamping current sensors and the status of machines using color sensors. These monitoring schemes do not impact traditional machines that lack communication interfaces. Furthermore, the network performance of the proposed monitoring system and the implementation of prototyping systems are also discussed.","PeriodicalId":422041,"journal":{"name":"2019 International Conference on Information Networking (ICOIN)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128749080","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 : 2019-01-01DOI: 10.1109/ICOIN.2019.8717976
Heesang Jin, Gyeongsik Yang, Bong-yeol Yu, C. Yoo
Virtualized software-defined networking (SDN) has been drawing increasing attention in data centers. SDN enables the creation of arbitrary and flexible virtual networks. However, given that the physical network is shared among multiple tenants, the throughput of a tenant can interfere with that of the other tenants, and the throughput requirement on each tenant cannot be met. To solve this problem, we propose TALON, a throughput allocation scheme based on traffic load-balancing. TALON allocates a throughput per tenant flow by calculating multiple paths to fulfill the traffic requirement. We design and implement TALON using an open-source network hypervisor. The evaluation results show that each tenant's throughput requirements are nearly met. In addition, the throughput increases by up to 2.29 times compared to that of a non-load-balancing network.
{"title":"TALON: Tenant Throughput Allocation Through Traffic Load-Balancing in Virtualized Software-Defined Networks","authors":"Heesang Jin, Gyeongsik Yang, Bong-yeol Yu, C. Yoo","doi":"10.1109/ICOIN.2019.8717976","DOIUrl":"https://doi.org/10.1109/ICOIN.2019.8717976","url":null,"abstract":"Virtualized software-defined networking (SDN) has been drawing increasing attention in data centers. SDN enables the creation of arbitrary and flexible virtual networks. However, given that the physical network is shared among multiple tenants, the throughput of a tenant can interfere with that of the other tenants, and the throughput requirement on each tenant cannot be met. To solve this problem, we propose TALON, a throughput allocation scheme based on traffic load-balancing. TALON allocates a throughput per tenant flow by calculating multiple paths to fulfill the traffic requirement. We design and implement TALON using an open-source network hypervisor. The evaluation results show that each tenant's throughput requirements are nearly met. In addition, the throughput increases by up to 2.29 times compared to that of a non-load-balancing network.","PeriodicalId":422041,"journal":{"name":"2019 International Conference on Information Networking (ICOIN)","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117034109","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 : 2019-01-01DOI: 10.1109/icufn.2013.6614759
{"title":"Publication & Copyright","authors":"","doi":"10.1109/icufn.2013.6614759","DOIUrl":"https://doi.org/10.1109/icufn.2013.6614759","url":null,"abstract":"","PeriodicalId":422041,"journal":{"name":"2019 International Conference on Information Networking (ICOIN)","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115497268","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 : 2019-01-01DOI: 10.1109/ICOIN.2019.8718178
Akashah Arshad, Z. Hanapi, S. Shamala, R. Latip
Scalability is an important design factor for evaluating the performance of routing protocols as the network size or traffic load increases. One of the most appropriate design methods is to use geographic routing approach to ensure scalability. This paper describes a scalability study comparing Secure Region Based Geographic Routing (SRBGR) and Dynamic Window Secure Implicit Geographic Forwarding (DWSIGF) protocols in various network density scenarios based on an end-to-end delay performance metric. The simulation studies were conducted in MATLAB 2106b where the network densities were varied according to the network topology size with increasing traffic rates. The results showed that DWSIGF has a lower end-to-end delay as compared to SRBGR for both sparse (15.4%) and high density (63.3%) network scenarios.Despite SRBGR having good security features, there is a need to improve the performance of its end-to-end delay to fulfil the application requirements.
{"title":"Performance Evaluation of the Geographic Routing Protocols Scalability","authors":"Akashah Arshad, Z. Hanapi, S. Shamala, R. Latip","doi":"10.1109/ICOIN.2019.8718178","DOIUrl":"https://doi.org/10.1109/ICOIN.2019.8718178","url":null,"abstract":"Scalability is an important design factor for evaluating the performance of routing protocols as the network size or traffic load increases. One of the most appropriate design methods is to use geographic routing approach to ensure scalability. This paper describes a scalability study comparing Secure Region Based Geographic Routing (SRBGR) and Dynamic Window Secure Implicit Geographic Forwarding (DWSIGF) protocols in various network density scenarios based on an end-to-end delay performance metric. The simulation studies were conducted in MATLAB 2106b where the network densities were varied according to the network topology size with increasing traffic rates. The results showed that DWSIGF has a lower end-to-end delay as compared to SRBGR for both sparse (15.4%) and high density (63.3%) network scenarios.Despite SRBGR having good security features, there is a need to improve the performance of its end-to-end delay to fulfil the application requirements.","PeriodicalId":422041,"journal":{"name":"2019 International Conference on Information Networking (ICOIN)","volume":"84 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115779032","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 : 2019-01-01DOI: 10.1109/ICOIN.2019.8718160
Jae-Hun Cho, Dongyeop Hwang, Ki-Hyung Kim
LoRa is one of the low power wide area communication technologies (LPWA) that enables low cost chip module design due to low power, high receiver sensitivity and license-exempt bandwidth. Because of this, It is a technology suitable for IoT services with low data throughput and variability. For low-power-based positioning in $L$ oRa environments While varinous techniques have been tried, The error is It is over a hundred meters. Because of this It is difficult to commercialize practical location services. In this paper, To reduce the TDoA positioning error, a train was made to correct the time error that occurs when transmitting. We propose a method of learning the time error in the DNN model and correcting it using the learned model in actual positioning. The experimental environment was constructed using python and keras. Experiment result, We confirmed that the error range decreases when the number of reference nodes and collected data are large and the mobile node is close to the reference node.
{"title":"Improving TDoA Based Positioning Accuracy Using Machine Learning in a LoRaWan Environment","authors":"Jae-Hun Cho, Dongyeop Hwang, Ki-Hyung Kim","doi":"10.1109/ICOIN.2019.8718160","DOIUrl":"https://doi.org/10.1109/ICOIN.2019.8718160","url":null,"abstract":"LoRa is one of the low power wide area communication technologies (LPWA) that enables low cost chip module design due to low power, high receiver sensitivity and license-exempt bandwidth. Because of this, It is a technology suitable for IoT services with low data throughput and variability. For low-power-based positioning in $L$ oRa environments While varinous techniques have been tried, The error is It is over a hundred meters. Because of this It is difficult to commercialize practical location services. In this paper, To reduce the TDoA positioning error, a train was made to correct the time error that occurs when transmitting. We propose a method of learning the time error in the DNN model and correcting it using the learned model in actual positioning. The experimental environment was constructed using python and keras. Experiment result, We confirmed that the error range decreases when the number of reference nodes and collected data are large and the mobile node is close to the reference node.","PeriodicalId":422041,"journal":{"name":"2019 International Conference on Information Networking (ICOIN)","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114738484","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 : 2019-01-01DOI: 10.1109/ICOIN.2019.8718112
Avinash Subramaniam, H. Tan, Hwee-Pink Tan
In this paper, we propose a low-cost Medication Events Monitoring System (MEMS) that can be deployed as a stand-alone solution for community dwelling seniors. The system comprises a mains-powered Raspberry Pi Zero W as the gateway, and a plastic box instrumented with a sensor node. The sensor node is composed of an Estimote beacon that is attached with a reed switch, and a magnet that is attached to the lid of the plastic box. We evaluate the performance of the MEMS in terms of its sensing accuracy and its transmission reliability through experiments conducted in a research laboratory environment. Our results suggest that the performance of the proposed MEMS depends on the event interval, as well as the distance between the MEMS node and the gateway. At 2m (8m) apart, reliable sensing and transmission can be achieved when the interval between box opening and closing events is 15 sec (20 sec) or greater. These conditions seem reasonable and will need to be further validated when deployed in a home setting for community dwelling seniors.
{"title":"BLE-Enabled Medication Events Monitoring System (MEMS) for Community Dwelling Seniors","authors":"Avinash Subramaniam, H. Tan, Hwee-Pink Tan","doi":"10.1109/ICOIN.2019.8718112","DOIUrl":"https://doi.org/10.1109/ICOIN.2019.8718112","url":null,"abstract":"In this paper, we propose a low-cost Medication Events Monitoring System (MEMS) that can be deployed as a stand-alone solution for community dwelling seniors. The system comprises a mains-powered Raspberry Pi Zero W as the gateway, and a plastic box instrumented with a sensor node. The sensor node is composed of an Estimote beacon that is attached with a reed switch, and a magnet that is attached to the lid of the plastic box. We evaluate the performance of the MEMS in terms of its sensing accuracy and its transmission reliability through experiments conducted in a research laboratory environment. Our results suggest that the performance of the proposed MEMS depends on the event interval, as well as the distance between the MEMS node and the gateway. At 2m (8m) apart, reliable sensing and transmission can be achieved when the interval between box opening and closing events is 15 sec (20 sec) or greater. These conditions seem reasonable and will need to be further validated when deployed in a home setting for community dwelling seniors.","PeriodicalId":422041,"journal":{"name":"2019 International Conference on Information Networking (ICOIN)","volume":"92 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128128626","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
扫码关注我们
求助内容：
应助结果提醒方式：