This paper attempts to identify the reliability of detection of licensed primary transmission based on cooperative sensing in cognitive radio networks. With a parallel fusion network model, the correlation issue of the received signals between the nodes in the worst case is derived. Leveraging the property of false sensing data due to malfunctioning or malicious software, the optimizing strategy, namely Fault-Tolerant algorithm for Distributed Detection (FTDD) is proposed, and quantitative analysis of false alarm reliability and detection probability under the scheme is presented. In particular, the tradeoff between licensed transmissions and user cooperation among nodes is discussed. Simulation experiments are also used to evaluate the fusion performance under practical settings. The model and analytic results provide useful tools for reliability analysis for other wireless decentralization-based applications (e.g., those involving robust spectrum sensing).
{"title":"Fault-Tolerant Algorithm for Distributed Primary Detection in Cognitive Radio Networks","authors":"H. Qin, Youfu Du, Jun Su","doi":"10.1109/NSWCTC.2009.149","DOIUrl":"https://doi.org/10.1109/NSWCTC.2009.149","url":null,"abstract":"This paper attempts to identify the reliability of detection of licensed primary transmission based on cooperative sensing in cognitive radio networks. With a parallel fusion network model, the correlation issue of the received signals between the nodes in the worst case is derived. Leveraging the property of false sensing data due to malfunctioning or malicious software, the optimizing strategy, namely Fault-Tolerant algorithm for Distributed Detection (FTDD) is proposed, and quantitative analysis of false alarm reliability and detection probability under the scheme is presented. In particular, the tradeoff between licensed transmissions and user cooperation among nodes is discussed. Simulation experiments are also used to evaluate the fusion performance under practical settings. The model and analytic results provide useful tools for reliability analysis for other wireless decentralization-based applications (e.g., those involving robust spectrum sensing).","PeriodicalId":433291,"journal":{"name":"2009 International Conference on Networks Security, Wireless Communications and Trusted Computing","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-04-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115336873","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}
This thesis discusses a methodology involving the merging of a reliability assessment model based on genetic algorithms with simulation. The purpose of the simulation study in this thesis is to assess the impact of equipment failures to mine'production throughput. Two simulation models are developed using different simulation tools. The end results demonstrate a successful application of the methodology to study the impact of equipment failure on a mine’pruduction. There is potential for future research involving methodology developed in this thesis. Logically,the next undertaking would be to incorporate failure patterns for all equipment. A second future direction is to incorporate other predictive models into the methodology and study and compare the results with the genetic algorithm model presented in this thesis
{"title":"Study on Mine Equipment Systems Combined with a Reliability Assessment Model","authors":"Dai Jingxia","doi":"10.1109/NSWCTC.2009.68","DOIUrl":"https://doi.org/10.1109/NSWCTC.2009.68","url":null,"abstract":"This thesis discusses a methodology involving the merging of a reliability assessment model based on genetic algorithms with simulation. The purpose of the simulation study in this thesis is to assess the impact of equipment failures to mine'production throughput. Two simulation models are developed using different simulation tools. The end results demonstrate a successful application of the methodology to study the impact of equipment failure on a mine’pruduction. There is potential for future research involving methodology developed in this thesis. Logically,the next undertaking would be to incorporate failure patterns for all equipment. A second future direction is to incorporate other predictive models into the methodology and study and compare the results with the genetic algorithm model presented in this thesis","PeriodicalId":433291,"journal":{"name":"2009 International Conference on Networks Security, Wireless Communications and Trusted Computing","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-04-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116786693","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}
Qiaolin Hu, Qingyuan Huang, Biao Han, Bao-kang Zhao, Jinshu Su
Protecting sensitive routing information is very fundamental and critical in mobile ad hoc networks (MANETs)that operates in hostile environments, which also bring great challenges. Recent research have been focus on secure routing, however, most of them relies on cryptographic infrastructure, and which greatly limits their usage. To overcome these drawbacks, we propose MSR, a novel MPLS-like Secure Routing protocol for MANETs, Motivated by the MPLS techniques, MSR integrates the key agreement that doesn’t need the support of online trusted third party and label switching techniques into the secure routing and forwarding process. By establishing multiple label switching paths within the key agreement process, MSR is resistant to traf¿c analysis attack, and provides the desirable identity and relationship anonymity through multiple pseudonyms and local label negotiation. We then implement MSR in Glomosim and conduct extensive experiments. The detailed analysis and simulation results show that MSR protocol is very efficient and brings low overhead to the network.
{"title":"MSR: A Novel MPLS-Like Secure Routing Protocol for Mobile Ad Hoc Networks","authors":"Qiaolin Hu, Qingyuan Huang, Biao Han, Bao-kang Zhao, Jinshu Su","doi":"10.1109/NSWCTC.2009.369","DOIUrl":"https://doi.org/10.1109/NSWCTC.2009.369","url":null,"abstract":"Protecting sensitive routing information is very fundamental and critical in mobile ad hoc networks (MANETs)that operates in hostile environments, which also bring great challenges. Recent research have been focus on secure routing, however, most of them relies on cryptographic infrastructure, and which greatly limits their usage. To overcome these drawbacks, we propose MSR, a novel MPLS-like Secure Routing protocol for MANETs, Motivated by the MPLS techniques, MSR integrates the key agreement that doesn’t need the support of online trusted third party and label switching techniques into the secure routing and forwarding process. By establishing multiple label switching paths within the key agreement process, MSR is resistant to traf¿c analysis attack, and provides the desirable identity and relationship anonymity through multiple pseudonyms and local label negotiation. We then implement MSR in Glomosim and conduct extensive experiments. The detailed analysis and simulation results show that MSR protocol is very efficient and brings low overhead to the network.","PeriodicalId":433291,"journal":{"name":"2009 International Conference on Networks Security, Wireless Communications and Trusted Computing","volume":"78 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-04-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121053705","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}
Packet classification, which classifies the incoming packets according to their head information, is an important technique for the next-generation routers, firewalls and so on. Recursive flow classification algorithm is one of the fastest software packet classification algorithms, but its initialization time is too long, so a timesaving recursive flow classification algorithm is proposed. In phase 0, equivalence classes are defined by the set of filters matched in processing the packet. A more effective method for finding every entry’s equivalence class is given. In phase 1, in order to combine the results for different chunks together, cross-producting tables are used to store precomputed results and a faster method of merging two chunks is given. Its initialization time is greatly reduced because of heuristic learning while its classification phase retaining the same time complexity with RFC. The experimental results show that the total time has an average decrease of 40%.
{"title":"A Timesaving Recursive Flow Packet Classification Algorithm","authors":"Yuke Pan, Bing Chen, Tao Xu","doi":"10.1109/NSWCTC.2009.245","DOIUrl":"https://doi.org/10.1109/NSWCTC.2009.245","url":null,"abstract":"Packet classification, which classifies the incoming packets according to their head information, is an important technique for the next-generation routers, firewalls and so on. Recursive flow classification algorithm is one of the fastest software packet classification algorithms, but its initialization time is too long, so a timesaving recursive flow classification algorithm is proposed. In phase 0, equivalence classes are defined by the set of filters matched in processing the packet. A more effective method for finding every entry’s equivalence class is given. In phase 1, in order to combine the results for different chunks together, cross-producting tables are used to store precomputed results and a faster method of merging two chunks is given. Its initialization time is greatly reduced because of heuristic learning while its classification phase retaining the same time complexity with RFC. The experimental results show that the total time has an average decrease of 40%.","PeriodicalId":433291,"journal":{"name":"2009 International Conference on Networks Security, Wireless Communications and Trusted Computing","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-04-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124854789","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}
Distributed wireless communication system has been considered as a promising architecture for future wireless communication networks. This paper aims to characterize the power allocation scheme for orthogonal space time block coding in DWCS. Firstly, an optimal method is investigated, which minimizes the upper bound of the ergodic pair-wise symbol error rate, and it is proved to be equivalent to water¿lling based on the knowledge of large-scale fading. In order to reduce the complexity, a low-complexity power allocation method is proposed through approximating the optimization problem. This method assigns a power allocation weight to each distributed base station, and then allocates the power to base stations proportional to these weights. Numerical results show that the performance of this low-complexity algorithm holds close performance with the water¿lling method in most situations.
{"title":"A Novel Low-Complexity Weight Based Power Allocation Scheme for Distributed OSTBC System","authors":"Xingzai Lv, Jinkang Zhu","doi":"10.1109/NSWCTC.2009.83","DOIUrl":"https://doi.org/10.1109/NSWCTC.2009.83","url":null,"abstract":"Distributed wireless communication system has been considered as a promising architecture for future wireless communication networks. This paper aims to characterize the power allocation scheme for orthogonal space time block coding in DWCS. Firstly, an optimal method is investigated, which minimizes the upper bound of the ergodic pair-wise symbol error rate, and it is proved to be equivalent to water¿lling based on the knowledge of large-scale fading. In order to reduce the complexity, a low-complexity power allocation method is proposed through approximating the optimization problem. This method assigns a power allocation weight to each distributed base station, and then allocates the power to base stations proportional to these weights. Numerical results show that the performance of this low-complexity algorithm holds close performance with the water¿lling method in most situations.","PeriodicalId":433291,"journal":{"name":"2009 International Conference on Networks Security, Wireless Communications and Trusted Computing","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-04-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123423554","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}
In this paper we propose a notion, the (t, n)-threshold agreement certificate. The (t, n)-threshold agreement certificates of a secret are also shadows derived from the original secret using a different access structure. Based on these certificates, we present a (t, n)-threshold secret sharing scheme which can resist participants’ cheating. That is, any participant’s cheating would not work in the proposed scheme provided that the assumptions in the paper are true. This electronic document is a “live” template. The various components of your paper [title, text, heads, etc.] are already defined on the style sheet, as illustrated by the portions given in this document.
{"title":"Cheating Resistance for Secret Sharing","authors":"Chao-Wen Chan, Chinchen Chang, Zhi-Hui Wang","doi":"10.1109/NSWCTC.2009.390","DOIUrl":"https://doi.org/10.1109/NSWCTC.2009.390","url":null,"abstract":"In this paper we propose a notion, the (t, n)-threshold agreement certificate. The (t, n)-threshold agreement certificates of a secret are also shadows derived from the original secret using a different access structure. Based on these certificates, we present a (t, n)-threshold secret sharing scheme which can resist participants’ cheating. That is, any participant’s cheating would not work in the proposed scheme provided that the assumptions in the paper are true. This electronic document is a “live” template. The various components of your paper [title, text, heads, etc.] are already defined on the style sheet, as illustrated by the portions given in this document.","PeriodicalId":433291,"journal":{"name":"2009 International Conference on Networks Security, Wireless Communications and Trusted Computing","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-04-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123555367","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}
A CMOS variable gain amplifier (VGA) is designed, which is suitable for the turner of digital video broadcasting-cable(DVB-C). The amplifier is consists of exponential control circuit, amplifier circuit and common mode feedback circuit. The exponential circuit is presented by an approximate exponential function. The VGA is fabricated in 0.35um CMOS technology, and is simulated by Mentor’s circuit simulation tool Eldo. Simulation results show that the VGA core consumes 4.63mW at 3.3V supply voltage and has a gain range from 0 to 32dB. The frequency range is 46MHz~267MHz and noise figure is less than 10dB.
{"title":"Design of CMOS Variable Gain Amplifier for DTV Tuners","authors":"Shu‐Jenn Yu, Yunfei Ye","doi":"10.1109/NSWCTC.2009.234","DOIUrl":"https://doi.org/10.1109/NSWCTC.2009.234","url":null,"abstract":"A CMOS variable gain amplifier (VGA) is designed, which is suitable for the turner of digital video broadcasting-cable(DVB-C). The amplifier is consists of exponential control circuit, amplifier circuit and common mode feedback circuit. The exponential circuit is presented by an approximate exponential function. The VGA is fabricated in 0.35um CMOS technology, and is simulated by Mentor’s circuit simulation tool Eldo. Simulation results show that the VGA core consumes 4.63mW at 3.3V supply voltage and has a gain range from 0 to 32dB. The frequency range is 46MHz~267MHz and noise figure is less than 10dB.","PeriodicalId":433291,"journal":{"name":"2009 International Conference on Networks Security, Wireless Communications and Trusted Computing","volume":"66 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-04-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125681749","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}
Real-time position localization of moving objects in an indoor environment is an encouraging technology for realizing the vision of creating numerous novel location-aware services and applications in various market segments. An off the shelf development platform that uses Radio Signal Strength Indication (RSSI) based location tracking technique is studied. In this paper we investigate the affects of polarization on the accuracy of an indoor location tracking system. We present an approach to increase system accuracy based on this investigation. We established a model for determining range from RSSI and showed that the model fits our own experimental data. The model includes parameters used to account of environmental effects and we use the least squares method of determining the parameter values. Antenna polarization angle will affect RSSI and thus range accuracy. We empirically show that the model is still valid for polarization mismatch but with different environmental parameter values. A method based on semi-automated trail and error is proposed as a better method for selecting the environmental parameters. Using experimental data we show that if we adjust the model parameters to account for polarization angle then we can increase location accuracy. A practical solution for determining the polarization angle is with an accelerometer. The addition of an accelerometer could also be used to increase the battery life of the node.
{"title":"Behaviors of Antenna Polarization for RSSI Location Identification","authors":"Xu Huang, Mark Barralet, D. Sharma","doi":"10.1109/NSWCTC.2009.49","DOIUrl":"https://doi.org/10.1109/NSWCTC.2009.49","url":null,"abstract":"Real-time position localization of moving objects in an indoor environment is an encouraging technology for realizing the vision of creating numerous novel location-aware services and applications in various market segments. An off the shelf development platform that uses Radio Signal Strength Indication (RSSI) based location tracking technique is studied. In this paper we investigate the affects of polarization on the accuracy of an indoor location tracking system. We present an approach to increase system accuracy based on this investigation. We established a model for determining range from RSSI and showed that the model fits our own experimental data. The model includes parameters used to account of environmental effects and we use the least squares method of determining the parameter values. Antenna polarization angle will affect RSSI and thus range accuracy. We empirically show that the model is still valid for polarization mismatch but with different environmental parameter values. A method based on semi-automated trail and error is proposed as a better method for selecting the environmental parameters. Using experimental data we show that if we adjust the model parameters to account for polarization angle then we can increase location accuracy. A practical solution for determining the polarization angle is with an accelerometer. The addition of an accelerometer could also be used to increase the battery life of the node.","PeriodicalId":433291,"journal":{"name":"2009 International Conference on Networks Security, Wireless Communications and Trusted Computing","volume":"186 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-04-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116186641","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}
This paper provides a new kind of passive beamformer which uses bridge function sequences as spreading sequence weights. The passive beamformer uses pseudorandom spreading sequence as weight of signal from each antenna element. Then it forms spatial radiation pattern by combining these signals. It can track and locate multiple objects’ positions simultaneously without the need of phase shifters and attenuators and any adaptive electronic beamsteering. And its antenna array can be any arbitrary geometry displacement. It can discriminate directions of arrival with as high angle resolution as 1.40 when there are 2000 elements in the antenna array. We use bridge function sequences as its pseudorandom spreading sequence weights. Owing to Bridge function sequences with better cross correlation characteristics, the passive beamformer gets better performance promotion than ones with Walsh function sequences as spreading sequences.
{"title":"Application of Bridge Function Sequences in Passive Beamformer","authors":"Sheng Hong, Huagang Xiong, Kefei Liu, Qing Chang, Qishan Zhang, Yongqiang Liu, Xiaoxiang He, M. Tentzeris","doi":"10.1109/NSWCTC.2009.24","DOIUrl":"https://doi.org/10.1109/NSWCTC.2009.24","url":null,"abstract":"This paper provides a new kind of passive beamformer which uses bridge function sequences as spreading sequence weights. The passive beamformer uses pseudorandom spreading sequence as weight of signal from each antenna element. Then it forms spatial radiation pattern by combining these signals. It can track and locate multiple objects’ positions simultaneously without the need of phase shifters and attenuators and any adaptive electronic beamsteering. And its antenna array can be any arbitrary geometry displacement. It can discriminate directions of arrival with as high angle resolution as 1.40 when there are 2000 elements in the antenna array. We use bridge function sequences as its pseudorandom spreading sequence weights. Owing to Bridge function sequences with better cross correlation characteristics, the passive beamformer gets better performance promotion than ones with Walsh function sequences as spreading sequences.","PeriodicalId":433291,"journal":{"name":"2009 International Conference on Networks Security, Wireless Communications and Trusted Computing","volume":"123 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-04-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116487380","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}
Aimed at the network intrusion behaviors are characterized with uncertainty, complexity, diversity and dynamic tendency and the advantages of neural network, an intrusion detection method based on high speed and precise genetic algorithm neural network is presented in this paper. The high speed and precise genetic algorithm neural network is combined the adaptive and floating-point code genetic algorithm with BP network which has higher accuracy and faster convergence speed. We construct the network structure, and give the algorithm flow. We discussed and analyzed the impact factor of intrusion behaviors. With the ability of strong self-learning and faster convergence of high speed and precise genetic algorithm neural network, the network intrusion detection method can detect various intrusion behaviors rapidly and effectively by learning the typical intrusion characteristic information. The experimental result shows that this intrusion detection method is feasible and effective.
{"title":"Network Intrusion Detection Method Based on High Speed and Precise Genetic Algorithm Neural Network","authors":"Jingwen Tian, Meijuan Gao","doi":"10.1109/NSWCTC.2009.228","DOIUrl":"https://doi.org/10.1109/NSWCTC.2009.228","url":null,"abstract":"Aimed at the network intrusion behaviors are characterized with uncertainty, complexity, diversity and dynamic tendency and the advantages of neural network, an intrusion detection method based on high speed and precise genetic algorithm neural network is presented in this paper. The high speed and precise genetic algorithm neural network is combined the adaptive and floating-point code genetic algorithm with BP network which has higher accuracy and faster convergence speed. We construct the network structure, and give the algorithm flow. We discussed and analyzed the impact factor of intrusion behaviors. With the ability of strong self-learning and faster convergence of high speed and precise genetic algorithm neural network, the network intrusion detection method can detect various intrusion behaviors rapidly and effectively by learning the typical intrusion characteristic information. The experimental result shows that this intrusion detection method is feasible and effective.","PeriodicalId":433291,"journal":{"name":"2009 International Conference on Networks Security, Wireless Communications and Trusted Computing","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-04-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122410977","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
扫码关注我们
求助内容：
应助结果提醒方式：