Pub Date : 2012-03-15DOI: 10.1109/WCINS.2010.5541903
Zhong-xun Wang, Xingcheng Wang, Xinqiao Yu, D. Guo
We researched BP decoding algorithm based on variable-to-check information residual for LDPC code (VC-RBP) in this paper. It is a dynamic scheduling belief propagation using residuals, and has some advantages, such as fast decoding, good performance, and low complexity. It is similar to residual belief propagation (RBP),but has some difference in computing the residual message. Simulation shows that it outperforms with only a maximum of ten iterations by about 0.28 dB compared with RBP at an BER of 10-4.
{"title":"A BP decoding algorithm based on nodes residual for LDPC codes","authors":"Zhong-xun Wang, Xingcheng Wang, Xinqiao Yu, D. Guo","doi":"10.1109/WCINS.2010.5541903","DOIUrl":"https://doi.org/10.1109/WCINS.2010.5541903","url":null,"abstract":"We researched BP decoding algorithm based on variable-to-check information residual for LDPC code (VC-RBP) in this paper. It is a dynamic scheduling belief propagation using residuals, and has some advantages, such as fast decoding, good performance, and low complexity. It is similar to residual belief propagation (RBP),but has some difference in computing the residual message. Simulation shows that it outperforms with only a maximum of ten iterations by about 0.28 dB compared with RBP at an BER of 10-4.","PeriodicalId":272940,"journal":{"name":"IEEE International Conference on Wireless Communications, Networking and Information Security","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-03-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123475462","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 : 2010-06-01DOI: 10.1109/WCINS.2010.5541842
Bo Wang, Chuanhe Huang, Wenzhong Yang, Tong Wang
The opportunistic routing paradigm is a new avenue for designing routing protocols in multi-hop wireless networks. Unlike traditional wireless routing protocols which use a single predetermining path, opportunistic routing explicitly takes advantage of the broadcast nature of wireless communications by using a set of relay nodes to opportunistically perform packet forwarding. Network security is also a hot research topic on routing. However, combining above two ideas to devise an effective routing is none. This paper aims at giving a new solution to solve it by defining a new metric called E2TX(trustworthiness and ETX). Using this metric, we also consider the two key issues for a new routing protocol called TOR: candidate selection and prioritization of relays in classical opportunistic routing. Through extensive simulations by NS2, we demonstrate that TOR outperforms class routing: ExOR, in terms of packet delivery ratio, delay and routing overhead.
机会路由范式是设计多跳无线网络路由协议的新途径。与使用单一预定路径的传统无线路由协议不同，机会路由通过使用一组中继节点来机会地执行数据包转发，明确地利用了无线通信的广播性质。网络安全也是路由研究的一个热点。然而，结合以上两个想法来设计一个有效的路由是不可能的。本文旨在通过定义一个名为E2TX(trustworthiness and ETX)的新度量来给出一种新的解决方案。使用此度量，我们还考虑了称为TOR的新路由协议的两个关键问题:经典机会路由中的候选选择和中继的优先级。通过NS2的大量模拟，我们证明了TOR在分组传送率、延迟和路由开销方面优于类路由:ExOR。
{"title":"Trust opportunistic routing protocol in multi-hop wireless networks","authors":"Bo Wang, Chuanhe Huang, Wenzhong Yang, Tong Wang","doi":"10.1109/WCINS.2010.5541842","DOIUrl":"https://doi.org/10.1109/WCINS.2010.5541842","url":null,"abstract":"The opportunistic routing paradigm is a new avenue for designing routing protocols in multi-hop wireless networks. Unlike traditional wireless routing protocols which use a single predetermining path, opportunistic routing explicitly takes advantage of the broadcast nature of wireless communications by using a set of relay nodes to opportunistically perform packet forwarding. Network security is also a hot research topic on routing. However, combining above two ideas to devise an effective routing is none. This paper aims at giving a new solution to solve it by defining a new metric called E2TX(trustworthiness and ETX). Using this metric, we also consider the two key issues for a new routing protocol called TOR: candidate selection and prioritization of relays in classical opportunistic routing. Through extensive simulations by NS2, we demonstrate that TOR outperforms class routing: ExOR, in terms of packet delivery ratio, delay and routing overhead.","PeriodicalId":272940,"journal":{"name":"IEEE International Conference on Wireless Communications, Networking and Information Security","volume":"216 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134345118","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 : 1900-01-01DOI: 10.1109/WCINS.2010.5541904
W. Leng, Anguo Wang
The spatial correlation between two circular polarized antennas installed in a small mobile terminal influences directly on channel capacity. From the perspective of theory, this paper studies the relation between spatial correlation and antenna parameters (such as polarization axial ratio) & environment parameters (including channel cross polarization discrimination and arrival angle). According to the relationship between spatial correlation and channel capacity, the further research is done about how to adaptively increase channel capacity by adjusting the axial ratio of polarized antenna in varying environment.
{"title":"Increase channel capacity in MIMO system by adjusting the axial ratio of circular polarized antenna","authors":"W. Leng, Anguo Wang","doi":"10.1109/WCINS.2010.5541904","DOIUrl":"https://doi.org/10.1109/WCINS.2010.5541904","url":null,"abstract":"The spatial correlation between two circular polarized antennas installed in a small mobile terminal influences directly on channel capacity. From the perspective of theory, this paper studies the relation between spatial correlation and antenna parameters (such as polarization axial ratio) & environment parameters (including channel cross polarization discrimination and arrival angle). According to the relationship between spatial correlation and channel capacity, the further research is done about how to adaptively increase channel capacity by adjusting the axial ratio of polarized antenna in varying environment.","PeriodicalId":272940,"journal":{"name":"IEEE International Conference on Wireless Communications, Networking and Information Security","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132305566","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 : 1900-01-01DOI: 10.1109/WCINS.2010.5541790
Zhicai Shi, Yongxiang Xia
It is difficult to detect complicate network attacks effectively nowadays. To detect these attacks the inherent characteristics of complicate network attacks are analyzed in detail. A novel hidden Markov model is proposed. The model is composed of several different monitors. In order to simplify the training procedure of the model and to improve its response performance warning events are classified into different types at first. Then the sequences of warning event types from different network monitors are correlated and their inherent relationship is mined so as to detect the type of complicate network attacks and to forecast their threat degree to the system. The experimental results show that the proposed model could recognize complicate network attacks effectively.
{"title":"A novel hidden Markov model for detecting complicate network attacks","authors":"Zhicai Shi, Yongxiang Xia","doi":"10.1109/WCINS.2010.5541790","DOIUrl":"https://doi.org/10.1109/WCINS.2010.5541790","url":null,"abstract":"It is difficult to detect complicate network attacks effectively nowadays. To detect these attacks the inherent characteristics of complicate network attacks are analyzed in detail. A novel hidden Markov model is proposed. The model is composed of several different monitors. In order to simplify the training procedure of the model and to improve its response performance warning events are classified into different types at first. Then the sequences of warning event types from different network monitors are correlated and their inherent relationship is mined so as to detect the type of complicate network attacks and to forecast their threat degree to the system. The experimental results show that the proposed model could recognize complicate network attacks effectively.","PeriodicalId":272940,"journal":{"name":"IEEE International Conference on Wireless Communications, Networking and Information Security","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115252688","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 : 1900-01-01DOI: 10.1109/WCINS.2010.5541911
Qunchao Feng, Yuanzhi Chen, Weitao Du
A feedback canceller model was built to cancel the feedback interference which caused by the coupling paths between the antennas of the transmitter and receiver in on-channel repeater. The normalized delay least square mean algorithm was presented to improve the capability of feedback canceller. The improved method could not only cancel echo signal in a low processing delay when relaying, but also get a fast convergence rate and better maladjustment performance. With this algorithm, on-channel repeater may be applied in many wireless broadcasting systems with different guard intervals. Simulation results show that, when the antenna isolation is lower than the gain of repeater, the improved feedback canceller could eliminate the multi-path echo signal to an allowable level, and it could increase the antenna isolation above 20dB.
{"title":"An improved feedback cancelling method for on-channel repeater","authors":"Qunchao Feng, Yuanzhi Chen, Weitao Du","doi":"10.1109/WCINS.2010.5541911","DOIUrl":"https://doi.org/10.1109/WCINS.2010.5541911","url":null,"abstract":"A feedback canceller model was built to cancel the feedback interference which caused by the coupling paths between the antennas of the transmitter and receiver in on-channel repeater. The normalized delay least square mean algorithm was presented to improve the capability of feedback canceller. The improved method could not only cancel echo signal in a low processing delay when relaying, but also get a fast convergence rate and better maladjustment performance. With this algorithm, on-channel repeater may be applied in many wireless broadcasting systems with different guard intervals. Simulation results show that, when the antenna isolation is lower than the gain of repeater, the improved feedback canceller could eliminate the multi-path echo signal to an allowable level, and it could increase the antenna isolation above 20dB.","PeriodicalId":272940,"journal":{"name":"IEEE International Conference on Wireless Communications, Networking and Information Security","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121795023","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 : 1900-01-01DOI: 10.1109/WCINS.2010.5543729
Zhe Ding, Yubin Xu
Based on the research of spatial traffic distribution model in urban areas, this paper presents a novel urban spatial Dynamic Spectrum Allocation (DSA) according to the characteristics of spatial spectrum demand distribution in urban areas. A dynamic DSA area division method is investigated, which sets up a new neighboring relationship among the DSA areas. So part of the available spectrum is released from the heterogeneous interference limit, and the spatial DSA is conducted in a more flexible way with better performance. Simulative comparison demonstrates that the proposed urban spatial DSA in this paper outperforms the conventional spatial DSA in terms of spectrum satisfaction.
{"title":"A novel spatial Dynamic Spectrum Allocation in the urban heterogeneous scenario","authors":"Zhe Ding, Yubin Xu","doi":"10.1109/WCINS.2010.5543729","DOIUrl":"https://doi.org/10.1109/WCINS.2010.5543729","url":null,"abstract":"Based on the research of spatial traffic distribution model in urban areas, this paper presents a novel urban spatial Dynamic Spectrum Allocation (DSA) according to the characteristics of spatial spectrum demand distribution in urban areas. A dynamic DSA area division method is investigated, which sets up a new neighboring relationship among the DSA areas. So part of the available spectrum is released from the heterogeneous interference limit, and the spatial DSA is conducted in a more flexible way with better performance. Simulative comparison demonstrates that the proposed urban spatial DSA in this paper outperforms the conventional spatial DSA in terms of spectrum satisfaction.","PeriodicalId":272940,"journal":{"name":"IEEE International Conference on Wireless Communications, Networking and Information Security","volume":"182 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124577539","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 : 1900-01-01DOI: 10.1109/WCINS.2010.5541847
Z. Dai, Lu Guo
The information revolution and network applications bring new business opportunities to enterprises, financial sector industry characteristics determine its On-line business have much interests. The reality is that the financial sector high cost of On-line finance, the cost of settling large number invalid customer information. Growing customer should be the focus of attention by On-line finance, the application of information technology, to solve efficiencies in cost accounting effectively and identify activity for customer growth characteristics and behavior patterns by mining association rules does great help for the right On-line financial firms, while growing customer can get personalized service and monitoring. This long-term development of financial enterprises is an important protection of their interests.
{"title":"Growth customer information mining analysis with association rules in On-line financial Web site","authors":"Z. Dai, Lu Guo","doi":"10.1109/WCINS.2010.5541847","DOIUrl":"https://doi.org/10.1109/WCINS.2010.5541847","url":null,"abstract":"The information revolution and network applications bring new business opportunities to enterprises, financial sector industry characteristics determine its On-line business have much interests. The reality is that the financial sector high cost of On-line finance, the cost of settling large number invalid customer information. Growing customer should be the focus of attention by On-line finance, the application of information technology, to solve efficiencies in cost accounting effectively and identify activity for customer growth characteristics and behavior patterns by mining association rules does great help for the right On-line financial firms, while growing customer can get personalized service and monitoring. This long-term development of financial enterprises is an important protection of their interests.","PeriodicalId":272940,"journal":{"name":"IEEE International Conference on Wireless Communications, Networking and Information Security","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126427137","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 : 1900-01-01DOI: 10.1109/WCINS.2010.5541854
Chunlei Wang, Yan Wen, Yiqi Dai
The accurate identification and effective analysis of software vulnerabilities depends on flexible and extensible analysis environment. However, current research work cannot provide highly available environment supporting for different types of vulnerabilities. Aiming at the problem, this paper proposes a novel method for constructing software vulnerability analysis environment based upon virtualization technique, defines the system level simulation model for vulnerability analysis, and describes the simulation model based vulnerability analysis method. Based upon the simulation model and analysis method, we have designed and implemented the Virtualization-based Vulnerability Analysis Environment (VirtualVAE), which can examine the operation behaviors of guest operation system and applications at hardware level, and analyze the operation process of sensitive data in the whole system. Therefore, it can accurately simulate a wide variety of system behaviors, and provide dynamic analysis capabilities for different types of vulnerabilities. The experimental results show that it provides a flexible environment for accurately identifying and analyzing the vulnerabilities of software systems.
{"title":"A software vulnerability analysis environment based on virtualization technology","authors":"Chunlei Wang, Yan Wen, Yiqi Dai","doi":"10.1109/WCINS.2010.5541854","DOIUrl":"https://doi.org/10.1109/WCINS.2010.5541854","url":null,"abstract":"The accurate identification and effective analysis of software vulnerabilities depends on flexible and extensible analysis environment. However, current research work cannot provide highly available environment supporting for different types of vulnerabilities. Aiming at the problem, this paper proposes a novel method for constructing software vulnerability analysis environment based upon virtualization technique, defines the system level simulation model for vulnerability analysis, and describes the simulation model based vulnerability analysis method. Based upon the simulation model and analysis method, we have designed and implemented the Virtualization-based Vulnerability Analysis Environment (VirtualVAE), which can examine the operation behaviors of guest operation system and applications at hardware level, and analyze the operation process of sensitive data in the whole system. Therefore, it can accurately simulate a wide variety of system behaviors, and provide dynamic analysis capabilities for different types of vulnerabilities. The experimental results show that it provides a flexible environment for accurately identifying and analyzing the vulnerabilities of software systems.","PeriodicalId":272940,"journal":{"name":"IEEE International Conference on Wireless Communications, Networking and Information Security","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121034048","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 : 1900-01-01DOI: 10.1109/WCINS.2010.5541828
Liqin Tian, Chuang Lin
The resource constraints of wireless sensor network make it easy to attack and hard to protect. Although carefully designed cryptography and authentication help to make WSN securer, they are not good at dealing with compromised node and ageing node, whose misbehavior may impair the function of WSN. Behavior-based trust mechanism is considered as the effective supplement of traditional cryptography security, it has been widely studied in peer-to-peer network, the grid, and the pervasive computing environment. The evaluation of node trust is based on the past behavior evidence, but we hope to know the node future trust, so node trust prediction is important and significant for wireless sensor networks application such as routing, data fusion. The paper discusses how to based on past node trust to predict future node trust, including Bayesian Network modeling, prediction grading, computation of prior probabilities of node trust, computation of prior probabilities of node attribute and prediction of future node trust. In order to meet needs of different prediction of node trust for different purpose, we also discuss that how to get and store node past assorted behavior statistical data. Finally, discuss how to predict node trust in real system and how to control routing, data fusion based on prediction result.
{"title":"Computation and analysis of node intending trust in WSNs","authors":"Liqin Tian, Chuang Lin","doi":"10.1109/WCINS.2010.5541828","DOIUrl":"https://doi.org/10.1109/WCINS.2010.5541828","url":null,"abstract":"The resource constraints of wireless sensor network make it easy to attack and hard to protect. Although carefully designed cryptography and authentication help to make WSN securer, they are not good at dealing with compromised node and ageing node, whose misbehavior may impair the function of WSN. Behavior-based trust mechanism is considered as the effective supplement of traditional cryptography security, it has been widely studied in peer-to-peer network, the grid, and the pervasive computing environment. The evaluation of node trust is based on the past behavior evidence, but we hope to know the node future trust, so node trust prediction is important and significant for wireless sensor networks application such as routing, data fusion. The paper discusses how to based on past node trust to predict future node trust, including Bayesian Network modeling, prediction grading, computation of prior probabilities of node trust, computation of prior probabilities of node attribute and prediction of future node trust. In order to meet needs of different prediction of node trust for different purpose, we also discuss that how to get and store node past assorted behavior statistical data. Finally, discuss how to predict node trust in real system and how to control routing, data fusion based on prediction result.","PeriodicalId":272940,"journal":{"name":"IEEE International Conference on Wireless Communications, Networking and Information Security","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121214955","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 : 1900-01-01DOI: 10.1109/WCINS.2010.5541884
Zhuo Wang, Lizhi Wang, Yong Yang
The ICA technique is used to remove multifrequency mixture noise in Wireless Communication wave/radar reflects signal processing. The characteristics of Wireless Communication wave/radar reflect signals are analyzed, build up models of expectation signal and consociation mixture noise and a constituted method of the independence prognosticate machine is discussed. Use the improved algorithmic of FastICA to simulate it. From simulation results, a well effect is acquired by method of the mixture signals separate above-mentioned. Via this, it can gain source signals almost pure furthermore wider the range ratio scope of each signal channel and type of signal. The method in the text possesses very good anti-jamming ability and it is can be expand other related signal processing, so the method is widely accepted.
{"title":"Remove multifrequency mixture noise in processing of Wireless Communication wave/radar reflect signal by method of ICA","authors":"Zhuo Wang, Lizhi Wang, Yong Yang","doi":"10.1109/WCINS.2010.5541884","DOIUrl":"https://doi.org/10.1109/WCINS.2010.5541884","url":null,"abstract":"The ICA technique is used to remove multifrequency mixture noise in Wireless Communication wave/radar reflects signal processing. The characteristics of Wireless Communication wave/radar reflect signals are analyzed, build up models of expectation signal and consociation mixture noise and a constituted method of the independence prognosticate machine is discussed. Use the improved algorithmic of FastICA to simulate it. From simulation results, a well effect is acquired by method of the mixture signals separate above-mentioned. Via this, it can gain source signals almost pure furthermore wider the range ratio scope of each signal channel and type of signal. The method in the text possesses very good anti-jamming ability and it is can be expand other related signal processing, so the method is widely accepted.","PeriodicalId":272940,"journal":{"name":"IEEE International Conference on Wireless Communications, Networking and Information Security","volume":"59 2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117243363","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
扫码关注我们
求助内容：
应助结果提醒方式：