Pub Date : 2015-12-03DOI: 10.1109/Trustcom.2015.524
Weiqing Huang, Chang Ding, Siye Wang, Shuang Hu
In recent years, with the rapid development of wireless communication technology including Wi-Fi, Bluetooth and RFID and other new types of positioning method, the indoor mobile object positioning has become possible. At present the research on indoor mobile object trajectory analysis is still in the start stage. But as people and goods stay indoor environment for most of time, the indoor positioning technology and the analysis of the indoor moving targets track will be the developing trend in the future. When deployed in real environment, the existing indoor moving target trajectory analysis methods need high equipment cost and their scalability is also very poor. In this paper we proposes an algorithm for indoor moving target trajectory analysis and data clustering based on improved AGNES algorithm. Through improving the weighted function of the algorithm, we realize the extraction and analysis of the indoor moving target trajectory. After deploying in the actual environment, we test the algorithm in practice. The results indicate that the improved algorithm greatly reduces the number of hardware and the deployment cost. And it can also effectively improve the efficiency of the moving target trajectory analysis.
{"title":"An Efficient Clustering Mining Algorithm for Indoor Moving Target Trajectory Based on the Improved AGNES","authors":"Weiqing Huang, Chang Ding, Siye Wang, Shuang Hu","doi":"10.1109/Trustcom.2015.524","DOIUrl":"https://doi.org/10.1109/Trustcom.2015.524","url":null,"abstract":"In recent years, with the rapid development of wireless communication technology including Wi-Fi, Bluetooth and RFID and other new types of positioning method, the indoor mobile object positioning has become possible. At present the research on indoor mobile object trajectory analysis is still in the start stage. But as people and goods stay indoor environment for most of time, the indoor positioning technology and the analysis of the indoor moving targets track will be the developing trend in the future. When deployed in real environment, the existing indoor moving target trajectory analysis methods need high equipment cost and their scalability is also very poor. In this paper we proposes an algorithm for indoor moving target trajectory analysis and data clustering based on improved AGNES algorithm. Through improving the weighted function of the algorithm, we realize the extraction and analysis of the indoor moving target trajectory. After deploying in the actual environment, we test the algorithm in practice. The results indicate that the improved algorithm greatly reduces the number of hardware and the deployment cost. And it can also effectively improve the efficiency of the moving target trajectory analysis.","PeriodicalId":277092,"journal":{"name":"2015 IEEE Trustcom/BigDataSE/ISPA","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-12-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130148197","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 : 2015-12-03DOI: 10.1109/Trustcom.2015.512
Wei Wang, Zhan Wang, W. Zhu, Lei Wang
Secure pairing between wireless devices with limited I/O interfaces is a challenging problem due to the difficulty in implementing authentication. Wireless channel characteristics can be utilized to facilitate authentication between such devices. In this paper, we propose WAVE, a novel scheme for pairing nearby wireless devices by monitoring the received signal strength (RSS) under the interference of intentionally involved human body movements. The deliberate body movements pose different effects on the legitimate channel and the attacking channel, which helps to distinguish a nearby legitimate device from an illegitimate one that is placed relatively further. The experimental results show the effectiveness of the scheme. Compared with other existing solutions, WAVE achieves high time efficiency and requires minimum hardware support, making it a favorable choice for appliances in wireless personal area networks.
{"title":"WAVE: Secure Wireless Pairing Exploiting Human Body Movements","authors":"Wei Wang, Zhan Wang, W. Zhu, Lei Wang","doi":"10.1109/Trustcom.2015.512","DOIUrl":"https://doi.org/10.1109/Trustcom.2015.512","url":null,"abstract":"Secure pairing between wireless devices with limited I/O interfaces is a challenging problem due to the difficulty in implementing authentication. Wireless channel characteristics can be utilized to facilitate authentication between such devices. In this paper, we propose WAVE, a novel scheme for pairing nearby wireless devices by monitoring the received signal strength (RSS) under the interference of intentionally involved human body movements. The deliberate body movements pose different effects on the legitimate channel and the attacking channel, which helps to distinguish a nearby legitimate device from an illegitimate one that is placed relatively further. The experimental results show the effectiveness of the scheme. Compared with other existing solutions, WAVE achieves high time efficiency and requires minimum hardware support, making it a favorable choice for appliances in wireless personal area networks.","PeriodicalId":277092,"journal":{"name":"2015 IEEE Trustcom/BigDataSE/ISPA","volume":"75 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-12-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124798112","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 : 2015-12-03DOI: 10.1109/Trustcom.2015.523
Huan Zhao, Chaoming Hu, Rui Zheng, Bin Lv
Wireless sensor network coverage is a core problem of wireless sensor network and the deployment performance of the nodes directly influence the entire WSN. However, the nodes are extremely vulnerable to attacks or intrusion during the process of covering. Therefore, how to ensure the communication security and coverage reliability of the WSN under attack is a big challenge. To address it, this paper proposes an adaptive intrusion tolerant coverage method of WSN based on trust through combining an optimization algorithm with the trust model. Firstly, the method evaluates the trust degree of every node and then adjusts its perception radius and decision radius according to the value. Combined with the improved PSO algorithm, we implement the adaptive intrusion tolerant coverage of WSN. The proposed method is tested and compared with the traditional coverage methods, and it demonstrates that when WSN is attacked, the presented method is more security and has a better coverage.
{"title":"Study on the Coverage of Adaptive Wireless Sensor Network Based on Trust","authors":"Huan Zhao, Chaoming Hu, Rui Zheng, Bin Lv","doi":"10.1109/Trustcom.2015.523","DOIUrl":"https://doi.org/10.1109/Trustcom.2015.523","url":null,"abstract":"Wireless sensor network coverage is a core problem of wireless sensor network and the deployment performance of the nodes directly influence the entire WSN. However, the nodes are extremely vulnerable to attacks or intrusion during the process of covering. Therefore, how to ensure the communication security and coverage reliability of the WSN under attack is a big challenge. To address it, this paper proposes an adaptive intrusion tolerant coverage method of WSN based on trust through combining an optimization algorithm with the trust model. Firstly, the method evaluates the trust degree of every node and then adjusts its perception radius and decision radius according to the value. Combined with the improved PSO algorithm, we implement the adaptive intrusion tolerant coverage of WSN. The proposed method is tested and compared with the traditional coverage methods, and it demonstrates that when WSN is attacked, the presented method is more security and has a better coverage.","PeriodicalId":277092,"journal":{"name":"2015 IEEE Trustcom/BigDataSE/ISPA","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-12-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122179449","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 : 2015-12-03DOI: 10.1109/Trustcom.2015.520
Huan Zhao, Qian Zhang, L. Zhang, Yan Wang
The sensor deployment is a fundamental problem in wireless sensor networks(WSN), the performance of WSN largely depends on a good sensor deployment scheme. In this paper,we present a novel sensor deployment scheme based on fruit fly algorithm(FOA) to improve the coverage rate. Each fruit fly represents a solution for sensor deployment independently, and they are given the random direction and distance for finding food using osphresis.Then we find out the fruit fly with the highest smell concentration judgment value from the fruit fly group and keep its positions,and then the fruit fly group will fly towards that position by using their sensitive vision.We have done simulations both in the ideal and obstacle areas, FOA-based sensor deployment is compared with the classic standard PSO and the novel GSO,simulation results show the effectiveness of the proposed approach.
{"title":"A Novel Sensor Deployment Approach Using Fruit Fly Optimization Algorithm in Wireless Sensor Networks","authors":"Huan Zhao, Qian Zhang, L. Zhang, Yan Wang","doi":"10.1109/Trustcom.2015.520","DOIUrl":"https://doi.org/10.1109/Trustcom.2015.520","url":null,"abstract":"The sensor deployment is a fundamental problem in wireless sensor networks(WSN), the performance of WSN largely depends on a good sensor deployment scheme. In this paper,we present a novel sensor deployment scheme based on fruit fly algorithm(FOA) to improve the coverage rate. Each fruit fly represents a solution for sensor deployment independently, and they are given the random direction and distance for finding food using osphresis.Then we find out the fruit fly with the highest smell concentration judgment value from the fruit fly group and keep its positions,and then the fruit fly group will fly towards that position by using their sensitive vision.We have done simulations both in the ideal and obstacle areas, FOA-based sensor deployment is compared with the classic standard PSO and the novel GSO,simulation results show the effectiveness of the proposed approach.","PeriodicalId":277092,"journal":{"name":"2015 IEEE Trustcom/BigDataSE/ISPA","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-12-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115397709","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 : 2015-12-03DOI: 10.1109/Trustcom.2015.517
Hongsong Chen, Z. Han, Zhongchuan Fu
With the rapid development and application of wireless sensor network(WSN),security and trust are important to the network. The initial requirement for wireless sensor networks is power efficiency. As the cooperation character of the network, trust routing and management are also important to wireless sensor network. As the threats come from various attacks, novel trust routing scheme is proposed to enhance security of the network. Trust routing scheme is becoming a key method to protect the security of protocol in wireless sensor network. Quantitative trust evaluation scheme is proposed to enhance security and reliability of wireless sensor network. The definition and mathematic description of trust routing is proposed in the paper. Ad hoc On-Demand Distance Vector (AODV) routing protocol is used to validate trust routing scheme in wireless sensor network, Route Reply (RREP) Message is extended to record node residual energy evaluation and attack behaviour evaluation. NS-2 simulator is used to simulate the trust routing scheme under different network attack behaviors. Five kinds of node attack behaviors are used to evaluate and validate the trust routing scheme. Simulation results show that trust routing scheme can improve the security and performance of network. It shows better than other security scheme.
{"title":"Quantitative Trustworthy Evaluation Scheme for Trust Routing Scheme in Wireless Sensor Networks","authors":"Hongsong Chen, Z. Han, Zhongchuan Fu","doi":"10.1109/Trustcom.2015.517","DOIUrl":"https://doi.org/10.1109/Trustcom.2015.517","url":null,"abstract":"With the rapid development and application of wireless sensor network(WSN),security and trust are important to the network. The initial requirement for wireless sensor networks is power efficiency. As the cooperation character of the network, trust routing and management are also important to wireless sensor network. As the threats come from various attacks, novel trust routing scheme is proposed to enhance security of the network. Trust routing scheme is becoming a key method to protect the security of protocol in wireless sensor network. Quantitative trust evaluation scheme is proposed to enhance security and reliability of wireless sensor network. The definition and mathematic description of trust routing is proposed in the paper. Ad hoc On-Demand Distance Vector (AODV) routing protocol is used to validate trust routing scheme in wireless sensor network, Route Reply (RREP) Message is extended to record node residual energy evaluation and attack behaviour evaluation. NS-2 simulator is used to simulate the trust routing scheme under different network attack behaviors. Five kinds of node attack behaviors are used to evaluate and validate the trust routing scheme. Simulation results show that trust routing scheme can improve the security and performance of network. It shows better than other security scheme.","PeriodicalId":277092,"journal":{"name":"2015 IEEE Trustcom/BigDataSE/ISPA","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-12-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126900194","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 : 2015-12-03DOI: 10.1109/Trustcom.2015.519
Zuo Chen, Mengyuan Jia, Yan Wang, Xiaolong Yan
It is a key problem for reducing the network energy consumption and improving energy utilization of sensor nodes, due to the limited energy of sensor nodes. Because of open, distributed and self-organization characteristics of WSNs, it is vulnerable to the threat of energy in the network topology construction and communication process, but traditional methods which assume the sensor nodes to be credible were unable to cope with the energy attacks. Based on this, this paper proposes a security topology protocol of wireless sensor network named as CDEA according to community detection and energy aware. The method uses complex network community division algorithm for detecting the similar energy behaviour nodes in the neighbourhood of these nodes, and elects the cluster head according to energy, credibility and the distance to the base station, and carries on the choice of the next hop node accessing based on the principle of the immune response and finally gets low power consumption secure topological structure. The experimental results shows that the CDEA not only can reduce and balance the network energy, but also prolong the survival time of the system, and resist the energy attack at the same time.
{"title":"A Security Topology Protocol of Wireless Sensor Networks Based on Community Detection and Energy Aware","authors":"Zuo Chen, Mengyuan Jia, Yan Wang, Xiaolong Yan","doi":"10.1109/Trustcom.2015.519","DOIUrl":"https://doi.org/10.1109/Trustcom.2015.519","url":null,"abstract":"It is a key problem for reducing the network energy consumption and improving energy utilization of sensor nodes, due to the limited energy of sensor nodes. Because of open, distributed and self-organization characteristics of WSNs, it is vulnerable to the threat of energy in the network topology construction and communication process, but traditional methods which assume the sensor nodes to be credible were unable to cope with the energy attacks. Based on this, this paper proposes a security topology protocol of wireless sensor network named as CDEA according to community detection and energy aware. The method uses complex network community division algorithm for detecting the similar energy behaviour nodes in the neighbourhood of these nodes, and elects the cluster head according to energy, credibility and the distance to the base station, and carries on the choice of the next hop node accessing based on the principle of the immune response and finally gets low power consumption secure topological structure. The experimental results shows that the CDEA not only can reduce and balance the network energy, but also prolong the survival time of the system, and resist the energy attack at the same time.","PeriodicalId":277092,"journal":{"name":"2015 IEEE Trustcom/BigDataSE/ISPA","volume":"59 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-12-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124481985","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 : 2015-08-20DOI: 10.1109/Trustcom.2015.496
Xiaotian Wang, M. Davis, Junjie Zhang, V. Saunders
Designing secure cyber-physical systems (CPS) is fundamentally important and performing vulnerability assessment becomes indispensable. In this paper, we discuss our ongoing work on building an automated mission-aware vulnerability CPS assessment framework that can accomplish three objectives including i) mapping CPS missions into infrastructural components, ii) evaluating global impact of each vulnerability, and iii) achieving verifiable results and high flexibility. In order to accomplish these objectives, we follow a model-assisted analysis strategy. Specifically, we take advantage of CPS simulator to model the behaviors of CPS components under different missions, our framework facilitates a bottom-up approach to construct a holistic model of a CPS that aim at profiling relationships among all CPS components. Formal methods, including program symbolic execution, logic programming, and linear optimization, have been employed to analyze the model, which build mathematical rigor into our framework. The framework first identifies mission-critical components, then discovers all attack paths from system access points to mission-critical components, and finally recommends the optimized mitigation plan.
{"title":"Mission-Aware Vulnerability Assessment for Cyber-Physical Systems","authors":"Xiaotian Wang, M. Davis, Junjie Zhang, V. Saunders","doi":"10.1109/Trustcom.2015.496","DOIUrl":"https://doi.org/10.1109/Trustcom.2015.496","url":null,"abstract":"Designing secure cyber-physical systems (CPS) is fundamentally important and performing vulnerability assessment becomes indispensable. In this paper, we discuss our ongoing work on building an automated mission-aware vulnerability CPS assessment framework that can accomplish three objectives including i) mapping CPS missions into infrastructural components, ii) evaluating global impact of each vulnerability, and iii) achieving verifiable results and high flexibility. In order to accomplish these objectives, we follow a model-assisted analysis strategy. Specifically, we take advantage of CPS simulator to model the behaviors of CPS components under different missions, our framework facilitates a bottom-up approach to construct a holistic model of a CPS that aim at profiling relationships among all CPS components. Formal methods, including program symbolic execution, logic programming, and linear optimization, have been employed to analyze the model, which build mathematical rigor into our framework. The framework first identifies mission-critical components, then discovers all attack paths from system access points to mission-critical components, and finally recommends the optimized mitigation plan.","PeriodicalId":277092,"journal":{"name":"2015 IEEE Trustcom/BigDataSE/ISPA","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-08-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115318326","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 : 2015-08-20DOI: 10.1109/Trustcom.2015.460
H. Kühner, H. Hartenstein
Sharing data within a closed user group is the basis for lots of applications today in both personal and professional life. The risk that the storage provider or an attacker illegitimately inspects or tampers with the shared data can be mitigated by employing client-side cryptography. In this work, we estimate the resource consumption that secure data sharing based on client-side cryptography requires in terms of computation time and network traffic volume. We therefore go beyond asymptotical analyses and state the absolute resource consumption for different secure data sharing protocols and client devices under realistic sharing models. These sharing models are extracted from traces of real-world collaboration platforms running in production. To the best of our knowledge, this is the first time that such a characterization of sharing models is published. Furthermore, we provide a clearly defined resource consumption estimation model. Our results show that for users who just up-and download data, the execution time of required cryptographic operations is typically up to a few seconds. The results also show that group owners have to deal with significantly higher computation times and network traffic when a user is removed from a sharing group with a few hundred or more members, given that basic secure data sharing protocols are used as they are in place today. A further finding is that computation time and network traffic volume are considerably lowered by extending the secure data sharing protocol with group key management approaches, at the price of slightly raised computation times for smaller groups.
{"title":"On the Resource Consumption of Secure Data Sharing","authors":"H. Kühner, H. Hartenstein","doi":"10.1109/Trustcom.2015.460","DOIUrl":"https://doi.org/10.1109/Trustcom.2015.460","url":null,"abstract":"Sharing data within a closed user group is the basis for lots of applications today in both personal and professional life. The risk that the storage provider or an attacker illegitimately inspects or tampers with the shared data can be mitigated by employing client-side cryptography. In this work, we estimate the resource consumption that secure data sharing based on client-side cryptography requires in terms of computation time and network traffic volume. We therefore go beyond asymptotical analyses and state the absolute resource consumption for different secure data sharing protocols and client devices under realistic sharing models. These sharing models are extracted from traces of real-world collaboration platforms running in production. To the best of our knowledge, this is the first time that such a characterization of sharing models is published. Furthermore, we provide a clearly defined resource consumption estimation model. Our results show that for users who just up-and download data, the execution time of required cryptographic operations is typically up to a few seconds. The results also show that group owners have to deal with significantly higher computation times and network traffic when a user is removed from a sharing group with a few hundred or more members, given that basic secure data sharing protocols are used as they are in place today. A further finding is that computation time and network traffic volume are considerably lowered by extending the secure data sharing protocol with group key management approaches, at the price of slightly raised computation times for smaller groups.","PeriodicalId":277092,"journal":{"name":"2015 IEEE Trustcom/BigDataSE/ISPA","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-08-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125210997","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 : 2015-08-20DOI: 10.1109/Trustcom.2015.563
Sepideh Seifzadeh, A. Miri
Recommender systems are mostly used to make the appropriate personalized recommendation for different customers. Collaborative filtering recommendation is one of the most popular methods among E-commerce systems, but it has some shortcomings, such as cold starts, in which the system fails to consider items which no one in the community has rated previously, and sparse data, which is caused by a low number of rankings by users which results in a sparse similarity matrix. Most of the existing approaches have shortcomings of sparsity and scalability. In this paper we propose a method that approximates the matrix of users similarities with Nyström low-rank approximations and is based on Collaborative Filtering (CF). The proposed method avoids the high computation cost of Singular Value Decomposition (SVD) and also enables us to use the low-rank approximation of the similarity matrix to handle huge datasets with low computation costs. The experimental results show that the proposed approach can solve the problem of sparsity, while increasing the efficiency and scalability of the system.
{"title":"Similarity Measure Based on Low-Rank Approximation for Highly Scalable Recommender Systems","authors":"Sepideh Seifzadeh, A. Miri","doi":"10.1109/Trustcom.2015.563","DOIUrl":"https://doi.org/10.1109/Trustcom.2015.563","url":null,"abstract":"Recommender systems are mostly used to make the appropriate personalized recommendation for different customers. Collaborative filtering recommendation is one of the most popular methods among E-commerce systems, but it has some shortcomings, such as cold starts, in which the system fails to consider items which no one in the community has rated previously, and sparse data, which is caused by a low number of rankings by users which results in a sparse similarity matrix. Most of the existing approaches have shortcomings of sparsity and scalability. In this paper we propose a method that approximates the matrix of users similarities with Nyström low-rank approximations and is based on Collaborative Filtering (CF). The proposed method avoids the high computation cost of Singular Value Decomposition (SVD) and also enables us to use the low-rank approximation of the similarity matrix to handle huge datasets with low computation costs. The experimental results show that the proposed approach can solve the problem of sparsity, while increasing the efficiency and scalability of the system.","PeriodicalId":277092,"journal":{"name":"2015 IEEE Trustcom/BigDataSE/ISPA","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-08-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116643947","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 : 2015-08-20DOI: 10.1109/Trustcom.2015.502
Nicolae Paladi, C. Gehrmann
Network virtualization enables multi-tenancy over physical network infrastructure, with a side-effect of increased network complexity. Software-defined networking (SDN) is a novel network architectural model -- one where the control plane is separated from the data plane by a standardized API -- which aims to reduce the network management overhead. However, as the SDN model itself is evolving, its application to multi-tenant virtualized networks raises multiple security challenges. In this paper, we present a security analysis of SDN-based multi-tenant virtualized networks: we outline the security assumptions applicable to such networks, define the relevant adversarial model, identify the main attack vectors for such network infrastructure deployments and finally synthesize a set of high-level security requirements for SDN-based multi-tenant virtualized networks. This paper sets the foundation for future design of secure SDN-based multi-tenant virtualized networks.
{"title":"Towards Secure Multi-tenant Virtualized Networks","authors":"Nicolae Paladi, C. Gehrmann","doi":"10.1109/Trustcom.2015.502","DOIUrl":"https://doi.org/10.1109/Trustcom.2015.502","url":null,"abstract":"Network virtualization enables multi-tenancy over physical network infrastructure, with a side-effect of increased network complexity. Software-defined networking (SDN) is a novel network architectural model -- one where the control plane is separated from the data plane by a standardized API -- which aims to reduce the network management overhead. However, as the SDN model itself is evolving, its application to multi-tenant virtualized networks raises multiple security challenges. In this paper, we present a security analysis of SDN-based multi-tenant virtualized networks: we outline the security assumptions applicable to such networks, define the relevant adversarial model, identify the main attack vectors for such network infrastructure deployments and finally synthesize a set of high-level security requirements for SDN-based multi-tenant virtualized networks. This paper sets the foundation for future design of secure SDN-based multi-tenant virtualized networks.","PeriodicalId":277092,"journal":{"name":"2015 IEEE Trustcom/BigDataSE/ISPA","volume":"64 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-08-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117205938","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
扫码关注我们
求助内容：
应助结果提醒方式：