{"title":"Performance Analysis of Support Vector Machine-Based Classifier for Spectrum Sensing in Cognitive Radio Networks","authors":"S. Jan, Van-Hiep Vu, Insoo Koo","doi":"10.1109/CYBERC.2018.00075","DOIUrl":"https://doi.org/10.1109/CYBERC.2018.00075","url":null,"abstract":"In this work, the performance of support vector machine (SVM)-based classifier, applied for spectrum sensing in cognitive radio (CR) networks, is analyzed. A single observation given input to classifier is composed of three statistical features extracted from the primary user (PU) sensing signal and residual energy in percent of the secondary user (SU). The trained classifier predicts PU’s presence based on the input signal. The SU starts transmission if PU is predicted absent, otherwise continues sensing other frequency bands. The hypothesis that PU is absent, is further classified in multi classes. The secondary user varies the transmission power based on the output class. This technique increases the quality of service (QoS) due to low interference from SU to PU even if failed to detect. The cross validation technique increases the generalization of classifier. The performance of classifier is examined in terms of accuracy results. The signal-to-noise (SNR) ratio from PU to SU is varied to investigate effect on classifier’s performance. Furthermore, the receiver operating characteristics (ROC) is presented for more evaluation. The parameter ‘area under curve (AUC)’ is given for comparison. The simulation results show the efficiency of proposed features with SVM-based classifier for spectrum sensing in CR applications.","PeriodicalId":282903,"journal":{"name":"2018 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery (CyberC)","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123404800","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}
Kunli Zhang, Kaixiang Li, Hongchao Ma, Donghui Yue, Lei Zhuang
{"title":"Construction of MeSH-Like Obstetric Knowledge Graph","authors":"Kunli Zhang, Kaixiang Li, Hongchao Ma, Donghui Yue, Lei Zhuang","doi":"10.1109/CYBERC.2018.00041","DOIUrl":"https://doi.org/10.1109/CYBERC.2018.00041","url":null,"abstract":"Obstetric Knowledge Graph describes the obstetric diseases and the body parts, drugs, etc. as well as the relations between them, which is an important knowledge base for intelligent auxiliary diagnosis. In this paper, the hierarchical structure of Medical Subject Headings(MeSH) is taken as the ontology prototype of the Knowledge Graph. According to the naming criterion of Chinese obstetric diseases and the practical application of the disease diagnosis in obstetric electronic medical records. And the ontology structure of obstetric diseases is extended. Moreover, the possible relation categories between obstetric entities and knowledge description system are defined to form the schema layer of Obstetric Knowledge Graph. The obstetric disease attributes of heterogeneous data are derived from medical specifications, classic textbooks, and medical online website by using rules-based and wrapper methods. And then they are fused by the Simhash-TF-IDF algorithm. The relations between entities in the knowledge graph are extracted by combining Bootstrapping and SVM algorithms. Then the Obstetric Knowledge Graph data layer is completed. The schema layer and data layer are automatically imported into Protégé to visualize the Obstetric Knowledge graph. The constructed Obstetric Knowledge Graph contains 625 entities, 2456 attributes and 1407 relations, which covers the most diseases in obstetrics and related entities.","PeriodicalId":282903,"journal":{"name":"2018 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery (CyberC)","volume":"63 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121300551","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":"TTVT: A Two-Tier Voronoi Diagram Based Tracking Algorithm in Wireless Sensor Networks","authors":"Qianqian Ren, Jinbao Li, Beibei Sun","doi":"10.1109/CYBERC.2018.00080","DOIUrl":"https://doi.org/10.1109/CYBERC.2018.00080","url":null,"abstract":"Sleeping scheduling has been widely employed in target tracking due to its energy conservation. However, the randomness of target's trajectory makes it difficult to implement with accuracy and real time guarantee. We propose TTVT, a novel, simple and efficient tracking technique. TTVT first constructs a Voronoi based network model, then makes nodes in the Voronoi polygon that the target is in work and others sleep. The target is hence detected by nodes closest to it. TTVT further presents a weighted centriod based algorithm to locate the target with the chosen nodes and reduce the influence of data noise on localization accuracy. We have implemented TTVT, and our extensive simulation show that it outperforms similar schemes with much lower location error.","PeriodicalId":282903,"journal":{"name":"2018 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery (CyberC)","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120998706","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":"Iterative UAV Trajectory Optimization for Physical Layer Secure Mobile Relaying","authors":"Lingfeng Shen, Ning Wang, X. Mu","doi":"10.1109/CYBERC.2018.00015","DOIUrl":"https://doi.org/10.1109/CYBERC.2018.00015","url":null,"abstract":"With the rapid development and growth of unmanned arial vehicle (UAV) technology and industry, there is increasing research interests in UAV communications. In this work, the mobility and deployment flexibility of UAV is used to provide assistance to terrestrial point-to-point communications. In particular, design of the UAV-enabled mobile relaying system is investigated from the physical layer security perspective to achieve higher overall secrecy capacity. A dynamic channel model that changes with the trajectory is established based on the UAV relay's mobility. By optimizing the UAV's moving trajectory, secrecy capacity of the relay-assisted wireless communication system is maximized. The problem formulated is shown to be non-convex, which is difficult to solve in general. To make the problem tractable, we decompose the original problem and optimize the trajectory to approximate the optimal flight path by optimizing the increments at each trajectory iteration. Simulation results show that the method of finding the optimal trajectory based on the displacement updating iteration is effective and fast converging. When the number of iterations is sufficiently large, the trajectory of the UAV converges, and the optimized trajectory significantly improves the system's secrecy capacity performance. Based on the optimized trajectory, it is investigated through numerical results how the overall secrecy capacity is impacted by the total flight time and the maximum instantaneous UAV speed. It is revealed that higher flight speed is desirable in finding a secure UAV trajectory, and there exists a minimum total flight time to achieve the best average secrecy rate performance","PeriodicalId":282903,"journal":{"name":"2018 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery (CyberC)","volume":"44 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122394017","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":"Rate-Less Codes Aided Cooperation Based on Antenna Selection in Multi-user Massive MIMO System","authors":"J. Yang, Chunhua Zhu","doi":"10.1109/CYBERC.2018.00063","DOIUrl":"https://doi.org/10.1109/CYBERC.2018.00063","url":null,"abstract":"The design of coded cooperation scheme based on transmit antenna selection has been being a hot topic in wireless communications. The difficulty lies in the fact that plenty of channel codebooks have to be stored both at the transmitter and the receiver in advance for the fixed-rate coded cooperation, due to the dynamic cooperative transmit antennas in Multi-user massive multiple-input multiple-output (MIMO) system. To reduce the complexity, the rate-less codes aided cooperation scheme based on transmit antenna selection is described in this paper. And the bit error rate (BER) and the symbol error rate (SER) performance analyses are also derived. Simulation results show that the proposed scheme achieves much better performance gain compared to non-cooperative scheme.","PeriodicalId":282903,"journal":{"name":"2018 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery (CyberC)","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124807198","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":"High-Rate Secret Key Generation Method Using Two-Way Random Signal","authors":"Shengjun Zhang, Liang Jin, Yangming Lou, Kaizhi Huang, Zhou Zhong","doi":"10.1109/CYBERC.2018.00017","DOIUrl":"https://doi.org/10.1109/CYBERC.2018.00017","url":null,"abstract":"Most secret key generation (SKG) methods need channel estimation and provide insufficient performance especially in time division duplex single input single output (TDD-SISO) system and quasi-static channel scenario. This paper proposed a two-way SKG method which can completely avoid channel estimation and achieve higher SKG rate (SKGR). Firstly, the legitimate users mutually send their own random signal via the reciprocal channel. Then, the multiplication of local random signal and the received signal can be used as common randomness to generate keys. The theoretical and practical SKGRs of the three methods, namely wireless channel based, one-way randomness and two-way randomness, are derived and compared. Simulation and estimation results show that the proposed TW method acquires a better performance not only in theory but also in practice, and the practical SKGR of TW method is time-linear which provides a feasible scheme to significantly improve the SKGR for quasi-static channel scenario.","PeriodicalId":282903,"journal":{"name":"2018 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery (CyberC)","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123753058","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":"Title Page i","authors":"","doi":"10.1109/cyberc.2018.00001","DOIUrl":"https://doi.org/10.1109/cyberc.2018.00001","url":null,"abstract":"","PeriodicalId":282903,"journal":{"name":"2018 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery (CyberC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125726608","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":"A Cooperative Task Assignment Method of Multi-UAV Based on Self Organizing Map","authors":"Shurong Zhu, Yingzhou Zhang, Yang Gao, Fan Wu","doi":"10.1109/CYBERC.2018.00085","DOIUrl":"https://doi.org/10.1109/CYBERC.2018.00085","url":null,"abstract":"Cooperative task assignment of multi unmanned aerial vehicles (UAV) is an important assurance for UAV to complete military missions. The current task assignment methods have drawbacks such as long execution time and failure to consider UAV's own capacity constraints. Therefore in this paper, we comprehensively considers the total flight distance of the fleet and the weapon load of each UAV, models the cooperative task assignment problem of multi-UAV as a capacitated vehicle routing problem (CVRP). A method based on a competitive neural network called self-organizing feature map (SOM) is used to solve the task assignment problem. The performance of proposed method is compared to that of ant colony algorithm. Experimental results show the feasibility and efficiency of the method.","PeriodicalId":282903,"journal":{"name":"2018 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery (CyberC)","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125303776","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":"Improved Ant Colony Optimization for Ground Robot 3D Path Planning","authors":"Lanfei Wang, Jiangming Kan, Jun Guo, Chao Wang","doi":"10.1109/CYBERC.2018.00030","DOIUrl":"https://doi.org/10.1109/CYBERC.2018.00030","url":null,"abstract":"Path planning is an important part in the navigation control of mobile robot in a 3D environment. We proposed an improved ant colony algorithm to address the problems of falling into local optimum easily and long search time in 3D path planning. We redesigned pheromone update and heuristic function. New search mode is designed to solve the problem of searching time. We used a number of 3D terrains to carry out experiments, and set different starting and end points in each terrain. By comparing the results of improved ant colony algorithm and traditional ant colony algorithm, the improved one can reduce the shortest path length by an average of 8.164%.","PeriodicalId":282903,"journal":{"name":"2018 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery (CyberC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131272088","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":"Smart Control System Solution for Smart Cities","authors":"R. Kodali, Mohamed Azman, Jithu G. Panicker","doi":"10.1109/CYBERC.2018.00027","DOIUrl":"https://doi.org/10.1109/CYBERC.2018.00027","url":null,"abstract":"Home or Office Automation may be described as a system to provide ease of operation of connected devices or appliances. Most commercial environments, during active hours, consume large amounts of energy resources; this could be optimized to the minimum by smartly monitoring and managing the resources. IoT (Internet of Things) enables this to be a possible solution at reasonable cost factors. However, it is important to note that in commercial environments, security is a key factor; corporations cannot depend on opening up their networks to the outside world in order to avail the services offered by currently available smart-devices. Localizing and privatizing the entire automation and control system would be desirable for such domains. The work presented in this paper proposes a solution for such applications which is crucial for the development of Smart Cities as a whole along with Smart Homes. One of the simplest tasks is to switch a light source, HVAC systems or any other electrical equipment on or off, by being physically present in the premises, remotely or automatically based on time or a sensor's reading. Furthermore, the intensity of the light source, the temperature of the HVAC systems and such parameters could also be varied. Development of technology in the field has enabled the production of cheap and small-sized computers like Raspberry Pi which are also known as Single Board Computers (SBC). The prototype designed is equipped with a secure local MQTT link for communication between the control and automation system and the Edge Devices. Additionally, it is equipped with a speech recognition system to give the users a much more intuitive and natural mean to communicate with and control the connected devices.","PeriodicalId":282903,"journal":{"name":"2018 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery (CyberC)","volume":"160 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128092634","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}