Zhu Yonghua, Dong Zhiling, Pan Shunhong, Wang Lu, Zhang Qian, Wu Junjie
Wireless Sensor Networks (WSN) are composed of a large number of sensor nodes which are connected by wireless channels. Some of these sensor nodes are regarded as critical nodes which are responsible for the management of the other nodes in their sphere. Therefore, update of node information must be implemented through these critical nodes’ multicast operation. In this paper, we present a novel Node Information Update Multicast (NIUM) algorithm to optimize the transmission performance among critical nodes. After applying with our algorithm, each critical node could explore a reasonable transportation way according to its distance apart from other critical nodes. Despite of the ideal assumption, our algorithm is also tested under different circumstances and the results prove that it behaves well for prompt node information update in wireless sensor networks. Both velocity and efficiency of the network can be improved tremendously.
{"title":"A Novel Node Information Update Multicast Algorithm in Wireless Sensor Networks","authors":"Zhu Yonghua, Dong Zhiling, Pan Shunhong, Wang Lu, Zhang Qian, Wu Junjie","doi":"10.1109/NSWCTC.2009.320","DOIUrl":"https://doi.org/10.1109/NSWCTC.2009.320","url":null,"abstract":"Wireless Sensor Networks (WSN) are composed of a large number of sensor nodes which are connected by wireless channels. Some of these sensor nodes are regarded as critical nodes which are responsible for the management of the other nodes in their sphere. Therefore, update of node information must be implemented through these critical nodes’ multicast operation. In this paper, we present a novel Node Information Update Multicast (NIUM) algorithm to optimize the transmission performance among critical nodes. After applying with our algorithm, each critical node could explore a reasonable transportation way according to its distance apart from other critical nodes. Despite of the ideal assumption, our algorithm is also tested under different circumstances and the results prove that it behaves well for prompt node information update in wireless sensor networks. Both velocity and efficiency of the network can be improved tremendously.","PeriodicalId":433291,"journal":{"name":"2009 International Conference on Networks Security, Wireless Communications and Trusted Computing","volume":"88 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":"134254211","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}
RFID (Radio Frequency Identification) yoking proof protocol [1,6,9] allows a verifier to collect the proof of the simultaneous presence of two tags in the communication range of a specified reader. This proof has found several interesting applications. However, in the existing RFID yoking schemes, the computational cost of identifying a tag in the back-end server is O(N), where N is the number of tags. This paper proposes a tree-based yoking-proof scheme, which employs the tree structure to organize the tags and treats the dynamically updated paths of tags as the secrets to identify the tags. This arrangement results in great improvement of only O(1) computational cost to identifying the tag.
RFID (Radio Frequency Identification，射频识别)对联证明协议[1,6,9]允许验证者收集在指定阅读器的通信范围内同时存在两个标签的证明。这个证明有几个有趣的应用。然而，在现有的RFID联立方案中，在后端服务器中识别一个标签的计算成本为O(N)，其中N为标签的数量。本文提出了一种基于树的标签证明方案，该方案采用树形结构组织标签，并将标签的动态更新路径作为识别标签的秘密。这种安排大大提高了识别标签的计算成本，仅为0(1)。
{"title":"Tree-Based RFID Yoking Proof","authors":"H. Chien, Shih-Bin Liu","doi":"10.1109/NSWCTC.2009.316","DOIUrl":"https://doi.org/10.1109/NSWCTC.2009.316","url":null,"abstract":"RFID (Radio Frequency Identification) yoking proof protocol [1,6,9] allows a verifier to collect the proof of the simultaneous presence of two tags in the communication range of a specified reader. This proof has found several interesting applications. However, in the existing RFID yoking schemes, the computational cost of identifying a tag in the back-end server is O(N), where N is the number of tags. This paper proposes a tree-based yoking-proof scheme, which employs the tree structure to organize the tags and treats the dynamically updated paths of tags as the secrets to identify the tags. This arrangement results in great improvement of only O(1) computational cost to identifying the tag.","PeriodicalId":433291,"journal":{"name":"2009 International Conference on Networks Security, Wireless Communications and Trusted Computing","volume":"06 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":"133810437","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 propose a combination model of fuzzy partitions with the same number of clusters by generalizing the traditional majority voting rule to fuzzy majority voting rule and a class matching algorithm based on k nearest neighbours (KNN) to establish the correspondence among classes of component fuzzy partitions. The comparisons between our combination model and other two methods over real-world data sets show that our combination method is a little better than the other two.
{"title":"A Combination Scheme for Fuzzy Partitions Based on Fuzzy Majority Voting Rule","authors":"Chunsheng Li","doi":"10.1109/NSWCTC.2009.251","DOIUrl":"https://doi.org/10.1109/NSWCTC.2009.251","url":null,"abstract":"This paper propose a combination model of fuzzy partitions with the same number of clusters by generalizing the traditional majority voting rule to fuzzy majority voting rule and a class matching algorithm based on k nearest neighbours (KNN) to establish the correspondence among classes of component fuzzy partitions. The comparisons between our combination model and other two methods over real-world data sets show that our combination method is a little better than the other two.","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":"132252619","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}
BitTorrent(BT) applications are very popular on the Internet. Measuring the impact it has on the network and understanding their behavior is an important field. From the perspective of network management, a thorough understanding of the stochastic properties of BT traffic is thus crucial to designing better traffic and resource control algorithms. However, previous works on measuring and analyzing BT application mostly focus on both data and message traffic. In order to gain insights into BT systems especially the message characteristics, we have undertaken an in-depth measurement and modeling study of BT message. Our results show that the Message model can well describe the BT incentive mechanism and the statistics collected on different files can fit equally well into distributions.
{"title":"Measuring and Modeling Message-Level Characteristics of BitTorrent","authors":"Feng Liu, Zhitang Li, Lihui Huang","doi":"10.1109/NSWCTC.2009.214","DOIUrl":"https://doi.org/10.1109/NSWCTC.2009.214","url":null,"abstract":"BitTorrent(BT) applications are very popular on the Internet. Measuring the impact it has on the network and understanding their behavior is an important field. From the perspective of network management, a thorough understanding of the stochastic properties of BT traffic is thus crucial to designing better traffic and resource control algorithms. However, previous works on measuring and analyzing BT application mostly focus on both data and message traffic. In order to gain insights into BT systems especially the message characteristics, we have undertaken an in-depth measurement and modeling study of BT message. Our results show that the Message model can well describe the BT incentive mechanism and the statistics collected on different files can fit equally well into distributions.","PeriodicalId":433291,"journal":{"name":"2009 International Conference on Networks Security, Wireless Communications and Trusted Computing","volume":"59 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":"133224222","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}
Bluetooth node is mobile and the bandwidth-limited, constructing a QoS route for communication from one node to another in scatternet is a significant challenge. A hierarchical management model can be built for large scale Bluetooth network. In this paper a hierarchical network model for Bluetooth scatternet is proposed through plotting out the flat graph into sub-graphs which are abstracted as high-level graph, and rules to partition the graph into sub-graphs is also given. Then, a shortest path calculation algorithm is given for the hierarchical network.
{"title":"Hierarchical Routing for Large Scale Bluetooth Network","authors":"Xiang Li, Chaoguang Men, Mantian Li, Lining Sun","doi":"10.1109/NSWCTC.2009.293","DOIUrl":"https://doi.org/10.1109/NSWCTC.2009.293","url":null,"abstract":"Bluetooth node is mobile and the bandwidth-limited, constructing a QoS route for communication from one node to another in scatternet is a significant challenge. A hierarchical management model can be built for large scale Bluetooth network. In this paper a hierarchical network model for Bluetooth scatternet is proposed through plotting out the flat graph into sub-graphs which are abstracted as high-level graph, and rules to partition the graph into sub-graphs is also given. Then, a shortest path calculation algorithm is given for the hierarchical network.","PeriodicalId":433291,"journal":{"name":"2009 International Conference on Networks Security, Wireless Communications and Trusted Computing","volume":"4 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":"132649189","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}
Java is a kind of type-safe language, it introduces access control mechanism into bytecode and application layer, so as to guarantee the system resource and running environment avoid the invasion of the malicious code. However, in some information systems, information leakage is not due to the faultiness of the security model, but the absence of the information flow control policy and implementation of that in the source code. So, it is necessary to analyze how information leaks through the source code. This paper surveys information leakage in Java source code by qualitative analysis, and after defining conditional information entropy of the variables, quantitative analysis of information-leak in code is given. Language-based software security researches, new direction in the development of high trusted software, are introduced finally.
{"title":"Qualitative and Quantitative Analysis of Information Leakage in Java Source Code","authors":"Bo Chen, Da-wei Xu, Ling Yu","doi":"10.1109/NSWCTC.2009.317","DOIUrl":"https://doi.org/10.1109/NSWCTC.2009.317","url":null,"abstract":"Java is a kind of type-safe language, it introduces access control mechanism into bytecode and application layer, so as to guarantee the system resource and running environment avoid the invasion of the malicious code. However, in some information systems, information leakage is not due to the faultiness of the security model, but the absence of the information flow control policy and implementation of that in the source code. So, it is necessary to analyze how information leaks through the source code. This paper surveys information leakage in Java source code by qualitative analysis, and after defining conditional information entropy of the variables, quantitative analysis of information-leak in code is given. Language-based software security researches, new direction in the development of high trusted software, are introduced finally.","PeriodicalId":433291,"journal":{"name":"2009 International Conference on Networks Security, Wireless Communications and Trusted Computing","volume":"133 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":"132980389","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 wireless video communication system applied to plant disease control is introduced in this paper. The system is used to acquire and transmit the field plant image or video data for subsequent monitoring and diagnosis. It is based on the DSP TMS320DM642 and nRF24L01 single chip 2.4GHz radio transceiver. It has two data compress and transmission tactics to meet users’ different need and uses multi-channel wireless communication to lower the whole cost in the system.
{"title":"Design of Wireless Video Communication System Used to Monitor and Control Plant Disease","authors":"Xiu-qing Wang, Chunxia Zhang, Shifeng Yang","doi":"10.1109/NSWCTC.2009.235","DOIUrl":"https://doi.org/10.1109/NSWCTC.2009.235","url":null,"abstract":"A wireless video communication system applied to plant disease control is introduced in this paper. The system is used to acquire and transmit the field plant image or video data for subsequent monitoring and diagnosis. It is based on the DSP TMS320DM642 and nRF24L01 single chip 2.4GHz radio transceiver. It has two data compress and transmission tactics to meet users’ different need and uses multi-channel wireless communication to lower the whole cost in the system.","PeriodicalId":433291,"journal":{"name":"2009 International Conference on Networks Security, Wireless Communications and Trusted Computing","volume":"87 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":"133429781","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 give the number of ADMs in a unidirectional ring, $A(8,N)$=$lceil 5N(N-1)/16rceil$ when $Nequiv 0,1,4,6,7$ (mod 16), with the possible exceptions $N$=36, 38, 39.
{"title":"Traffic Grooming in WDM Ring Networks with Grooming Ratio 8","authors":"Zhihe Liang, Yulian Miao, Yanfang Zhang","doi":"10.1109/NSWCTC.2009.321","DOIUrl":"https://doi.org/10.1109/NSWCTC.2009.321","url":null,"abstract":"In this paper, we give the number of ADMs in a unidirectional ring, $A(8,N)$=$lceil 5N(N-1)/16rceil$ when $Nequiv 0,1,4,6,7$ (mod 16), with the possible exceptions $N$=36, 38, 39.","PeriodicalId":433291,"journal":{"name":"2009 International Conference on Networks Security, Wireless Communications and Trusted Computing","volume":"57 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":"133586704","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}
The paper designs the WSACPL policy ontology to express access control policies for web services. The ontology also includes a mechanism to resolve conflicts among WSACPL policies. In the end, the paper gives an implementation called WACS. The WACS combines WSACPL policy ontology with domain ontology and service ontology to realize semantic access control for web services.
{"title":"Semantic Access Control for Web Services","authors":"Miao Liu, Dongqing Xie, Peng Li, Xunlai Zhang, Chunming Tang","doi":"10.1109/NSWCTC.2009.389","DOIUrl":"https://doi.org/10.1109/NSWCTC.2009.389","url":null,"abstract":"The paper designs the WSACPL policy ontology to express access control policies for web services. The ontology also includes a mechanism to resolve conflicts among WSACPL policies. In the end, the paper gives an implementation called WACS. The WACS combines WSACPL policy ontology with domain ontology and service ontology to realize semantic access control for web services.","PeriodicalId":433291,"journal":{"name":"2009 International Conference on Networks Security, Wireless Communications and Trusted Computing","volume":"652 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":"117109154","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}
The open, sharing and anonymous nature of peer-to-peer (P2P) network has offered opportunities and threats for the development of distributed computing technology. One feasible way to minimize threats is to establish the reputation-based trust management system (TMS). Most of previous work concentrates on how to rate peers’ behaviors with the trust mechanism and how to establish the reputation-based trust management mechanism, but takes no consideration of the security problems in trust information management. As for this issue, this paper proposes a security protocol for protecting the P2P trust information management (SPTM). Theoretical analysis and simulation experiments show that, SPTM can effectively suppress the sybil attackers and trust information tamper peers in transmissions with little time overhead. Moreover, it can be easily integrated into various reputation-based TMSs.
{"title":"SPTM: A Security Protocol for Protecting the P2P Trust Information Management","authors":"Jianli Hu, Quanyuan Wu, Bin Zhou","doi":"10.1109/NSWCTC.2009.156","DOIUrl":"https://doi.org/10.1109/NSWCTC.2009.156","url":null,"abstract":"The open, sharing and anonymous nature of peer-to-peer (P2P) network has offered opportunities and threats for the development of distributed computing technology. One feasible way to minimize threats is to establish the reputation-based trust management system (TMS). Most of previous work concentrates on how to rate peers’ behaviors with the trust mechanism and how to establish the reputation-based trust management mechanism, but takes no consideration of the security problems in trust information management. As for this issue, this paper proposes a security protocol for protecting the P2P trust information management (SPTM). Theoretical analysis and simulation experiments show that, SPTM can effectively suppress the sybil attackers and trust information tamper peers in transmissions with little time overhead. Moreover, it can be easily integrated into various reputation-based TMSs.","PeriodicalId":433291,"journal":{"name":"2009 International Conference on Networks Security, Wireless Communications and Trusted Computing","volume":"5 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":"115589013","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
扫码关注我们
求助内容：
应助结果提醒方式：