2019 International Conference on Computing, Networking and Communications (ICNC)最新文献

筛选
英文 中文
Privacy-Preserving Device Discovery and Authentication Scheme for D2D Communication in 3GPP 5G HetNet 3GPP 5G网络中D2D通信的隐私保护设备发现和认证方案
2019 International Conference on Computing, Networking and Communications (ICNC) Pub Date : 2019-02-01 DOI: 10.1109/ICCNC.2019.8685499
Yunqing Sun, Jin Cao, M. Ma, Hui Li, Ben Niu, Fenghua Li
{"title":"Privacy-Preserving Device Discovery and Authentication Scheme for D2D Communication in 3GPP 5G HetNet","authors":"Yunqing Sun, Jin Cao, M. Ma, Hui Li, Ben Niu, Fenghua Li","doi":"10.1109/ICCNC.2019.8685499","DOIUrl":"https://doi.org/10.1109/ICCNC.2019.8685499","url":null,"abstract":"Device-to-device (D2D) communication as a direct communication technology has many application scenarios and plays a very important role in the 5G era. Using D2D communication in 3GPP 5G Heterogeneous Network (HetNet) can effectively relieve the network traffic pressure and reduce the energy consumption of the base station. However, there are numerous security threats in D2D application since the introduction of D2D communication into the 3GPP 5G Het-Net still remains in the early stage. It is urgent to design a mutual authentication and key agreement protocol between two heterogeneous User Equipments (UEs) with privacy preserving and device discovery. The existing standards and solutions rarely take the heterogeneous access scenarios, privacy protection, and device discovery into consideration. In this paper, we propose a unified privacy protection device discovery and authentication mechanism for heterogeneous D2D UEs using the identity-based prefix encryption and ECDH techniques. Our proposed scheme can be applied to all of the 5G heterogeneous access scenarios of D2D communication. The security analysis and performance results show that our scheme can achieve the mutual authentication, key agreement, identity privacy protection and resist several protocols attacks with ideal efficiency.","PeriodicalId":161815,"journal":{"name":"2019 International Conference on Computing, Networking and Communications (ICNC)","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124537239","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}
引用次数: 26
MongoDB Clustering using K-means for Real-Time Song Recognition 基于K-means的MongoDB聚类实时歌曲识别
2019 International Conference on Computing, Networking and Communications (ICNC) Pub Date : 2019-02-01 DOI: 10.1109/ICCNC.2019.8685489
Murtadha Arif Bin Sahbudin, M. Scarpa, Salvatore Serrano
{"title":"MongoDB Clustering using K-means for Real-Time Song Recognition","authors":"Murtadha Arif Bin Sahbudin, M. Scarpa, Salvatore Serrano","doi":"10.1109/ICCNC.2019.8685489","DOIUrl":"https://doi.org/10.1109/ICCNC.2019.8685489","url":null,"abstract":"Recently, the increased competition in song recognition has led to the necessity to identify songs within very huge databases compared to previous years. Therefore, information retrieval technique requires a more efficient and scalable data storage framework. In this work, we propose an approach exploiting K-means clustering and describe strategies for improving accuracy and speed. In collaboration with an audio expert company providing us with 2.4 billion fingerprints data, we evaluated the performance of the proposed clustering and recognition algorithm.","PeriodicalId":161815,"journal":{"name":"2019 International Conference on Computing, Networking and Communications (ICNC)","volume":"115 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117266276","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}
引用次数: 4
Blocking Probability Analysis for Relay-Assisted OFDMA Networks using Stochastic Geometry 基于随机几何的中继辅助OFDMA网络阻塞概率分析
2019 International Conference on Computing, Networking and Communications (ICNC) Pub Date : 2019-02-01 DOI: 10.1109/ICCNC.2019.8685498
A. Alahmadi, Yuan Liang, Run Tian, Jian Ren, Tongtong Li
{"title":"Blocking Probability Analysis for Relay-Assisted OFDMA Networks using Stochastic Geometry","authors":"A. Alahmadi, Yuan Liang, Run Tian, Jian Ren, Tongtong Li","doi":"10.1109/ICCNC.2019.8685498","DOIUrl":"https://doi.org/10.1109/ICCNC.2019.8685498","url":null,"abstract":"Along with the emerging high density Internet of Things (IoT) networks, relay-assisted networks are attracting more research attention in recent years due to their abilities to extend the coverage area and improve the Quality of Service (QoS). Blocking probability (BP) has been used as a very important metric in evaluating the QoS of the network. In this paper, taking the spatial randomness of the IoT network into consideration, we investigate blocking probability in relay-assisted OFDMA networks using stochastic geometry. More specifically, first, we analyze the inter-cell interference from the neighboring cells at each typical node. Then, we derive the coverage probability in the downlink transmissions, including both the direct and relay-based transmissions. Finally, we classify the incoming users into different classes based on their data rate requirements, and calculate the blocking probability using the multi-dimensional loss model based on the Markov chains. We show that the blocking probability can be reduced by exploiting relay-assisted transmissions.","PeriodicalId":161815,"journal":{"name":"2019 International Conference on Computing, Networking and Communications (ICNC)","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117133770","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}
引用次数: 2
Distributed Multi-Stream Beamforming in Multi-Relay Interference Networks with Multi-Antenna Nodes 多天线节点多中继干扰网络中的分布式多流波束形成
2019 International Conference on Computing, Networking and Communications (ICNC) Pub Date : 2019-02-01 DOI: 10.1109/ICCNC.2019.8685603
C. M. Yetis, Ronald Y. Chang
{"title":"Distributed Multi-Stream Beamforming in Multi-Relay Interference Networks with Multi-Antenna Nodes","authors":"C. M. Yetis, Ronald Y. Chang","doi":"10.1109/ICCNC.2019.8685603","DOIUrl":"https://doi.org/10.1109/ICCNC.2019.8685603","url":null,"abstract":"In this paper, multi-stream transmission in interference networks aided by multiple amplify-and-forward (AF) relays in the presence of direct links is studied. The objective is to minimize the sum power of transmitters and relays by distributed transmit beamforming optimization under the stream signal-to-interference-plus-noise-ratio (SINR) target constraints. We utilize alternating direction method of multipliers (ADMM) algorithm for distributed implementation. The optimization problem is a well-known non-convex NP-hard quadratically constrained quadratic program (QCQP), which, after semi-definite relaxation (SDR), can be optimally solved via ADMM. The convergence rate, computational complexity, and message exchange load of the proposed algorithm are shown to outperform the existing distributed algorithm.","PeriodicalId":161815,"journal":{"name":"2019 International Conference on Computing, Networking and Communications (ICNC)","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128393501","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}
引用次数: 0
Hadoop Performance Evaluation in Software Defined Data Center Networks 软件定义数据中心网络中的Hadoop性能评估
2019 International Conference on Computing, Networking and Communications (ICNC) Pub Date : 2019-02-01 DOI: 10.1109/ICCNC.2019.8685506
Claudio Calcaterra, A. Carmenini, A. Marotta, D. Cassioli
{"title":"Hadoop Performance Evaluation in Software Defined Data Center Networks","authors":"Claudio Calcaterra, A. Carmenini, A. Marotta, D. Cassioli","doi":"10.1109/ICCNC.2019.8685506","DOIUrl":"https://doi.org/10.1109/ICCNC.2019.8685506","url":null,"abstract":"The wide spread of Big Data applications and services raised the need of implementing dedicated frameworks for the efficient management of data storage and access. Complex data center architectures have been defined to support such applications, where the network connections are often the bottleneck for data access and retrieval. In this paper we analyze a data center architecture based on a Fat-Tree topology running Hadoop as the framework for data management. The network is based on the software defined networking paradigm allowing the routing protocol to be switched between the spanning tree, the shortest path bridging and the equal cost multipath. The results show that performance of Hadoop are strongly influenced by the choice of the network protocols in dependence of the traffic load. The performance evaluation is based on a dedicated novel simulation framework named MaxHadoop.","PeriodicalId":161815,"journal":{"name":"2019 International Conference on Computing, Networking and Communications (ICNC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129619096","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}
引用次数: 3
Clustering Enabled Classification using Ensemble Feature Selection for Intrusion Detection 基于集成特征选择的入侵检测聚类分类
2019 International Conference on Computing, Networking and Communications (ICNC) Pub Date : 2019-02-01 DOI: 10.1109/ICCNC.2019.8685636
F. Salo, M. Injadat, Abdallah Moubayed, A. B. Nassif, A. Essex
{"title":"Clustering Enabled Classification using Ensemble Feature Selection for Intrusion Detection","authors":"F. Salo, M. Injadat, Abdallah Moubayed, A. B. Nassif, A. Essex","doi":"10.1109/ICCNC.2019.8685636","DOIUrl":"https://doi.org/10.1109/ICCNC.2019.8685636","url":null,"abstract":"Machine learning has been leveraged to increase the effectiveness of intrusion detection systems (IDSs). The focus of this approach, however, has largely be on detecting known attack patterns based on outdated datasets. In this paper, we propose an ensemble feature selection method along with an anomaly detection method that combines unsupervised and supervised machine learning techniques to classify network traffic to identify previously unseen attack patterns. To that end, three different feature selection techniques are used as part of an ensemble model that selects 8 common features. Moreover, k-Means clustering is used to first partition the training instances into k clusters using the Manhattan distance. A classification model is then built based on the resulting clusters, which represent a density region of normal or anomaly instances. This in turn helps determine the effectiveness of the clustering in detecting unknown attack patterns within the data. The performance of our classifier is evaluated using the Kyoto dataset, which was collected between 2006 and 2015. To our knowledge, no previous work proposed such a framework that combines unsupervised and supervised machine learning approaches using this dataset. Experimental results show the effectiveness of the proposed framework in detecting previously unseen attack patterns compared to the traditional classification approach.","PeriodicalId":161815,"journal":{"name":"2019 International Conference on Computing, Networking and Communications (ICNC)","volume":"119 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130407399","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}
引用次数: 32
Mobile Device Localization in 5G Wireless Networks 5G无线网络中的移动设备定位
2019 International Conference on Computing, Networking and Communications (ICNC) Pub Date : 2019-02-01 DOI: 10.1109/ICCNC.2019.8685597
Dandan Wang, Gurudutt Hosangadi, Pantelis Monogioudis, A. Rao
{"title":"Mobile Device Localization in 5G Wireless Networks","authors":"Dandan Wang, Gurudutt Hosangadi, Pantelis Monogioudis, A. Rao","doi":"10.1109/ICCNC.2019.8685597","DOIUrl":"https://doi.org/10.1109/ICCNC.2019.8685597","url":null,"abstract":"As wireless networks are evolving into 5G, tremendous amount of data will be shared on the newly developed open source platforms. These data can be used in developing new services. Among which, location information of mobile devices are extremely useful. For example, the location information can be used to assist wireless operators to trouble shoot the network performance. It can also be used to provide some location assisted service. However, some of these devices may be designed for limited budget that do not have the capability of GPS. Furthermore, operators may not have access to the GPS information on the mobile devices. In this paper, we propose a novel machine learning based approach to estimate the location of the mobile devices based on the measurement data that mobiles reported during every call and session. Our proposed algorithm utilizes the advanced features of 5G wireless network, such as the beam information. Simulation shows that the proposed solution can achieve 4m accuracy for LoS enviorment and 12m accuracy for mixed LoS and NLoS environment. And the proposed algorithm can also work even with only the information from one base station.","PeriodicalId":161815,"journal":{"name":"2019 International Conference on Computing, Networking and Communications (ICNC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130453990","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}
引用次数: 6
A Robust Road Region of Interest Identification Scheme for Traffic-Video Data Mining 一种用于交通视频数据挖掘的鲁棒道路兴趣区域识别方案
2019 International Conference on Computing, Networking and Communications (ICNC) Pub Date : 2019-02-01 DOI: 10.1109/ICCNC.2019.8685513
Anes Madani, Suman Kumar, Linh Ba Nguyen, Jiling Zhong
{"title":"A Robust Road Region of Interest Identification Scheme for Traffic-Video Data Mining","authors":"Anes Madani, Suman Kumar, Linh Ba Nguyen, Jiling Zhong","doi":"10.1109/ICCNC.2019.8685513","DOIUrl":"https://doi.org/10.1109/ICCNC.2019.8685513","url":null,"abstract":"Traffic video data mining applications demand a road region of interest be identified. Typically, the region of interest is drawn manually, thus making it challenging to design large scale data mining applications utilizing widely available open access live stream traffic cameras since diverse scenarios require diverse region drawings. This paper presents a novel algorithm to identify road region of interest, therefore, automating the otherwise a manual process and making it applicable to diverse traffic live stream scenarios encountered in practice. The algorithm utilizes problem domain property of vehicle mobility constraints. Through experimentation, we show that algorithm is robustly resistant to the wide variety of cases of camera resolution, traffic volume, light condition, camera shakiness etc. The algorithm aims to simplify the overall design of large scale open camera traffic video mining task to aid next generation transportation-data-as-a-service based applications.","PeriodicalId":161815,"journal":{"name":"2019 International Conference on Computing, Networking and Communications (ICNC)","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126765834","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}
引用次数: 0
What To Do First: Ranking The Mission Impact Graph for Effective Mission Assurance 首先要做的是:为有效的任务保证排列任务影响图
2019 International Conference on Computing, Networking and Communications (ICNC) Pub Date : 2019-02-01 DOI: 10.1109/ICCNC.2019.8685579
Pranavi Appana, Xiaoyan Sun, Yuan Cheng
{"title":"What To Do First: Ranking The Mission Impact Graph for Effective Mission Assurance","authors":"Pranavi Appana, Xiaoyan Sun, Yuan Cheng","doi":"10.1109/ICCNC.2019.8685579","DOIUrl":"https://doi.org/10.1109/ICCNC.2019.8685579","url":null,"abstract":"Network attacks continue to pose threats to missions in cyber space. To prevent critical missions from getting impacted or minimize the possibility of mission impact, active cyber defense is very important. Mission impact graph is a graphical model that enables mission impact assessment and shows how missions can be possibly impacted by cyber attacks. Although the mission impact graph provides valuable information, it is still very difficult for human analysts to comprehend due to its size and complexity. Especially when given limited resources, human analysts cannot easily decide which security measures to take first with respect to mission assurance. Therefore, this paper proposes to apply a ranking algorithm towards the mission impact graph so that the huge amount of information can be prioritized. The actionable conditions that can be managed by security admins are ranked with numeric values. The rank enables efficient utilization of limited resources and provides guidance for taking security countermeasures.","PeriodicalId":161815,"journal":{"name":"2019 International Conference on Computing, Networking and Communications (ICNC)","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123376257","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}
引用次数: 1
Intelligent Scheduling for Parallel Jobs in Big Data Processing Systems 大数据处理系统中并行作业的智能调度
2019 International Conference on Computing, Networking and Communications (ICNC) Pub Date : 2019-02-01 DOI: 10.1109/ICCNC.2019.8685520
Mingrui Xu, C. Wu, Aiqin Hou, Yongqiang Wang
{"title":"Intelligent Scheduling for Parallel Jobs in Big Data Processing Systems","authors":"Mingrui Xu, C. Wu, Aiqin Hou, Yongqiang Wang","doi":"10.1109/ICCNC.2019.8685520","DOIUrl":"https://doi.org/10.1109/ICCNC.2019.8685520","url":null,"abstract":"The explosive growth of data in various scientific, industrial, and business domains necessitates the use of big data processing systems, such as Hadoop, which are typically deployed in a physical or cloud-based cluster shared by many users running parallel jobs. As the user population and application scale increase, such systems are expanded from time to time with an addition of new nodes of different types, making the cluster highly heterogeneous. Job scheduling in such systems largely determines the performance of big data applications and remains to be a challenging problem. In this paper, we formulate a generic job scheduling problem for parallel processing of big data in heterogeneous clusters and design a k-means based task scheduling algorithm, referred to as KMTS. Simulation results show that KMTS improves execution performance by 25% and 30% on average in single job scheduling and parallel job scheduling, respectively, over existing methods. The performance superiority is also confirmed by real experiments in high-performance computing environments.","PeriodicalId":161815,"journal":{"name":"2019 International Conference on Computing, Networking and Communications (ICNC)","volume":"55 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121547851","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}
引用次数: 8
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信