A small network of computing devices that started as ARPANET project in early 1980s is now a worldwide network of devices for billions of users. This global network, the Internet, has become an integral part of worldwide economy and life of individuals. Internet Protocol (IP) v4 is the basic building block of the Internet and has served well, but it has limitations that hinder its growth. The solution is IPv6, which addresses inherent problems of the earlier version. However, due to the increased overhead in IPv6 and its interaction with the operating system that hosts this communication protocol, there may be network performance issues. In this paper, two operating systems namely, Windows Vista and Linux Ubuntu are configured with the two versions of IP and empirically evaluated for performance difference. Performance related metrics like throughput, delay, jitter and CPU usage are empirically measured on a test-bed implementation. The results show that network performance depends not only on IP version and traffic type, but also on the choice of the operating system.
{"title":"Performance Evaluation of IPv4 and IPv6 on Windows Vista and Linux Ubuntu","authors":"S. Narayan, Peng Shang, Na Fan","doi":"10.1109/NSWCTC.2009.368","DOIUrl":"https://doi.org/10.1109/NSWCTC.2009.368","url":null,"abstract":"A small network of computing devices that started as ARPANET project in early 1980s is now a worldwide network of devices for billions of users. This global network, the Internet, has become an integral part of worldwide economy and life of individuals. Internet Protocol (IP) v4 is the basic building block of the Internet and has served well, but it has limitations that hinder its growth. The solution is IPv6, which addresses inherent problems of the earlier version. However, due to the increased overhead in IPv6 and its interaction with the operating system that hosts this communication protocol, there may be network performance issues. In this paper, two operating systems namely, Windows Vista and Linux Ubuntu are configured with the two versions of IP and empirically evaluated for performance difference. Performance related metrics like throughput, delay, jitter and CPU usage are empirically measured on a test-bed implementation. The results show that network performance depends not only on IP version and traffic type, but also on the choice of the operating system.","PeriodicalId":433291,"journal":{"name":"2009 International Conference on Networks Security, Wireless Communications and Trusted Computing","volume":"76 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":"134048829","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 analyses the problems and disadvantages of generating detectors in the current intrusion detection system so as to propose a method that can be applied into Teiresias algorithm to initialize gene library, relating with the ways of generating detectors by using the gene library based on the artificial immune theory. By using Teiresias algorithm to preprocess the non-self data, we can get a more effective variable-length sequence pattern that can reflect the non-self characteristics. Using this pattern, which is relatively independent, complete and meaningful, to initialize the gene library can make the gene library more optimized, and this will greatly improve the efficiency and accuracy of intrusion detection system.
{"title":"Initialization Method of Gene Library Based on Teiresias Algorithm","authors":"D. You-xiang, Huang Min, Xu Jiuyun","doi":"10.1109/NSWCTC.2009.119","DOIUrl":"https://doi.org/10.1109/NSWCTC.2009.119","url":null,"abstract":"this paper analyses the problems and disadvantages of generating detectors in the current intrusion detection system so as to propose a method that can be applied into Teiresias algorithm to initialize gene library, relating with the ways of generating detectors by using the gene library based on the artificial immune theory. By using Teiresias algorithm to preprocess the non-self data, we can get a more effective variable-length sequence pattern that can reflect the non-self characteristics. Using this pattern, which is relatively independent, complete and meaningful, to initialize the gene library can make the gene library more optimized, and this will greatly improve the efficiency and accuracy of intrusion detection system.","PeriodicalId":433291,"journal":{"name":"2009 International Conference on Networks Security, Wireless Communications and Trusted Computing","volume":"75 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":"131892677","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}
To overcome the issue of limited information about unfamiliar nodes and to reduce the required memory space, a reputation-based trust management strategy for clustered ad hoc networks is proposed in this paper. Basically, our solution begin with gathering neighboring nodes as a cluster with a node selected as the cluster head who is responsible of issuing a trust certificate to every cluster member. Then we propose the method of combining trust ratings and modified Bayesian in the information exchange and reputation judgment. The network is not susceptible to damage from selfish or malicious nodes easily and efficiently. Finally, Analysis of the strategy and performance simulation is also presented.
{"title":"A New Reputation-Based Trust Management Strategy for Clustered Ad Hoc Networks","authors":"Li Xu, Yihui Zhang","doi":"10.1109/NSWCTC.2009.265","DOIUrl":"https://doi.org/10.1109/NSWCTC.2009.265","url":null,"abstract":"To overcome the issue of limited information about unfamiliar nodes and to reduce the required memory space, a reputation-based trust management strategy for clustered ad hoc networks is proposed in this paper. Basically, our solution begin with gathering neighboring nodes as a cluster with a node selected as the cluster head who is responsible of issuing a trust certificate to every cluster member. Then we propose the method of combining trust ratings and modified Bayesian in the information exchange and reputation judgment. The network is not susceptible to damage from selfish or malicious nodes easily and efficiently. Finally, Analysis of the strategy and performance simulation is also presented.","PeriodicalId":433291,"journal":{"name":"2009 International Conference on Networks Security, Wireless Communications and Trusted Computing","volume":"14 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":"134156264","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}
Yong Zhang, Kewen Wang, Keqiu Li, W. Qu, Yang Xiang
This paper proposes a time-decay based trust model in peer-to-peer networks. Through the transaction time is faded, the proposed model makes trust value changed dynamically with time decay, which achieves the goal that the more transaction close to, the more reliable it is. Finally this paper presents the experimental protocol and simulation. The experimental result shows that the proposed model is more approached fact value and it can resist vicious association attraction, dynamic strategy attraction, and it has a favorable performance.
{"title":"A Time-decay Based P2P Trust Model","authors":"Yong Zhang, Kewen Wang, Keqiu Li, W. Qu, Yang Xiang","doi":"10.1109/NSWCTC.2009.98","DOIUrl":"https://doi.org/10.1109/NSWCTC.2009.98","url":null,"abstract":"This paper proposes a time-decay based trust model in peer-to-peer networks. Through the transaction time is faded, the proposed model makes trust value changed dynamically with time decay, which achieves the goal that the more transaction close to, the more reliable it is. Finally this paper presents the experimental protocol and simulation. The experimental result shows that the proposed model is more approached fact value and it can resist vicious association attraction, dynamic strategy attraction, and it has a favorable performance.","PeriodicalId":433291,"journal":{"name":"2009 International Conference on Networks Security, Wireless Communications and Trusted Computing","volume":"12 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":"133826758","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}
As the Internet is a lack of effective information management tools, adopting a classification markings on the Internet for information management, and has designed a hierarchical structure of the security labels Protection measures, an analysis of management at different levels in the framework of a number of key technologies and security tag technology. The system has a certain value on the proliferation of content on the Internet today.
{"title":"Analysis and Design of the Classification Management on the Information Content Security Based on the Label","authors":"Junhua He, S. Mao","doi":"10.1109/NSWCTC.2009.308","DOIUrl":"https://doi.org/10.1109/NSWCTC.2009.308","url":null,"abstract":"As the Internet is a lack of effective information management tools, adopting a classification markings on the Internet for information management, and has designed a hierarchical structure of the security labels Protection measures, an analysis of management at different levels in the framework of a number of key technologies and security tag technology. The system has a certain value on the proliferation of content on the Internet today.","PeriodicalId":433291,"journal":{"name":"2009 International Conference on Networks Security, Wireless Communications and Trusted Computing","volume":"45 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":"122944303","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 proposed an object packaging based cache scheme for GPRS network. Our study demonstrated that better performance can be achieved when packaging utilized. In addition, the scheme can be used for other resource limited networks.
{"title":"An Object Packaging Based Cache Scheme for GPRS Network","authors":"Xiaohui Chen, Weidong Wang, Xiaowei Qin, Guo Wei","doi":"10.1109/NSWCTC.2009.139","DOIUrl":"https://doi.org/10.1109/NSWCTC.2009.139","url":null,"abstract":"In this paper, we proposed an object packaging based cache scheme for GPRS network. Our study demonstrated that better performance can be achieved when packaging utilized. In addition, the scheme can be used for other resource limited networks.","PeriodicalId":433291,"journal":{"name":"2009 International Conference on Networks Security, Wireless Communications and Trusted Computing","volume":"72 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":"122935493","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}
Guangwei Liu, Jian Xu, Mengmeng Cao, Fu-cai Zhou, Bin Zhang
As multicasting is increasingly used as an efficient communication mechanism for group-oriented applications in the Internet, the research of the multicast key management is becoming a hot issue. Firstly, we analyze the n-party GDH.2 multicast key management protocol and point out that it has the following flaws: lack of certification, vulnerability to man-in-the-middle attacks, and a single-point failure. In order to settle the issues mentioned above, a fault-tolerant and secure multicast key management protocol (FTS, for short) with using the fault-tolerant algorithm and the password authentication mechanism is proposed in this paper. In our protocol, legal members are able to agree on a key despite failures of other members. The protocol can also prevent man-in-the-middle attacks. Finally, we evaluate the security of FTS, and compare our protocol with the FTKM through performance analysis. The analytic results show that the protocol not only avoids the single-point failure but also improves the comprehensive performance.
{"title":"Research of Secure Multicast Key Management Protocol Based on Fault-Tolerant Mechanism","authors":"Guangwei Liu, Jian Xu, Mengmeng Cao, Fu-cai Zhou, Bin Zhang","doi":"10.1109/NSWCTC.2009.273","DOIUrl":"https://doi.org/10.1109/NSWCTC.2009.273","url":null,"abstract":"As multicasting is increasingly used as an efficient communication mechanism for group-oriented applications in the Internet, the research of the multicast key management is becoming a hot issue. Firstly, we analyze the n-party GDH.2 multicast key management protocol and point out that it has the following flaws: lack of certification, vulnerability to man-in-the-middle attacks, and a single-point failure. In order to settle the issues mentioned above, a fault-tolerant and secure multicast key management protocol (FTS, for short) with using the fault-tolerant algorithm and the password authentication mechanism is proposed in this paper. In our protocol, legal members are able to agree on a key despite failures of other members. The protocol can also prevent man-in-the-middle attacks. Finally, we evaluate the security of FTS, and compare our protocol with the FTKM through performance analysis. The analytic results show that the protocol not only avoids the single-point failure but also improves the comprehensive performance.","PeriodicalId":433291,"journal":{"name":"2009 International Conference on Networks Security, Wireless Communications and Trusted Computing","volume":"73 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":"115795501","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}
Orthogonal Frequency Division Multiplexing (OFDM) is a method that can combat multi-paths, fully use the frequency band, has high data rate and has a promising future in UWA communication. While longer the transmission range, worse the underwater conditions with multi-paths and Doppler offset, which needs to design the system parameters and take practical methods to improve the system. In this paper, a new PRP-OFDM (A Pseudo random Postfix OFDM) algorithm is proposed, which has a good performance and low-complexity.
{"title":"Channel Estimation for PRP-OFDM in Underwater Acoustic Communication System","authors":"Jinlong Xian, Zhonglei Zhang","doi":"10.1109/NSWCTC.2009.161","DOIUrl":"https://doi.org/10.1109/NSWCTC.2009.161","url":null,"abstract":"Orthogonal Frequency Division Multiplexing (OFDM) is a method that can combat multi-paths, fully use the frequency band, has high data rate and has a promising future in UWA communication. While longer the transmission range, worse the underwater conditions with multi-paths and Doppler offset, which needs to design the system parameters and take practical methods to improve the system. In this paper, a new PRP-OFDM (A Pseudo random Postfix OFDM) algorithm is proposed, which has a good performance and low-complexity.","PeriodicalId":433291,"journal":{"name":"2009 International Conference on Networks Security, Wireless Communications and Trusted Computing","volume":"22 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":"122196547","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 article, from the prospect of P2P e-commerce advantages and challenges, discusses the risks of P2P e-commerce issues, and points out that trust is the basis of all business activities. Business organizations should take certain measures against risks from P2P e-commerce. The effective confidence-building mechanism can enable e-commerce more secure, reduce the risk of people's expectations, and enhance confidence in the P2P e-commerce. Taking into account the needs of e-commerce data security, this paper provides P2P-based e-commerce trust model. This model has inherited the advantages of traditional P2P model, combined with confidence-building mechanism to check for the main business in order to provide a highly reliable low-cost application.
{"title":"P2P-based E-commerce Trust Model and Strategies","authors":"Chen Xin","doi":"10.1109/NSWCTC.2009.372","DOIUrl":"https://doi.org/10.1109/NSWCTC.2009.372","url":null,"abstract":"This article, from the prospect of P2P e-commerce advantages and challenges, discusses the risks of P2P e-commerce issues, and points out that trust is the basis of all business activities. Business organizations should take certain measures against risks from P2P e-commerce. The effective confidence-building mechanism can enable e-commerce more secure, reduce the risk of people's expectations, and enhance confidence in the P2P e-commerce. Taking into account the needs of e-commerce data security, this paper provides P2P-based e-commerce trust model. This model has inherited the advantages of traditional P2P model, combined with confidence-building mechanism to check for the main business in order to provide a highly reliable low-cost application.","PeriodicalId":433291,"journal":{"name":"2009 International Conference on Networks Security, Wireless Communications and Trusted Computing","volume":"58 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":"124564737","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 joint subcarrier and power allocation in uplink OFDMA systems with incomplete channel state information is proposed. The subcarrier allocation problem is considered as a multi-player discrete, stochastic and finite strategy game, and equal power is allocated to the subcarriers of each user. Particularly, the utility function is based on the channel capability and adds the pricing scheme to guarantee the fairness. The subcarrier allocation is different from the traditional scheme in which the subcarriers are allocated passively. In our process, each of the subcarriers is viewed as a learning automaton to choose the most satisfying user. We adopt the linear reward-inaction algorithm to obtain the Nash equilibrium. Theoretic analysis is given. Simulation results show our allocation scheme has good convergence, and the performance gap is tolerated compared with the complete channel state case.
{"title":"Joint Subcarrier and Power Allocation in Uplink OFDMA Systems with Incomplete Channel State Information","authors":"Dan Wu, Yueming Cai, Chengkang Pan","doi":"10.1109/NSWCTC.2009.58","DOIUrl":"https://doi.org/10.1109/NSWCTC.2009.58","url":null,"abstract":"A joint subcarrier and power allocation in uplink OFDMA systems with incomplete channel state information is proposed. The subcarrier allocation problem is considered as a multi-player discrete, stochastic and finite strategy game, and equal power is allocated to the subcarriers of each user. Particularly, the utility function is based on the channel capability and adds the pricing scheme to guarantee the fairness. The subcarrier allocation is different from the traditional scheme in which the subcarriers are allocated passively. In our process, each of the subcarriers is viewed as a learning automaton to choose the most satisfying user. We adopt the linear reward-inaction algorithm to obtain the Nash equilibrium. Theoretic analysis is given. Simulation results show our allocation scheme has good convergence, and the performance gap is tolerated compared with the complete channel state case.","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":"125250531","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
扫码关注我们
求助内容：
应助结果提醒方式：