{"title":"Byzantine Fault Tolerant Algorithm Based on Vote","authors":"Haiyong Wang, Kaixuan Guo","doi":"10.1109/CyberC.2019.00041","DOIUrl":"https://doi.org/10.1109/CyberC.2019.00041","url":null,"abstract":"Practical Byzantine Fault Tolerance (PBFT) algorithm is a popular solution for establishing consensus in blockchain systems. However, there are some issues in the PBFT algorithm, such as high energy consumption, low efficiency, and poor scalability. These problems are not solved even in some of its improved algorithms, such as Byzantine consensus algorithm based on Gossip protocol (GBC) and Credit Practical Byzantine Fault Tolerance (CBPFT) algorithms. To address these issues, this paper proposes a Byzantine Fault Tolerant algorithm based on Vote algorithm (vBFT). The nodes in the network are divided into three types of with different responsibilities by the vBFT algorithm, which are client, slave, and master nodes. The state between nodes could be dynamically adjusted at any time. As shown our simulations and analysis, the proposed algorithm has significantly improved performance in terms of dynamics, energy consumption, fault tolerance and low-latency compared with consensus algorithms such as PBFT, GBC and CBPFT algorithm.","PeriodicalId":397938,"journal":{"name":"2019 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery (CyberC)","volume":"146 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127245781","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}
{"title":"An Extensible Consensus Algorithm Based on PBFT","authors":"Yixin Li, Zhen Wang, Jia Fan, Yue Zheng, Yili Luo, Chunhua Deng, Jianwei Ding","doi":"10.1109/CyberC.2019.00013","DOIUrl":"https://doi.org/10.1109/CyberC.2019.00013","url":null,"abstract":"Practical Byzantine Fault Tolerance (PBFT) is a deterministic consensus algorithm, which is widely used in blockchain due to the advantage of no forks. However, PBFT still has some problems, such as not being suitable for dynamic networks, requiring large communication overhead, and not being able to identify Byzantine nodes. Therefore, we propose Extensible-PBFT (EPBFT) consensus algorithm, it can take different steps to reach consensus according to the network environment of the system. Firstly, we add the election of consensus nodes based on verifiable random function (VRF), which makes EPBFT suitable for dynamic networks. Then, we modify the consistency protocol so that EPBFT can reach consensus with less communication in a stable network, and it can also identify Byzantine nodes and reduce confirmation latency. Finally, we simplify the checkpoint protocol and the view-change protocol, reducing the time and communication overhead they require.","PeriodicalId":397938,"journal":{"name":"2019 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery (CyberC)","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125014187","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}
C. Yang, Guangzhi Li, Xiang Liu, Zonghuan Wu, Kaiyu Zhang
{"title":"The Future of Broadband Access Network Architecture and Intelligent Operations","authors":"C. Yang, Guangzhi Li, Xiang Liu, Zonghuan Wu, Kaiyu Zhang","doi":"10.1109/CyberC.2019.00060","DOIUrl":"https://doi.org/10.1109/CyberC.2019.00060","url":null,"abstract":"This paper presents an overview of the evolution towards a broadband optical access network. Network operations transformation with emphasis on automated broadband service monitoring, fault detection, fault recovery, and fault prediction is also discussed. However, in order to support broadband access network evolution and to accelerate telco operations transformation, traditional network operations, administration and maintenance (OAM) methods will not be sufficient. Therefore, we describe our key research contributions regarding new approaches to support closed-loop broadband network OAM that will eliminate human touches and automate non-physical fault recovery for daily routine tasks. We have designed and implemented a network knowledge engine (NKE) centered software framework to enable data collection, correlation, and analysis for troubleshooting complex issues in the broadband access network. Our solutions will address the following network management domains, including (a) knowledge management, (b) surveillance management, (c) incident management, and (d) problem management. In this paper, we focus on auto proactive and predictive trouble management which can verify and confirm a passive device problem location by NKE. We will describe a step-by-step methodology to control data process flow, optical fiber path discovery management, and auto-detection of failed passive devices by using the following techniques: (a) big data analytics, (b) knowledge graph, (c) machine learning (ML), and (d) artificial intelligence (AI) prediction rule and learning policy involving the spatial-temporal algorithm. With combinations of these technique, our preliminary study indicates that the accuracy of auto fault detection is 93%, while the false positive rate is ~0.01%. As results, we demonstrated the promise of this novel technology framework in supporting transformation from expert’s domain knowledge into machine knowledge.","PeriodicalId":397938,"journal":{"name":"2019 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery (CyberC)","volume":"27 9","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114136331","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}
{"title":"Risk-Based Attributed Access Control Modelling in a Health Platform: Results from Project CityZen","authors":"E. Nakamura, S. Ribeiro","doi":"10.1109/CyberC.2019.00074","DOIUrl":"https://doi.org/10.1109/CyberC.2019.00074","url":null,"abstract":"This paper presents an access control modelling that integrates risk assessment elements in the attribute-based model to organize the identification, authentication and authorization rules. Access control is complex in integrated systems, which have different actors accessing different information in multiple levels. In addition, systems are composed by different components, much of them from different developers. This requires a complete supply chain trust to protect the many existent actors, their privacy and the entire ecosystem. The incorporation of the risk assessment element introduces additional variables like the current environment of the subjects and objects, time of the day and other variables to help produce more efficient and effective decisions in terms of granting access to specific objects. The risk-based attributed access control modelling was applied in a health platform, Project CityZen.","PeriodicalId":397938,"journal":{"name":"2019 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery (CyberC)","volume":"219 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122057936","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}
{"title":"Forecast of the Tourist Volume of Sanya City by XGBoost Model and GM Model","authors":"Xia Liu, Yi-nan Chen, Zhao Qiu, Mingrui Chen","doi":"10.1109/CyberC.2019.00038","DOIUrl":"https://doi.org/10.1109/CyberC.2019.00038","url":null,"abstract":"Sanya is a famous tourist city in China. Considering the monthly tourist data form Sanya Tourism, Culture, Radio, Television and Sports Bureau from 2012 to 2018, this paper adopts XGB and GM learning models to analyze tourist volume of Sanya City in the past seven years. Forecast accuracy of these two models are therefore compared. The fitting results indicate that the mean absolute percentage error (MAPE) of XGB model is 3.92% while the GM model achieves MAPE of 3.18%. Both prediction models reach a high accuracy. Based on the fitting result of these two models, a combined model is further proposed to forecast the tourist volume, the number of overnight transit tourists, and the tourist income in Sanya City for 2019 and 2020, respectively. The forecast results indicate that: (i) the tourist volume will reach 35,560,100 and 37,938,200 in 2019 and 2020 respectively; (ii) the number of overnight transit tourists will reach 875,200 and 1,027,000 in 2019 and 2020 respectively; and (iii) the tourist income will reach RMB 55.335 billion and RMB 64.44 billion in 2019 and 2020 respectively. Based on the forecasted tourist volume, recommendations are proposed to improve the city's tourist reception capacity and service capacity such that high quality of satisfaction can be provided for tourists in an accordance with the level of an international tourist city.","PeriodicalId":397938,"journal":{"name":"2019 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery (CyberC)","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115466627","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}
Qiong Liu, Pengxiang Hua, Awais Sultan, Longzhang Shen, E. Mueller, F. Boerner
{"title":"Study of the Integration of Robot in Cyber-Physical Production Systems","authors":"Qiong Liu, Pengxiang Hua, Awais Sultan, Longzhang Shen, E. Mueller, F. Boerner","doi":"10.1109/CyberC.2019.00069","DOIUrl":"https://doi.org/10.1109/CyberC.2019.00069","url":null,"abstract":"Robots are expected to be used in the smart manufacturing and smart factory with the help of information and communication technologies. The increasing and consistent integration of ICTs and robot into the production systems in subsystems and components are needed. The mechatronic systems become cyber-physical systems through additional communication skills and autonomy in behavior on external influences and internally stored settings. Robots are integrated in the Cyber-Physical Production System to realize smart factory and smart manufacturing. In a laboratory environment, innovative logistical systems integrated with robots are built up to apply horizontal and vertical integration into practice for research investigations.","PeriodicalId":397938,"journal":{"name":"2019 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery (CyberC)","volume":"48 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115639355","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}
{"title":"Translational Bit-by-Bit Multi-bit Quantization for CRNN on Keyword Spotting","authors":"Yuhao Sun, Bo Liu","doi":"10.1109/CyberC.2019.00082","DOIUrl":"https://doi.org/10.1109/CyberC.2019.00082","url":null,"abstract":"Keyword spotting (KWS) is one of automatic speech recognition (ASR) research fields. KWS algorithms based on neural network are remarkably better than others. It is extremely suitable for KWS algorithms to deploy on portable hardware devices to achieve excellent performance, but the number of weights is too large to apply due to limited hardware storage resources. Quantization is a natural approach to solve this puzzle. We propose a quantization formula to deploy KWS algorithms based on neural network on hardware devices effectively. In this paper, we consider symmetry of weights about the origin, and reorganize the order of 1-bit quantization of residual error and alternating quantization of minimization, proposing our translational bit-by-bit multi-bit quantization. Furthermore, we implement our method to convolutional recurrent neural network (CRNN) for KWS problem, analyzing results on two aspects, root mean square error (RMSE) and accuracy respectively. We can obtain smaller RMSE between quantized weights and full precision weights, the cost of it is the increment of computational complexity, but we can execute quantization in every mini-batch to constrain training time within a reasonable range. Our formula can get an acceptable accuracy by 3-bit quantization, with ~10.65× memory saving. And we can obtain no loss accuracy comparing to full precision by 4-bit quantization, sometimes even better, with ~7.99× memory saving. Our quantization method can achieve better performance and save memory resources, which are able to be used to deploy KWS algorithms based on neural network on hardware devices effectively.","PeriodicalId":397938,"journal":{"name":"2019 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery (CyberC)","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115711157","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}
Yao Sun, Lei Zhang, G. Feng, Bowen Yang, Bin Cao, M. Imran
{"title":"Performance Analysis for Blockchain Driven Wireless IoT Systems Based on Tempo-Spatial Model","authors":"Yao Sun, Lei Zhang, G. Feng, Bowen Yang, Bin Cao, M. Imran","doi":"10.1109/CyberC.2019.00066","DOIUrl":"https://doi.org/10.1109/CyberC.2019.00066","url":null,"abstract":"Blockchain has shown a great potential for Internet of Things (IoT) systems to establish trust and consensus mechanisms with no involvement of any third party. It has been not clear how the low complexity devices and the wireless communications among them can pose constraints on the blockchain enabled IoT systems. In this paper, we establish a fundamental analysis model to underpin the blockchain enabled IoT system. By considering spatio-temporal domain Poisson distribution, i.e., node geographical distribution and transaction arrival rate in time domain are both modeled as Poisson point process (PPP), we first derive the distribution of signal-to-interference-plus-noise ratio (SINR), blockchain transaction successful rate as well as overall throughput. Then, based on the analytical model, we design an optimal full function node deployment for blockchain system to achieve the maximum transaction throughput with the minimum full function node density. Numerical results validate the accuracy of our theoretical analysis and evaluate the relationship between blockchain full function node deployment and the density of IoT nodes.","PeriodicalId":397938,"journal":{"name":"2019 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery (CyberC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129377086","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}
{"title":"Message from the Technical Program Chairs","authors":"H. Al-Ahmad, M. Bettayeb, S. Al-Araji, H. Barada","doi":"10.1109/cyberc.2019.00007","DOIUrl":"https://doi.org/10.1109/cyberc.2019.00007","url":null,"abstract":"","PeriodicalId":397938,"journal":{"name":"2019 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery (CyberC)","volume":"48 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130201025","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}
Mingxin Ma, Xiaotong Yang, Guozhen Shi, Fenghua Li
{"title":"Hierarchical Key Management Scheme with Multilevel Secure Access","authors":"Mingxin Ma, Xiaotong Yang, Guozhen Shi, Fenghua Li","doi":"10.1109/CyberC.2019.00025","DOIUrl":"https://doi.org/10.1109/CyberC.2019.00025","url":null,"abstract":"With the rapid expansion of IoT, data collected by sensors and intelligent devices has a great value to Big Data analysis. However, privacy leakage is becoming one of most challenging concerns in information collection, sharing or analysis, and threatening the security of information economy such as data as a service. In this paper, we focused on the dynamic changes of the relationship of resource-constrained data suppliers and demanders, and proposed a hierarchical key management scheme with multilevel secure access (ML-HKM) based on Elliptic Curve Discrete Logarithm Problem. We present the system operations including setup, update, join and revoke to securely obtain the data encryption key and the multilevel mapping method to enhance the network extensible. At last, the scheme is analysed in correctness and security which indicates it is both forward secrecy and backward secrecy.","PeriodicalId":397938,"journal":{"name":"2019 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery (CyberC)","volume":"51 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122819077","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}