Pub Date : 2018-06-01DOI: 10.6109/jicce.2018.16.2.84
HoChul Lim, Hyungwon Kim
{"title":"Low Power Time Synchronization for Wireless Sensor Networks Using Density-Driven Scheduling","authors":"HoChul Lim, Hyungwon Kim","doi":"10.6109/jicce.2018.16.2.84","DOIUrl":"https://doi.org/10.6109/jicce.2018.16.2.84","url":null,"abstract":"","PeriodicalId":272551,"journal":{"name":"J. Inform. and Commun. Convergence Engineering","volume":"64 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132742372","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-03-29DOI: 10.6109/jicce.2018.16.1.60
Leo Willyanto Santoso, Resmana Lim, Kevin Trisnajaya
The Internet of Things (IoT) is happening now. By implementing IoT, we can build smart home system. Smart home is an application that is a combination of technology and services that specialize in the home environment with specific functions aimed at improving the efficiency, comfort and security of the occupants. Smart homes filled with connected products are loaded with possibilities to make our lives easier, more convenient, and more comfortable. This intelligent home system uses a microcontroller to process functions that provided by smart home system, such functions as RFID for door access and PIR sensors for motion detection. By using Android users could control the sensors anytime and anywhere. Microcontroller used is Arduino IDE with WeMos D1R2 board. Based on the testing process, there was a successful communication between the components of the device, sensors, and Android devices. Users could open or close the solenoid, users can also turn off or turn on electronic devices using Android.
{"title":"Smart Home System Using Internet of Things","authors":"Leo Willyanto Santoso, Resmana Lim, Kevin Trisnajaya","doi":"10.6109/jicce.2018.16.1.60","DOIUrl":"https://doi.org/10.6109/jicce.2018.16.1.60","url":null,"abstract":"The Internet of Things (IoT) is happening now. By implementing IoT, we can build smart home system. Smart home is an application that is a combination of technology and services that specialize in the home environment with specific functions aimed at improving the efficiency, comfort and security of the occupants. Smart homes filled with connected products are loaded with possibilities to make our lives easier, more convenient, and more comfortable. This intelligent home system uses a \u0000microcontroller to process functions that provided by smart home system, such functions as RFID for door access and PIR sensors for motion detection. By using Android users could control the sensors anytime and anywhere. Microcontroller used is Arduino IDE with WeMos D1R2 board. Based on the testing process, there was a successful communication between the components of the device, sensors, and Android devices. Users could open or close the solenoid, users can also turn off or turn \u0000on electronic devices using Android.","PeriodicalId":272551,"journal":{"name":"J. Inform. and Commun. Convergence Engineering","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-03-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127030400","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-03-29DOI: 10.6109/jicce.2018.16.1.52
Y. Yulia, G. S. Budhi, Stefani Natalia Hendratha
Odoo is an enterprise resource planning information system providing modules to support the basic business function in companies. This research will look into the development of an additional module at Odoo. This module is a data mining module using Market Basket Analysis (MBA) using FP-Growth algorithm in managing OLTP of sales transaction to be useful information for users to improve the analysis of company business strategy. The FP-Growth algorithm used in the application was able to produce multidimensional association rules. The company will know more about their sales and customers� buying habits. Performing sales trend analysis will give a valuable insight into the inner-workings of the business. The testing of the module is using the data from X Supermarket. The final result of this module is generated from a data mining process in the form of association rule. The rule is presented in narrative and graphical form to be understood easier.
{"title":"Odoo Data Mining Module Using Market Basket Analysis","authors":"Y. Yulia, G. S. Budhi, Stefani Natalia Hendratha","doi":"10.6109/jicce.2018.16.1.52","DOIUrl":"https://doi.org/10.6109/jicce.2018.16.1.52","url":null,"abstract":"Odoo is an enterprise resource planning information system providing modules to support the basic business function in \u0000companies. This research will look into the development of an additional module at Odoo. This module is a data mining module \u0000using Market Basket Analysis (MBA) using FP-Growth algorithm in managing OLTP of sales transaction to be useful \u0000information for users to improve the analysis of company business strategy. The FP-Growth algorithm used in the application \u0000was able to produce multidimensional association rules. The company will know more about their sales and customers� buying \u0000habits. Performing sales trend analysis will give a valuable insight into the inner-workings of the business. The testing of the \u0000module is using the data from X Supermarket. The final result of this module is generated from a data mining process in the form \u0000of association rule. The rule is presented in narrative and graphical form to be understood easier.","PeriodicalId":272551,"journal":{"name":"J. Inform. and Commun. Convergence Engineering","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-03-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130692844","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.6109/jicce.2017.15.4.244
Ik-Hyun Youn, Jungyeon Choi, Jong-Hoon Youn
{"title":"Seafarers Walking on an Unstable Platform: Comparisons of Time and Frequency Domain Analyses for Gait Event Detection","authors":"Ik-Hyun Youn, Jungyeon Choi, Jong-Hoon Youn","doi":"10.6109/jicce.2017.15.4.244","DOIUrl":"https://doi.org/10.6109/jicce.2017.15.4.244","url":null,"abstract":"","PeriodicalId":272551,"journal":{"name":"J. Inform. and Commun. Convergence Engineering","volume":"86 21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126288575","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-06-01DOI: 10.6109/jicce.2017.15.2.97
Md. Al-Amin Khandaker, Taehwan Park, Y. Nogami, Howon Kim
Implementation of faster pairing calculation is the basis of efficient pairing-based cryptographic protocol implementation. Generally, pairing is a costly operation carried out over the extension field of degree k ≥ 12. But the twist property of the pairing friendly curve allows us to calculate pairing over the sub-field twisted curve, where the extension degree becomes k/d and twist degree d = 2, 3, 4, 6. The calculation cost is reduced substantially by twisting but it makes the discrete logarithm problem easier if the curve parameters are not carefully chosen. Therefore, this paper considers the most recent parameters setting presented by Barbulescu and Duquesne [1] for pairing-based cryptography; that are secure enough for 128bit security level; to explicitly show the quartic twist (d = 4) and sextic twist (d = 6) mapping between the isomorphic rational point groups for KSS (Kachisa-Schaefer-Scott) curve of embedding degree k = 16 and k = 18, receptively. This paper also evaluates the performance enhancement of the obtained twisted mapping by comparing the elliptic curve scalar multiplications.
{"title":"A Comparative Study of Twist Property in KSS Curves of Embedding Degree 16 and 18 from the Implementation Perspective","authors":"Md. Al-Amin Khandaker, Taehwan Park, Y. Nogami, Howon Kim","doi":"10.6109/jicce.2017.15.2.97","DOIUrl":"https://doi.org/10.6109/jicce.2017.15.2.97","url":null,"abstract":"Implementation of faster pairing calculation is the basis of efficient pairing-based cryptographic protocol implementation. Generally, pairing is a costly operation carried out over the extension field of degree k ≥ 12. But the twist property of the pairing friendly curve allows us to calculate pairing over the sub-field twisted curve, where the extension degree becomes k/d and twist degree d = 2, 3, 4, 6. The calculation cost is reduced substantially by twisting but it makes the discrete logarithm problem easier if the curve parameters are not carefully chosen. Therefore, this paper considers the most recent parameters setting presented by Barbulescu and Duquesne [1] for pairing-based cryptography; that are secure enough for 128bit security level; to explicitly show the quartic twist (d = 4) and sextic twist (d = 6) mapping between the isomorphic rational point groups for KSS (Kachisa-Schaefer-Scott) curve of embedding degree k = 16 and k = 18, receptively. This paper also evaluates the performance enhancement of the obtained twisted mapping by comparing the elliptic curve scalar multiplications.","PeriodicalId":272551,"journal":{"name":"J. Inform. and Commun. Convergence Engineering","volume":"424 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116049573","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-06-01DOI: 10.6109/jicce.2017.15.2.104
Jong-Hoon Youn, Young-Ho Seo, Moon-Seok Oh
{"title":"A Study on UI Design of Social Networking Service Messenger by Using Case Analysis Model","authors":"Jong-Hoon Youn, Young-Ho Seo, Moon-Seok Oh","doi":"10.6109/jicce.2017.15.2.104","DOIUrl":"https://doi.org/10.6109/jicce.2017.15.2.104","url":null,"abstract":"","PeriodicalId":272551,"journal":{"name":"J. Inform. and Commun. Convergence Engineering","volume":"216 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121212498","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-03-01DOI: 10.6109/jicce.2017.15.1.28
Hyun-Ho Choi
The medium access control (MAC) protocol based on dynamic time division multiple access/time division duplex (TDMA/TDD) is responsible for random access control and radio resource allocation in dynamic traffic environments. These functions of random access and resource allocation are very important to prevent wastage of resources and improve MAC performance according to various network conditions. In this paper, we propose new random access and resource allocation schemes to guarantee quality of service (QoS) and provide priority services in a dynamic TDMA/TDD system. First, for the QoS guarantee, we propose an adaptive random access and resource allocation scheme by introducing an access probability. Second, for providing priority service, we propose a priority-based random access and resource allocation scheme by extending the first adaptive scheme in both a centralized and a distributed manner. The analysis and simulation results show that the proposed MAC protocol outperforms the legacy MAC protocol using a simple binary exponential backoff algorithm, and provides good differential performance according to priorities with respect to the throughput and delay.
{"title":"Adaptive and Prioritized Random Access and Resource Allocation Schemes for Dynamic TDMA/TDD Protocols","authors":"Hyun-Ho Choi","doi":"10.6109/jicce.2017.15.1.28","DOIUrl":"https://doi.org/10.6109/jicce.2017.15.1.28","url":null,"abstract":"The medium access control (MAC) protocol based on dynamic time division multiple access/time division duplex (TDMA/TDD) is responsible for random access control and radio resource allocation in dynamic traffic environments. These functions of random access and resource allocation are very important to prevent wastage of resources and improve MAC performance according to various network conditions. In this paper, we propose new random access and resource allocation schemes to guarantee quality of service (QoS) and provide priority services in a dynamic TDMA/TDD system. First, for the QoS guarantee, we propose an adaptive random access and resource allocation scheme by introducing an access probability. Second, for providing priority service, we propose a priority-based random access and resource allocation scheme by extending the first adaptive scheme in both a centralized and a distributed manner. The analysis and simulation results show that the proposed MAC protocol outperforms the legacy MAC protocol using a simple binary exponential backoff algorithm, and provides good differential performance according to priorities with respect to the throughput and delay.","PeriodicalId":272551,"journal":{"name":"J. Inform. and Commun. Convergence Engineering","volume":"128 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123112785","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-03-01DOI: 10.6109/jicce.2017.15.1.21
In-Ho Lee
In this research, we study the outage probability for distributed space-time coding-based cooperative (DSTC) systems with amplify-and-forward relaying over Rayleigh fading channels with a high temporal correlation where the direct link between the source and the destination is available. In particular, we derive the upper and lower bounds of the outage probability as well as their corresponding asymptotic expressions. In addition, using only the average channel powers for the source-to-relay and relay-to-destination links, we propose an efficient power allocation scheme between the source and the relay to minimize the asymptotic upper bound of the outage probability. Through a numerical investigation, we verify the analytical expressions as well as the effectiveness of the proposed efficient power allocation. The numerical results show that the lower and upper bounds tightly correspond to the exact outage probability, and the proposed efficient power allocation scheme provides an outage probability similar to that of the optimal power allocation scheme that minimizes the exact outage probability.
{"title":"Outage Analysis and Power Allocation for Distributed Space-Time Coding-Based Cooperative Systems over Rayleigh Fading Channels","authors":"In-Ho Lee","doi":"10.6109/jicce.2017.15.1.21","DOIUrl":"https://doi.org/10.6109/jicce.2017.15.1.21","url":null,"abstract":"In this research, we study the outage probability for distributed space-time coding-based cooperative (DSTC) systems with amplify-and-forward relaying over Rayleigh fading channels with a high temporal correlation where the direct link between the source and the destination is available. In particular, we derive the upper and lower bounds of the outage probability as well as their corresponding asymptotic expressions. In addition, using only the average channel powers for the source-to-relay and relay-to-destination links, we propose an efficient power allocation scheme between the source and the relay to minimize the asymptotic upper bound of the outage probability. Through a numerical investigation, we verify the analytical expressions as well as the effectiveness of the proposed efficient power allocation. The numerical results show that the lower and upper bounds tightly correspond to the exact outage probability, and the proposed efficient power allocation scheme provides an outage probability similar to that of the optimal power allocation scheme that minimizes the exact outage probability.","PeriodicalId":272551,"journal":{"name":"J. Inform. and Commun. Convergence Engineering","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122448993","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-03-01DOI: 10.6109/jicce.2017.15.1.14
M. Abbas, Jun-Pyo Hong
In this paper, we discuss physical layer security techniques in downlink networks, including eavesdroppers. The main objective of using physical layer security is delivering a perfectly secure message from a transmitter to an intended receiver in the presence of passive or active eavesdroppers who are trying to wiretap the information or disturb the network stability. In downlink networks, based on the random feature of channels to terminals, opportunistic user scheduling can be exploited as an additional tool for enhancing physical layer security. We introduce user scheduling strategies and discuss the corresponding performances according to different levels of channel state information (CSI) at the base station (BS). We show that the availability of CSI of eavesdroppers significantly affects not only the beamforming strategy but also the user scheduling. Eventually, we provide intuitive information on the effect of CSI on the secrecy performance by considering three scenarios: perfect, imperfect, and absence of eavesdropper’s CSI at the BS.
{"title":"Survey on Physical Layer Security in Downlink Networks","authors":"M. Abbas, Jun-Pyo Hong","doi":"10.6109/jicce.2017.15.1.14","DOIUrl":"https://doi.org/10.6109/jicce.2017.15.1.14","url":null,"abstract":"In this paper, we discuss physical layer security techniques in downlink networks, including eavesdroppers. The main objective of using physical layer security is delivering a perfectly secure message from a transmitter to an intended receiver in the presence of passive or active eavesdroppers who are trying to wiretap the information or disturb the network stability. In downlink networks, based on the random feature of channels to terminals, opportunistic user scheduling can be exploited as an additional tool for enhancing physical layer security. We introduce user scheduling strategies and discuss the corresponding performances according to different levels of channel state information (CSI) at the base station (BS). We show that the availability of CSI of eavesdroppers significantly affects not only the beamforming strategy but also the user scheduling. Eventually, we provide intuitive information on the effect of CSI on the secrecy performance by considering three scenarios: perfect, imperfect, and absence of eavesdropper’s CSI at the BS.","PeriodicalId":272551,"journal":{"name":"J. Inform. and Commun. Convergence Engineering","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125836211","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
扫码关注我们
求助内容：
应助结果提醒方式：