Pub Date : 2018-04-01DOI: 10.2991/ijndc.2018.6.2.2
L. Lazli, M. Boukadoum
{"title":"Hybrid Fuzzy - Possibilistic Clustering Model based on Genetic Optimization: Case Study on Brain Tissues of Patients with Alzheimer's Disease","authors":"L. Lazli, M. Boukadoum","doi":"10.2991/ijndc.2018.6.2.2","DOIUrl":"https://doi.org/10.2991/ijndc.2018.6.2.2","url":null,"abstract":"","PeriodicalId":318936,"journal":{"name":"Int. J. Networked Distributed Comput.","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2018-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116646161","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-04-01DOI: 10.2991/ijndc.2018.6.2.5
M. R. Regitha, Paul Varghese, Shailesh Sivan, Antony Nijo
1 Department of Computer Science, Sacred Heart College (Autonomous), Thevara, Kochi-682013, Kerala, India E-mail: regitha.baiju@gmail.com 2 Department of Iformation Technology, CUSAT, Thrikkakara, Kochi-682021, Kerala, India E-mail: vp.it.cusat@gmail.com 3 Department of Computer Science, Sacred Heart College (Autonomous) Thevara, Kochi-682013, Kerala, India E-mail: shaileshsivan@gmail.com 4 Department of Computer Science, Sacred Heart College (Autonomous) Thevara, Kochi-682013, Kerala, India E-mail: nijocmi@gmail.com
{"title":"Handoff Delay Optimization Using Hybrid Prediction Model","authors":"M. R. Regitha, Paul Varghese, Shailesh Sivan, Antony Nijo","doi":"10.2991/ijndc.2018.6.2.5","DOIUrl":"https://doi.org/10.2991/ijndc.2018.6.2.5","url":null,"abstract":"1 Department of Computer Science, Sacred Heart College (Autonomous), Thevara, Kochi-682013, Kerala, India E-mail: regitha.baiju@gmail.com 2 Department of Iformation Technology, CUSAT, Thrikkakara, Kochi-682021, Kerala, India E-mail: vp.it.cusat@gmail.com 3 Department of Computer Science, Sacred Heart College (Autonomous) Thevara, Kochi-682013, Kerala, India E-mail: shaileshsivan@gmail.com 4 Department of Computer Science, Sacred Heart College (Autonomous) Thevara, Kochi-682013, Kerala, India E-mail: nijocmi@gmail.com","PeriodicalId":318936,"journal":{"name":"Int. J. Networked Distributed Comput.","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2018-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126448181","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-04-01DOI: 10.2991/ijndc.2018.6.2.6
Gayoung Kim, M. Rim
One of the typical goals of the 5G mobile communication system1 is to establish an Internet of Things (IoT)2 environment in which all objects are connected to the network to generate and share information through not only mobile terminals but also mobile communication infrastructure. 5G must support Machine-Type Communication (MTC)3 in IoT, and it must effectively support many devices distributed at high density. The IoT environment for MTC support has low transmission power and a narrowband channel environment and interference environment so that many devices can connect with minimum energy. In this environment, data transmission performance is negatively affected by retransmission, deep fading, and interference. One way of solving this problem is to propose various kinds of channel-hopping methods in which a frequency is periodically changed every time a packet is transmitted. However, current channel-hopping techniques do not indicate the proper number of channels to be used. In this paper, we propose the Optimal Number of Channels (ONC) in channel hopping algorithm, a reference method that can provide the optimal channel number to improve channel performance in 5G massive IoT environments. We show that using a hopping method that minimizes service inefficiency reduces the number of channels and improves the Quality of Service (QoS) of the channel.
{"title":"Internet of Things in the 5G Mobile Communication System: The Optimal Number of Channels in Channel Hopping","authors":"Gayoung Kim, M. Rim","doi":"10.2991/ijndc.2018.6.2.6","DOIUrl":"https://doi.org/10.2991/ijndc.2018.6.2.6","url":null,"abstract":"One of the typical goals of the 5G mobile communication system1 is to establish an Internet of Things (IoT)2 environment in which all objects are connected to the network to generate and share information through not only mobile terminals but also mobile communication infrastructure. 5G must support Machine-Type Communication (MTC)3 in IoT, and it must effectively support many devices distributed at high density. The IoT environment for MTC support has low transmission power and a narrowband channel environment and interference environment so that many devices can connect with minimum energy. In this environment, data transmission performance is negatively affected by retransmission, deep fading, and interference. One way of solving this problem is to propose various kinds of channel-hopping methods in which a frequency is periodically changed every time a packet is transmitted. However, current channel-hopping techniques do not indicate the proper number of channels to be used. In this paper, we propose the Optimal Number of Channels (ONC) in channel hopping algorithm, a reference method that can provide the optimal channel number to improve channel performance in 5G massive IoT environments. We show that using a hopping method that minimizes service inefficiency reduces the number of channels and improves the Quality of Service (QoS) of the channel.","PeriodicalId":318936,"journal":{"name":"Int. J. Networked Distributed Comput.","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2018-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134162973","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 : 2017-12-01DOI: 10.2991/ijndc.2018.6.1.3
P. Dawar, N. S. Raghava, A. De
Antenna parameter optimization using S-shaped metamaterial embedded in antenna substrate at high frequency (THz) is elucidated in this paper. Upon incorporation of proposed metamaterials’ array inside the antenna substrate, bandwidth of antenna increases by 770 GHz and directivity by about 11%. Results obtained are well in coherence between FEM based Ansoft HFSS simulation and Matlab programming based on CAD formulas using equivalent circuit analysis of patch antenna. A low frequency (scaled) prototype of the proposed structure is fabricated and nearly 15% deviation is obtained in comparison with the simulation results.
{"title":"UWB, miniaturized and directive metamaterial loaded antenna for satellite applications","authors":"P. Dawar, N. S. Raghava, A. De","doi":"10.2991/ijndc.2018.6.1.3","DOIUrl":"https://doi.org/10.2991/ijndc.2018.6.1.3","url":null,"abstract":"Antenna parameter optimization using S-shaped metamaterial embedded in antenna substrate at high frequency (THz) is elucidated in this paper. Upon incorporation of proposed metamaterials’ array inside the antenna substrate, bandwidth of antenna increases by 770 GHz and directivity by about 11%. Results obtained are well in coherence between FEM based Ansoft HFSS simulation and Matlab programming based on CAD formulas using equivalent circuit analysis of patch antenna. A low frequency (scaled) prototype of the proposed structure is fabricated and nearly 15% deviation is obtained in comparison with the simulation results.","PeriodicalId":318936,"journal":{"name":"Int. J. Networked Distributed Comput.","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2017-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133783754","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 : 2017-12-01DOI: 10.2991/ijndc.2018.6.1.1
Krissada Rongrat, T. Senivongse
Information systems such as those in the Banking sector need to comply with security regulations to assure that necessary security controls are in place. This paper presents an initial risk assessment method to assist a banking information system project in validating security requirements of the system. Dissimilarity between the textual security requirements of the system and the security regulations is determined to identify security non-compliance. A risk index model is then proposed to determine the risk level based on the severity and likelihood of exploit of any security attack patterns that could potentially affect the system if the missing regulations are not implemented. In an experiment using a case study of nine Thai commercial banks and the IT Best Practices of the Bank of Thailand as the regulations, the performance of compliance checking is evaluated in terms of F-measure and accuracy. It is also found that there is a strong positive correlation, with the coefficient of over 0.6, between the risk indices from the method and the security expert judgment.
{"title":"Assessing Risk of Security Non-compliance of Banking Security Requirements Based on Attack Patterns","authors":"Krissada Rongrat, T. Senivongse","doi":"10.2991/ijndc.2018.6.1.1","DOIUrl":"https://doi.org/10.2991/ijndc.2018.6.1.1","url":null,"abstract":"Information systems such as those in the Banking sector need to comply with security regulations to assure that necessary security controls are in place. This paper presents an initial risk assessment method to assist a banking information system project in validating security requirements of the system. Dissimilarity between the textual security requirements of the system and the security regulations is determined to identify security non-compliance. A risk index model is then proposed to determine the risk level based on the severity and likelihood of exploit of any security attack patterns that could potentially affect the system if the missing regulations are not implemented. In an experiment using a case study of nine Thai commercial banks and the IT Best Practices of the Bank of Thailand as the regulations, the performance of compliance checking is evaluated in terms of F-measure and accuracy. It is also found that there is a strong positive correlation, with the coefficient of over 0.6, between the risk indices from the method and the security expert judgment.","PeriodicalId":318936,"journal":{"name":"Int. J. Networked Distributed Comput.","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2017-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127102754","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 : 2017-10-01DOI: 10.2991/ijndc.2017.5.4.6
S. Izumi, T. Tonda, N. Kawano, K. Satoh
We propose a method to estimate and visualize effects of a binary covariate on the longitudinally observed text data. Our method consists of series of analytical methods: extracting keywords through a morphological analysis, estimating the time-varying regression coefficient of a binary covariate for keyword's appearance and frequency, classifying summary of estimates, and visualizing the time-varying effects of a binary covariate in animated scatter plots. The procedure is demonstrated with Peace Declaration text data observed for forty years in two cities.
{"title":"Estimating and Visualizing the Time-varying Effects of a Binary Covariate on Longitudinal Big Text Data","authors":"S. Izumi, T. Tonda, N. Kawano, K. Satoh","doi":"10.2991/ijndc.2017.5.4.6","DOIUrl":"https://doi.org/10.2991/ijndc.2017.5.4.6","url":null,"abstract":"We propose a method to estimate and visualize effects of a binary covariate on the longitudinally observed text data. Our method consists of series of analytical methods: extracting keywords through a morphological analysis, estimating the time-varying regression coefficient of a binary covariate for keyword's appearance and frequency, classifying summary of estimates, and visualizing the time-varying effects of a binary covariate in animated scatter plots. The procedure is demonstrated with Peace Declaration text data observed for forty years in two cities.","PeriodicalId":318936,"journal":{"name":"Int. J. Networked Distributed Comput.","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2017-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131612783","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}
This paper focuses on an evaluation of coding violation warned by a static code analysis tool while considering the change history of violation and the authorship of source file. Through an empirical study with data collected from seven open source software projects, the following findings are reported: (1) the variety and the evaluation of a coding violation tend to vary accroding to the authoring type of the source file; (2) while important violations tend to vary from project to project, about 30% of violations are commonly disregarded by many programmers.
{"title":"An Evaluation of Coding Violation Focusing on Change History and Authorship of Source File","authors":"Aji Ery Burhandenny, Hirohisa Aman, Minoru Kawahara","doi":"10.2991/ijndc.2017.5.4.3","DOIUrl":"https://doi.org/10.2991/ijndc.2017.5.4.3","url":null,"abstract":"This paper focuses on an evaluation of coding violation warned by a static code analysis tool while considering the change history of violation and the authorship of source file. Through an empirical study with data collected from seven open source software projects, the following findings are reported: (1) the variety and the evaluation of a coding violation tend to vary accroding to the authoring type of the source file; (2) while important violations tend to vary from project to project, about 30% of violations are commonly disregarded by many programmers.","PeriodicalId":318936,"journal":{"name":"Int. J. Networked Distributed Comput.","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2017-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114593780","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 : 2017-09-01DOI: 10.2991/ijndc.2017.5.4.5
T. Hochin, Hiroki Nomiya
This paper improves the estimation of the amounts of sewage flow, which is one of daily life data, in order to manage them efficiently. The amounts of flow of a typical day are tried to be adjusted to those of a non-regular day. A typical (non-regular, respectively) day is a non-rainy day having good data and no (a few) outliers. The values for the adjustment are tried to be estimated by using the multiple regression analysis. It is shown that the estimation can be improved, and these values can be estimated by using the temperature of that day, the amount of the rain fall of the previous day, and the day type, which distinguishes a weekday, Saturday, Sunday, and a national holiday. The estimation is tried to be used in estimating the data of a regular day. It is experimentally shown that the estimation works well.
{"title":"Improvement and Evaluation of Estimation of Time Series Data of Daily Life","authors":"T. Hochin, Hiroki Nomiya","doi":"10.2991/ijndc.2017.5.4.5","DOIUrl":"https://doi.org/10.2991/ijndc.2017.5.4.5","url":null,"abstract":"This paper improves the estimation of the amounts of sewage flow, which is one of daily life data, in order to manage them efficiently. The amounts of flow of a typical day are tried to be adjusted to those of a non-regular day. A typical (non-regular, respectively) day is a non-rainy day having good data and no (a few) outliers. The values for the adjustment are tried to be estimated by using the multiple regression analysis. It is shown that the estimation can be improved, and these values can be estimated by using the temperature of that day, the amount of the rain fall of the previous day, and the day type, which distinguishes a weekday, Saturday, Sunday, and a national holiday. The estimation is tried to be used in estimating the data of a regular day. It is experimentally shown that the estimation works well.","PeriodicalId":318936,"journal":{"name":"Int. J. Networked Distributed Comput.","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2017-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115660714","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 : 2017-09-01DOI: 10.2991/ijndc.2017.5.4.1
W. Lai, Mei-Tso Lin, Ting-Huan Kuo
In vehicular ad hoc networks (VANETs), due to highly mobile and frequently changing topology, available resources and transmission opportunities are restricted. To address this, we propose a burst transmission and frame aggregation (FAB) scheme to enhance transmission opportunity (TXOP) efficiency of IEEE 802.11p. Aggregation and TXOP techniques are useful for improving transmission performance. FAB aggregates frames in the relay node and utilizes the TXOP to transmit these frames to the next hop with a burst transmission. Simulation results show that the proposed FAB scheme can significantly improve the performance of inter-vehicle communications.
{"title":"Burst Transmission and Frame Aggregation for VANET Communications","authors":"W. Lai, Mei-Tso Lin, Ting-Huan Kuo","doi":"10.2991/ijndc.2017.5.4.1","DOIUrl":"https://doi.org/10.2991/ijndc.2017.5.4.1","url":null,"abstract":"In vehicular ad hoc networks (VANETs), due to highly mobile and frequently changing topology, available resources and transmission opportunities are restricted. To address this, we propose a burst transmission and frame aggregation (FAB) scheme to enhance transmission opportunity (TXOP) efficiency of IEEE 802.11p. Aggregation and TXOP techniques are useful for improving transmission performance. FAB aggregates frames in the relay node and utilizes the TXOP to transmit these frames to the next hop with a burst transmission. Simulation results show that the proposed FAB scheme can significantly improve the performance of inter-vehicle communications.","PeriodicalId":318936,"journal":{"name":"Int. J. Networked Distributed Comput.","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2017-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120937408","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 : 2017-09-01DOI: 10.2991/ijndc.2017.5.4.2
Kazuya Odagiri, Shogo Shimizu, N. Ishii
In the current Internet system, there are many problems using anonymity of the network communication such as personal information leaks and crimes using the Internet system. This is why TCP/IP protocol used in Internet system does not have the user identification information on the communication data, and it is difficult to supervise the user performing the above acts immediately. As a study for solving the above problem, there is the study of Policy Based Network Management (PBNM). This is the scheme for managing a whole Local Area Network (LAN) through communication control for every user. In this PBNM, two types of schemes exist. The first is the scheme for managing the whole LAN by locating the communication control mechanisms on the path between network servers and clients. The second is the scheme of managing the whole LAN by locating the communication control mechanisms on clients. As the second scheme, we have studied theoretically about the Destination Addressing Control System (DACS) Scheme. By applying this DACS Scheme to Internet system management, we will realize the policy-based Internet system management. In this paper, as the progression phase for the last goal, we perform the load experiment of the cloud type virtual PBNM named the vDACS Scheme, which can be used by plural organizations, for applications to the small and medium size scale organization. The number of clients used in an experiment is 300.
{"title":"Load Experiment of the vDACS Scheme in case of the 300 Clients","authors":"Kazuya Odagiri, Shogo Shimizu, N. Ishii","doi":"10.2991/ijndc.2017.5.4.2","DOIUrl":"https://doi.org/10.2991/ijndc.2017.5.4.2","url":null,"abstract":"In the current Internet system, there are many problems using anonymity of the network communication such as personal information leaks and crimes using the Internet system. This is why TCP/IP protocol used in Internet system does not have the user identification information on the communication data, and it is difficult to supervise the user performing the above acts immediately. As a study for solving the above problem, there is the study of Policy Based Network Management (PBNM). This is the scheme for managing a whole Local Area Network (LAN) through communication control for every user. In this PBNM, two types of schemes exist. The first is the scheme for managing the whole LAN by locating the communication control mechanisms on the path between network servers and clients. The second is the scheme of managing the whole LAN by locating the communication control mechanisms on clients. As the second scheme, we have studied theoretically about the Destination Addressing Control System (DACS) Scheme. By applying this DACS Scheme to Internet system management, we will realize the policy-based Internet system management. In this paper, as the progression phase for the last goal, we perform the load experiment of the cloud type virtual PBNM named the vDACS Scheme, which can be used by plural organizations, for applications to the small and medium size scale organization. The number of clients used in an experiment is 300.","PeriodicalId":318936,"journal":{"name":"Int. J. Networked Distributed Comput.","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2017-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124332905","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
扫码关注我们
求助内容：
应助结果提醒方式：