Pub Date : 2017-10-01DOI: 10.1109/ICCT.2017.8359847
Aaron Zimba, Chen Hongsong, Wang Zhao-shun
The Infrastructure as a Service (IaaS) offering of cloud computing has come to alleviate some of the challenges associated with infrastructural investments and other related costs for enterprise users. However, hypervisor networks in IaaS environments are not immune to security breaches as the components therein tend to exhibit vulnerabilities which are exploited by attackers. Attackers chain together these vulnerabilities for effective attack path traversal in a given attack. The challenge has not been in identifying the vulnerable components but in capturing the dependencies amongst the vulnerabilities and statistically evaluating the effect exerted by one vulnerability unto another. In this paper, we capture the dependencies between vulnerabilities in hypervisor networks by aggregating incoming attack edges via disjunction and conjunction of attack events in the resultant Bayesian attack network. We illustrate the use of local conditional probabilities distributions at a given node to evaluate the likelihood of node exploitation for attack propagation under varying conditions. We further identify critical nodes and edges without which a given attack will not materialize and show how a security analyst can use such in the security mitigation process. We model the security status of the target node using a finite state machine where state transitions are induced by attack instances in the aggregated critical edge.
{"title":"Edge aggregation based Bayesian modeling of cyber attacks in hypervisor-enabled IaaS cloud networks","authors":"Aaron Zimba, Chen Hongsong, Wang Zhao-shun","doi":"10.1109/ICCT.2017.8359847","DOIUrl":"https://doi.org/10.1109/ICCT.2017.8359847","url":null,"abstract":"The Infrastructure as a Service (IaaS) offering of cloud computing has come to alleviate some of the challenges associated with infrastructural investments and other related costs for enterprise users. However, hypervisor networks in IaaS environments are not immune to security breaches as the components therein tend to exhibit vulnerabilities which are exploited by attackers. Attackers chain together these vulnerabilities for effective attack path traversal in a given attack. The challenge has not been in identifying the vulnerable components but in capturing the dependencies amongst the vulnerabilities and statistically evaluating the effect exerted by one vulnerability unto another. In this paper, we capture the dependencies between vulnerabilities in hypervisor networks by aggregating incoming attack edges via disjunction and conjunction of attack events in the resultant Bayesian attack network. We illustrate the use of local conditional probabilities distributions at a given node to evaluate the likelihood of node exploitation for attack propagation under varying conditions. We further identify critical nodes and edges without which a given attack will not materialize and show how a security analyst can use such in the security mitigation process. We model the security status of the target node using a finite state machine where state transitions are induced by attack instances in the aggregated critical edge.","PeriodicalId":199874,"journal":{"name":"2017 IEEE 17th International Conference on Communication Technology (ICCT)","volume":"99 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131788577","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2017-10-01DOI: 10.1109/ICCT.2017.8359755
Mingyue Zhou, Hao Yin, Hongzhi Wang
Most of traditional power allocation algorithms in the cognitive radio networks (CRNs) are often based on the assumption of perfect channel estimation. We investigate the power allocation algorithm by considering channel gain uncertainty where a primary ad-hoc network working in parallel with a secondary ad-hoc network. Reducing interference and saving energy are essential in radio resource management of cognitive radio networks. The objective is to minimum transmit power while guaranteeing both acceptable transmission data rate for secondary users (SUs) and interference constraints for primary users (PUs). Imperfect channel state information is considered by ellipsoid sets and the problem can be formulated to a second-order cone programming problem. We can solve the robust power allocation problem by a distributed algorithm efficiently. Numerical results verify that the proposed algorithm with rate constraints can get higher transmission performance for SUs.
{"title":"Robust energy efficiency power allocation algorithm for cognitive radio networks with rate constraints","authors":"Mingyue Zhou, Hao Yin, Hongzhi Wang","doi":"10.1109/ICCT.2017.8359755","DOIUrl":"https://doi.org/10.1109/ICCT.2017.8359755","url":null,"abstract":"Most of traditional power allocation algorithms in the cognitive radio networks (CRNs) are often based on the assumption of perfect channel estimation. We investigate the power allocation algorithm by considering channel gain uncertainty where a primary ad-hoc network working in parallel with a secondary ad-hoc network. Reducing interference and saving energy are essential in radio resource management of cognitive radio networks. The objective is to minimum transmit power while guaranteeing both acceptable transmission data rate for secondary users (SUs) and interference constraints for primary users (PUs). Imperfect channel state information is considered by ellipsoid sets and the problem can be formulated to a second-order cone programming problem. We can solve the robust power allocation problem by a distributed algorithm efficiently. Numerical results verify that the proposed algorithm with rate constraints can get higher transmission performance for SUs.","PeriodicalId":199874,"journal":{"name":"2017 IEEE 17th International Conference on Communication Technology (ICCT)","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132618596","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2017-10-01DOI: 10.1109/ICCT.2017.8359619
P. Zhen, Yinzi Tu, Bingbing Xia, Jie Gan, Xiaoke Tang
SM9 is identity-based cryptography designed by bilinear pairing, which can effectively solve the certificates management problems of the PKI and constitutes an important part of Chinese commercial cryptography system. Due to the high complexity of bilinear pairing, SM9 still faces the problem of low efficiency, especially in resource-constrained environments, so performance becomes the key factor that hinders its wide application. This paper has explicitly analyzed detailed computation process of Miller loop in SM9 bilinear pairings and proposed the optimization methods for the point addition, point doubling and line function computation on BN curves. Furthermore, we compare the computational cost of Miller loop under the projective coordinate system and the Jacobian coordinate system and the results show that the latter can improve the efficiency by 5% than the former. The research is very important to optimize the SM9 the performance.
{"title":"Research on the miller loop optimization of SM9 bilinear pairings","authors":"P. Zhen, Yinzi Tu, Bingbing Xia, Jie Gan, Xiaoke Tang","doi":"10.1109/ICCT.2017.8359619","DOIUrl":"https://doi.org/10.1109/ICCT.2017.8359619","url":null,"abstract":"SM9 is identity-based cryptography designed by bilinear pairing, which can effectively solve the certificates management problems of the PKI and constitutes an important part of Chinese commercial cryptography system. Due to the high complexity of bilinear pairing, SM9 still faces the problem of low efficiency, especially in resource-constrained environments, so performance becomes the key factor that hinders its wide application. This paper has explicitly analyzed detailed computation process of Miller loop in SM9 bilinear pairings and proposed the optimization methods for the point addition, point doubling and line function computation on BN curves. Furthermore, we compare the computational cost of Miller loop under the projective coordinate system and the Jacobian coordinate system and the results show that the latter can improve the efficiency by 5% than the former. The research is very important to optimize the SM9 the performance.","PeriodicalId":199874,"journal":{"name":"2017 IEEE 17th International Conference on Communication Technology (ICCT)","volume":"2011 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130862031","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2017-10-01DOI: 10.1109/ICCT.2017.8359914
Bo Peng, Jie Yang
HEVC, the latest video coding standard, is jointly developed by ISO/IEC and ITU-T. Based on HEVC, an optimized generalized difference expansion method for reversible video information hiding is realized. Firstly, 2N+1 values of the spatial point are obtained by constructing the N-dimensional motion vector space. Then the optimized generalized difference extended algorithm is used to embed the secret information into the value of the spatial point. Finally, without using the location map, this method can help to embed 2N + 1 bit secret information into the motion vector N-tuple C, and can recover the carrier video with little distortion during the extracting process. The experimental results show that the false noise ratio of the video image is more than 32db after the steganography process, and the bit rate is no more than 0.77%. These characteristics mean that the implement of the method will not distort the video and has good visual invisibility. During the extracting process, the embedded secret information can be extracted accurately. What's more, the original video can be restored without distortion. Therefore, this method is very useful for realizing the secret information hidden and restoring the carrier video without distortion.
{"title":"An optimized algorithm based on generalized difference expansion method used for HEVC reversible video information hiding","authors":"Bo Peng, Jie Yang","doi":"10.1109/ICCT.2017.8359914","DOIUrl":"https://doi.org/10.1109/ICCT.2017.8359914","url":null,"abstract":"HEVC, the latest video coding standard, is jointly developed by ISO/IEC and ITU-T. Based on HEVC, an optimized generalized difference expansion method for reversible video information hiding is realized. Firstly, 2N+1 values of the spatial point are obtained by constructing the N-dimensional motion vector space. Then the optimized generalized difference extended algorithm is used to embed the secret information into the value of the spatial point. Finally, without using the location map, this method can help to embed 2N + 1 bit secret information into the motion vector N-tuple C, and can recover the carrier video with little distortion during the extracting process. The experimental results show that the false noise ratio of the video image is more than 32db after the steganography process, and the bit rate is no more than 0.77%. These characteristics mean that the implement of the method will not distort the video and has good visual invisibility. During the extracting process, the embedded secret information can be extracted accurately. What's more, the original video can be restored without distortion. Therefore, this method is very useful for realizing the secret information hidden and restoring the carrier video without distortion.","PeriodicalId":199874,"journal":{"name":"2017 IEEE 17th International Conference on Communication Technology (ICCT)","volume":"801 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133303137","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2017-10-01DOI: 10.1109/ICCT.2017.8359869
Jie Chen, Fang Ye, T. Jiang
Taking the unmanned aerial vehicle (UAV) mission planning as the research background, we adopt the ant colony optimization algorithm (ACO) to establish an effective UAV path planning scheme under obstacle-avoidance constraint in this paper. UAV path planning is the basis and premise of UAV mission execution. The essence of UAV path planning is to obtain the feasible flight path planning from the starting point to the target point according to the specific task of UAV. Simultaneously, effective UAV path planning should reach the optimal performance while meeting the demand of different constraints. ACO is a swarm intelligence algorithm that ants cooperate with pheromone. That is, ACO has great scalability and robustness, which is compatible to UAV path planning problem. In this paper, taking the obstacle-avoidance constraint into consideration, we build an effective UAV path planning strategy based on ACO to acquire the shortest UAV route. Experiments and analyses demonstrate that, when the obstacle number gradually increased from one to three, the proposed algorithm can all achieve the optimal UAV path planning. Hence, the rationality and applicability of the proposed algorithm are verified. Besides, the proposed algorithm can still realize the optimal UAV path planning when further adding the obstacle number and increasing the complexity of multiple obstacles. Thus, the effectiveness and robustness of the proposed algorithm are ulteriorly proved. Accordingly, the proposed algorithm has certain practical significance.
{"title":"Path planning under obstacle-avoidance constraints based on ant colony optimization algorithm","authors":"Jie Chen, Fang Ye, T. Jiang","doi":"10.1109/ICCT.2017.8359869","DOIUrl":"https://doi.org/10.1109/ICCT.2017.8359869","url":null,"abstract":"Taking the unmanned aerial vehicle (UAV) mission planning as the research background, we adopt the ant colony optimization algorithm (ACO) to establish an effective UAV path planning scheme under obstacle-avoidance constraint in this paper. UAV path planning is the basis and premise of UAV mission execution. The essence of UAV path planning is to obtain the feasible flight path planning from the starting point to the target point according to the specific task of UAV. Simultaneously, effective UAV path planning should reach the optimal performance while meeting the demand of different constraints. ACO is a swarm intelligence algorithm that ants cooperate with pheromone. That is, ACO has great scalability and robustness, which is compatible to UAV path planning problem. In this paper, taking the obstacle-avoidance constraint into consideration, we build an effective UAV path planning strategy based on ACO to acquire the shortest UAV route. Experiments and analyses demonstrate that, when the obstacle number gradually increased from one to three, the proposed algorithm can all achieve the optimal UAV path planning. Hence, the rationality and applicability of the proposed algorithm are verified. Besides, the proposed algorithm can still realize the optimal UAV path planning when further adding the obstacle number and increasing the complexity of multiple obstacles. Thus, the effectiveness and robustness of the proposed algorithm are ulteriorly proved. Accordingly, the proposed algorithm has certain practical significance.","PeriodicalId":199874,"journal":{"name":"2017 IEEE 17th International Conference on Communication Technology (ICCT)","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127812564","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2017-10-01DOI: 10.1109/ICCT.2017.8359787
Zheng-Zhi Tang, Xuewen Zeng, Jun Chen, Xiaozhou Ye
The secure sockets layer (SSL) protocol as a means of protecting the security of data transmission has been widely used. In this paper, to reduce the impact of poor network transmission on the overall delay of SSL transmission in an unstable network environment, a novel SSL transmission delay optimization algorithm based on network path delay prediction is introduced. We propose a locally weighted linear regression prediction algorithm based on sliding window and singular spectrum analysis to better adapt to the characteristics of network time-delay sequence. In an unstable network transmission environment, when the predicted TCP transmission delay fluctuates beyond a certain threshold, the optimization algorithm will calculate a new parallel degree of SSL data encryption and compression to make sure of an optimized overall delay of SSL transmission. But, in a stable network transmission environment, the TCP transmission delay slightly fluctuates and the parallel process takes no effect. It is significant, especially for a heavy-duty server, that it can dynamically and reasonably use the multi-core resources. The final SSL transmission experiment verifies the effectiveness of the proposed optimization algorithm.
{"title":"SSL transmission delay optimization in multi-core processor based on network path delay prediction","authors":"Zheng-Zhi Tang, Xuewen Zeng, Jun Chen, Xiaozhou Ye","doi":"10.1109/ICCT.2017.8359787","DOIUrl":"https://doi.org/10.1109/ICCT.2017.8359787","url":null,"abstract":"The secure sockets layer (SSL) protocol as a means of protecting the security of data transmission has been widely used. In this paper, to reduce the impact of poor network transmission on the overall delay of SSL transmission in an unstable network environment, a novel SSL transmission delay optimization algorithm based on network path delay prediction is introduced. We propose a locally weighted linear regression prediction algorithm based on sliding window and singular spectrum analysis to better adapt to the characteristics of network time-delay sequence. In an unstable network transmission environment, when the predicted TCP transmission delay fluctuates beyond a certain threshold, the optimization algorithm will calculate a new parallel degree of SSL data encryption and compression to make sure of an optimized overall delay of SSL transmission. But, in a stable network transmission environment, the TCP transmission delay slightly fluctuates and the parallel process takes no effect. It is significant, especially for a heavy-duty server, that it can dynamically and reasonably use the multi-core resources. The final SSL transmission experiment verifies the effectiveness of the proposed optimization algorithm.","PeriodicalId":199874,"journal":{"name":"2017 IEEE 17th International Conference on Communication Technology (ICCT)","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124268725","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2017-10-01DOI: 10.1109/icct.2017.8359841
Shan Cui, Sheng Li, Hua Yan
Electromagnetic signal of target are formed from typical geometric shapes, these typical reflectors can be described as parametric scattering model. The signatures reconstruction method transforms the electromagnetic scattering field of each typical reflector in local coordinate system to the target coordinate system, considering distance difference and occlusion issue, calculates the total electromagnetic scattering field, the root-mean-square error, energy ratio and similarity between theory simulation data and synthesis scattering data fit well. The transmitting procedure only needs the parameters of these typical reflectors, the receiving terminal regenerates the original signal of all the viewing angles and all the frequency. So this signal processing method can be used for communication to improve information compression efficiency.
{"title":"Signatures reconstruction based on parametric scattering model and the application in communication","authors":"Shan Cui, Sheng Li, Hua Yan","doi":"10.1109/icct.2017.8359841","DOIUrl":"https://doi.org/10.1109/icct.2017.8359841","url":null,"abstract":"Electromagnetic signal of target are formed from typical geometric shapes, these typical reflectors can be described as parametric scattering model. The signatures reconstruction method transforms the electromagnetic scattering field of each typical reflector in local coordinate system to the target coordinate system, considering distance difference and occlusion issue, calculates the total electromagnetic scattering field, the root-mean-square error, energy ratio and similarity between theory simulation data and synthesis scattering data fit well. The transmitting procedure only needs the parameters of these typical reflectors, the receiving terminal regenerates the original signal of all the viewing angles and all the frequency. So this signal processing method can be used for communication to improve information compression efficiency.","PeriodicalId":199874,"journal":{"name":"2017 IEEE 17th International Conference on Communication Technology (ICCT)","volume":"114 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124388989","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2017-10-01DOI: 10.1109/ICCT.2017.8359974
R. Ando, Yuuki Takano, Shinsuke Miwa
With the rapid advance of network virtualization technology which realizes SDN (Software Defined Network) and Cloud computing, current networking environment has become more flexible, diversified and complex. At the same time, complex networking environment sometimes imposes a great burden on network administrators for coping with complicated filtering rules. In this paper we present a user mode support for centralized filtering rule management base. Proposed system enables us to handle fine grained traffic engineering functionality for diversified environment of Cloud and SDN. Our architecture adopts KV (Key-Value) based Datastore for handling a large scale of filtering rules. By leveraging Datastore for centralized access control of instances on virtualized environment, we can provide alternative access control framework for reducing the burden of managing complicated and dynamic filtering policy on instances (virtual machine) on virtualized networking environment. Besides, KV representation can simplify the filtering rule set and provide generic interfaces for querying. In experiment, we have prototyped a lightweight management plane for IP filtering. Access filtering rules including target IP address, prefix and gateway is represented as radix tree. It is shown that proposed method can achieve reasonable utilization in filtering IP packets.
{"title":"A user mode implementation of filtering rule management plane using key-value store","authors":"R. Ando, Yuuki Takano, Shinsuke Miwa","doi":"10.1109/ICCT.2017.8359974","DOIUrl":"https://doi.org/10.1109/ICCT.2017.8359974","url":null,"abstract":"With the rapid advance of network virtualization technology which realizes SDN (Software Defined Network) and Cloud computing, current networking environment has become more flexible, diversified and complex. At the same time, complex networking environment sometimes imposes a great burden on network administrators for coping with complicated filtering rules. In this paper we present a user mode support for centralized filtering rule management base. Proposed system enables us to handle fine grained traffic engineering functionality for diversified environment of Cloud and SDN. Our architecture adopts KV (Key-Value) based Datastore for handling a large scale of filtering rules. By leveraging Datastore for centralized access control of instances on virtualized environment, we can provide alternative access control framework for reducing the burden of managing complicated and dynamic filtering policy on instances (virtual machine) on virtualized networking environment. Besides, KV representation can simplify the filtering rule set and provide generic interfaces for querying. In experiment, we have prototyped a lightweight management plane for IP filtering. Access filtering rules including target IP address, prefix and gateway is represented as radix tree. It is shown that proposed method can achieve reasonable utilization in filtering IP packets.","PeriodicalId":199874,"journal":{"name":"2017 IEEE 17th International Conference on Communication Technology (ICCT)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114423844","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2017-10-01DOI: 10.1109/ICCT.2017.8359629
Linning Peng, Guyue Li, A. Hu
Secret key generation from wireless channel is an emerging technique to provide secure keys for message encryption. However, the measured channel state information (CSI) requires high reciprocity in order to obtain symmetric keys. In this paper, we propose a novel loop-back transmission scheme for time division duplex (TDD) systems, which is named as LB-TDD. The proposed LB-TDD scheme can effectively reduce the CSI non-reciprocity due to the hardware fingerprint interference and system synchronization offset. We initially discuss the benefits and optimizations of using LB-TDD for CSI reciprocity enhancement. After that, a secret key generation method based on orthogonal frequency division multiplexing (OFDM) probing signals is introduced. Finally, a channel model and a practical universal software radio peripheral (USRP) system is setup for both simulation and experimental verification. Evaluation results show that our proposed LB-TDD scheme can effectively eliminate CSI non-reciprocity for secret key generation.
{"title":"Channel reciprocity improvement of secret key generation with loop-back transmissions","authors":"Linning Peng, Guyue Li, A. Hu","doi":"10.1109/ICCT.2017.8359629","DOIUrl":"https://doi.org/10.1109/ICCT.2017.8359629","url":null,"abstract":"Secret key generation from wireless channel is an emerging technique to provide secure keys for message encryption. However, the measured channel state information (CSI) requires high reciprocity in order to obtain symmetric keys. In this paper, we propose a novel loop-back transmission scheme for time division duplex (TDD) systems, which is named as LB-TDD. The proposed LB-TDD scheme can effectively reduce the CSI non-reciprocity due to the hardware fingerprint interference and system synchronization offset. We initially discuss the benefits and optimizations of using LB-TDD for CSI reciprocity enhancement. After that, a secret key generation method based on orthogonal frequency division multiplexing (OFDM) probing signals is introduced. Finally, a channel model and a practical universal software radio peripheral (USRP) system is setup for both simulation and experimental verification. Evaluation results show that our proposed LB-TDD scheme can effectively eliminate CSI non-reciprocity for secret key generation.","PeriodicalId":199874,"journal":{"name":"2017 IEEE 17th International Conference on Communication Technology (ICCT)","volume":"51 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117020396","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2017-10-01DOI: 10.1109/ICCT.2017.8359944
Hongxia Miao, Rui Ni, Kangkang Liu, Long He
As one of the AC and DC switching devices in power system, high voltage switchgear is mainly used for the control and protection of power systems. In order to meet the demand of large amount of data, many types, fast processing speed and high quality of fault diagnosis in large data environment, a parallel processing framework based on a data fusion fault diagnosis algorithm designed by D-S Evidence Theory is introduced, taking SF6 high voltage circuit breaker as an example in this paper. SF6 high voltage circuit breaker trip(closing) coil current, voltage and current time are selected as input of the diagnosis system, and six main fault types are selected as output of the diagnosis system in this paper. Considering the multi-level, multi-layer and multi-faceted advantages of multi-sensor data fusion, D-S evidence theory based on MapReduce framework is designed. The simulation shows that the requirements of mass rapid diagnosis of high voltage switch equipment can be satisfied. Compared with the traditional serial processing method, processing time can be reduced by 95 percent under situation of hundreds of megabytes data.
{"title":"A D-S evidence theory fault diagnosis method based on MapReduce for SF6 high voltage switchgear","authors":"Hongxia Miao, Rui Ni, Kangkang Liu, Long He","doi":"10.1109/ICCT.2017.8359944","DOIUrl":"https://doi.org/10.1109/ICCT.2017.8359944","url":null,"abstract":"As one of the AC and DC switching devices in power system, high voltage switchgear is mainly used for the control and protection of power systems. In order to meet the demand of large amount of data, many types, fast processing speed and high quality of fault diagnosis in large data environment, a parallel processing framework based on a data fusion fault diagnosis algorithm designed by D-S Evidence Theory is introduced, taking SF6 high voltage circuit breaker as an example in this paper. SF6 high voltage circuit breaker trip(closing) coil current, voltage and current time are selected as input of the diagnosis system, and six main fault types are selected as output of the diagnosis system in this paper. Considering the multi-level, multi-layer and multi-faceted advantages of multi-sensor data fusion, D-S evidence theory based on MapReduce framework is designed. The simulation shows that the requirements of mass rapid diagnosis of high voltage switch equipment can be satisfied. Compared with the traditional serial processing method, processing time can be reduced by 95 percent under situation of hundreds of megabytes data.","PeriodicalId":199874,"journal":{"name":"2017 IEEE 17th International Conference on Communication Technology (ICCT)","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117264893","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
扫码关注我们
求助内容：
应助结果提醒方式：