One of the obstacles to wide adaptation of passive RFID systems is the limited read distance or relatively high error rate due to radio interferences in the passive backscatter RFID systems. The most important tag performance characteristic is read distance at which RFID reader can detect the backscattered signal from the tag. The read distance in passive backscatter RFID systems depends on many factors, e.g. the transmitted power, the frequency used, the gain of the reader and tag antennae, the aperture of the antennae, the quality factor of the antennae, the sensitivity of the readers, modulation type and depth, and the application environment etc. This paper presented an overview of passive backscatter RFID systems and the read distance performance of these systems. We focus on presenting an overview of several antenna parameters impacting on read distance in the passive backscatter RFID systems. The function of antenna gain, operational frequency, radar cross-section, antenna quality factor, and polarization mismatch were analyzed.
{"title":"The Effects of Antenna Properties on Read Distance in Passive Backscatter RFID Systems","authors":"Zhijun Tang, Yigang He, ZhouGuo Hou, Bing Li","doi":"10.1109/NSWCTC.2009.395","DOIUrl":"https://doi.org/10.1109/NSWCTC.2009.395","url":null,"abstract":"One of the obstacles to wide adaptation of passive RFID systems is the limited read distance or relatively high error rate due to radio interferences in the passive backscatter RFID systems. The most important tag performance characteristic is read distance at which RFID reader can detect the backscattered signal from the tag. The read distance in passive backscatter RFID systems depends on many factors, e.g. the transmitted power, the frequency used, the gain of the reader and tag antennae, the aperture of the antennae, the quality factor of the antennae, the sensitivity of the readers, modulation type and depth, and the application environment etc. This paper presented an overview of passive backscatter RFID systems and the read distance performance of these systems. We focus on presenting an overview of several antenna parameters impacting on read distance in the passive backscatter RFID systems. The function of antenna gain, operational frequency, radar cross-section, antenna quality factor, and polarization mismatch were analyzed.","PeriodicalId":433291,"journal":{"name":"2009 International Conference on Networks Security, Wireless Communications and Trusted Computing","volume":"295 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":"123037138","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 data transmission system using octal continuous phase frequency shift keying (CPFSK) modulation is designed for bandwidth and energy efficiency. The baseband pulse shaping technique is adopted for bandwidth efficiency, and the octal ring convolutional trellis code is adopted for energy efficiency. The system model is built and the components are described. Then the simplified baseband simulation model is built. Based on the simulation model, the system performance is studied using computer simulation. Both the theoretical analysis and computer simulation results show that the coded 8CPFSK system outperforms the uncoded 4CPFSK system when the signal to noise ratio is not too low. So it is suitable to use coded 8CPFSK system for data transmission.
{"title":"Design of Data Transmission System with Coded 8CPFSK Modulation","authors":"Wenzhe Ma","doi":"10.1109/NSWCTC.2009.152","DOIUrl":"https://doi.org/10.1109/NSWCTC.2009.152","url":null,"abstract":"The data transmission system using octal continuous phase frequency shift keying (CPFSK) modulation is designed for bandwidth and energy efficiency. The baseband pulse shaping technique is adopted for bandwidth efficiency, and the octal ring convolutional trellis code is adopted for energy efficiency. The system model is built and the components are described. Then the simplified baseband simulation model is built. Based on the simulation model, the system performance is studied using computer simulation. Both the theoretical analysis and computer simulation results show that the coded 8CPFSK system outperforms the uncoded 4CPFSK system when the signal to noise ratio is not too low. So it is suitable to use coded 8CPFSK system for data transmission.","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":"126080331","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, resource allocation for mixed traffic in wireless access networks is investigated and a Utility-based Resource Dynamic Allocation (URDA) algorithm is proposed. This algorithm considers the QoS characteristics, real-time resource requirements and wireless channel states that belong to different types of applications, and then generates utility functions of them. The resource is allocated dynamically according to these utility functions. Simulation results indicate that URDA works much better than traditional algorithms and achieves the target of resource allocation optimization.
{"title":"Utility-Based Resource Dynamic Allocation for Mixed Traffic in Wireless Networks","authors":"J. Nie, Xiaohui Chen, Weidong Wang","doi":"10.1109/NSWCTC.2009.127","DOIUrl":"https://doi.org/10.1109/NSWCTC.2009.127","url":null,"abstract":"In this paper, resource allocation for mixed traffic in wireless access networks is investigated and a Utility-based Resource Dynamic Allocation (URDA) algorithm is proposed. This algorithm considers the QoS characteristics, real-time resource requirements and wireless channel states that belong to different types of applications, and then generates utility functions of them. The resource is allocated dynamically according to these utility functions. Simulation results indicate that URDA works much better than traditional algorithms and achieves the target of resource allocation optimization.","PeriodicalId":433291,"journal":{"name":"2009 International Conference on Networks Security, Wireless Communications and Trusted Computing","volume":"16 7","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-04-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120972693","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}
Cao Jianglian, Zhang Zhao-xiao, Zeng Wenli, Pei Tingrui
Routing in Ad hoc Networks has received significant attention with a number of different routing protocols proposed in recent years. DSR, DSDV and AODV are the shortest path protocols for Ad Hoc networks. According to energy, the shortest path may be not the best path. A new mechanism of energy-aware named EAODV for ad hoc is proposed in this paper, which is based on the classical AODV (the routing protocol on demand). In EAODV, The route which spends less energy and owns larger capacity is selected by synthetic analysis. Use software simulating and analyze performance of it. Results show it can save more energy.
{"title":"Energy-aware AODV Routing for Ad Hoc Networks","authors":"Cao Jianglian, Zhang Zhao-xiao, Zeng Wenli, Pei Tingrui","doi":"10.1109/NSWCTC.2009.66","DOIUrl":"https://doi.org/10.1109/NSWCTC.2009.66","url":null,"abstract":"Routing in Ad hoc Networks has received significant attention with a number of different routing protocols proposed in recent years. DSR, DSDV and AODV are the shortest path protocols for Ad Hoc networks. According to energy, the shortest path may be not the best path. A new mechanism of energy-aware named EAODV for ad hoc is proposed in this paper, which is based on the classical AODV (the routing protocol on demand). In EAODV, The route which spends less energy and owns larger capacity is selected by synthetic analysis. Use software simulating and analyze performance of it. Results show it can save more energy.","PeriodicalId":433291,"journal":{"name":"2009 International Conference on Networks Security, Wireless Communications and Trusted Computing","volume":"69 ","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-04-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114051795","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}
Pan Deng, Feng Chen, Xiaohui Rong, Peng Jiang, Wen Jin
Lighting Control System has brought a research focus in workflow technology. Constraints-based service selection is an NP problem. Featured in searching globally, genetic algorithm can be a better option for solving the problem. The paper improve the traditional algorithms for obtaining the higher fitness, Experiment results prove it available and better than some traditional algorithms.
{"title":"A Service Selection Method Based on Constraints in a Lighting Control System","authors":"Pan Deng, Feng Chen, Xiaohui Rong, Peng Jiang, Wen Jin","doi":"10.1109/NSWCTC.2009.20","DOIUrl":"https://doi.org/10.1109/NSWCTC.2009.20","url":null,"abstract":"Lighting Control System has brought a research focus in workflow technology. Constraints-based service selection is an NP problem. Featured in searching globally, genetic algorithm can be a better option for solving the problem. The paper improve the traditional algorithms for obtaining the higher fitness, Experiment results prove it available and better than some traditional algorithms.","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":"122406314","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}
Certificate-based encryption (CBE) is a new paradigm which overcomes the shortcomings of traditional public-key encryption and identity based encryption. CBE provides an efficient implicit certificate mechanism to eliminate third-party queries for the certificate status and to simplify the certificate revocation problem. Therefore, CBE can be used to construct an efficient PKI requiring fewer infrastructures. In addition, it also solves the key escrow and key distribution problem inherent in IBE. In this paper, we introduce a new notion called Threshold Certificate-Based Encryption (TCBE) to overcome the limitations of CBE due to the using of sole master key in the system. It preserves the advantages of CBE such as implicit certificate and no private key escrow. At the same time it also inherits the properties of threshold encryption. We first formalize the definition and security model for TCBE. Then we construct a concrete TCBE scheme which is CCA-secure in the standard model.
{"title":"Threshold Certificate-Based Encryption: Definition and Concrete Construction","authors":"Yang Lu, Jiguo Li, Junmo Xiao","doi":"10.1109/NSWCTC.2009.105","DOIUrl":"https://doi.org/10.1109/NSWCTC.2009.105","url":null,"abstract":"Certificate-based encryption (CBE) is a new paradigm which overcomes the shortcomings of traditional public-key encryption and identity based encryption. CBE provides an efficient implicit certificate mechanism to eliminate third-party queries for the certificate status and to simplify the certificate revocation problem. Therefore, CBE can be used to construct an efficient PKI requiring fewer infrastructures. In addition, it also solves the key escrow and key distribution problem inherent in IBE. In this paper, we introduce a new notion called Threshold Certificate-Based Encryption (TCBE) to overcome the limitations of CBE due to the using of sole master key in the system. It preserves the advantages of CBE such as implicit certificate and no private key escrow. At the same time it also inherits the properties of threshold encryption. We first formalize the definition and security model for TCBE. Then we construct a concrete TCBE scheme which is CCA-secure in the standard model.","PeriodicalId":433291,"journal":{"name":"2009 International Conference on Networks Security, Wireless Communications and Trusted Computing","volume":"42 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":"122846593","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 data fusing ability of cluster head is affected by the correlation of sensed data from different nodes in Wireless sensor networks, which are data centered. This paper analyses the influence of regional data correlation on energy efficiency of clustering protocol, and then proposes a data aware clustering for data gathering (DACDG). DACDG uses residual energy and the correction of sensed data from neighbors to construct clusters, and adopts the way of iterative computing to elect cluster head. Compared with existing protocols, simulation results show that DACDG achieves its goals of consuming less energy, equalizing the energy consumption of all the nodes, as well as extending the network lifetime outstandingly.
{"title":"Data Aware Clustering for Data Gathering in Wireless Sensor Networks","authors":"Jie Zheng, Yugui Qu, Bao-hua Zhao","doi":"10.1109/NSWCTC.2009.70","DOIUrl":"https://doi.org/10.1109/NSWCTC.2009.70","url":null,"abstract":"The data fusing ability of cluster head is affected by the correlation of sensed data from different nodes in Wireless sensor networks, which are data centered. This paper analyses the influence of regional data correlation on energy efficiency of clustering protocol, and then proposes a data aware clustering for data gathering (DACDG). DACDG uses residual energy and the correction of sensed data from neighbors to construct clusters, and adopts the way of iterative computing to elect cluster head. Compared with existing protocols, simulation results show that DACDG achieves its goals of consuming less energy, equalizing the energy consumption of all the nodes, as well as extending the network lifetime outstandingly.","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":"127683838","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}
An evaluation method for the network reliability of communication networks based on the entropy measures is presented. Without the previous knowledge of the reliability of nodes and links, this method quantizes the uncertainty of the link and node importance through the entropy measures and evaluates the network reliability according to the network entropy. The theoretical analysis indicates that the proposed algorithm outperforms the existing algorithms. The experimental results demonstrate the efficiency of the proposed algorithm.
{"title":"Evaluation Method for the Network Reliability Based on the Entropy Measures","authors":"Yu Jiang, A. Hu, Ming He","doi":"10.1109/NSWCTC.2009.128","DOIUrl":"https://doi.org/10.1109/NSWCTC.2009.128","url":null,"abstract":"An evaluation method for the network reliability of communication networks based on the entropy measures is presented. Without the previous knowledge of the reliability of nodes and links, this method quantizes the uncertainty of the link and node importance through the entropy measures and evaluates the network reliability according to the network entropy. The theoretical analysis indicates that the proposed algorithm outperforms the existing algorithms. The experimental results demonstrate the efficiency of the proposed algorithm.","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":"128033777","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 single-station-location research arouses more and more attention for the advantage of simplicity, flexibility and maneuverability. This paper proposed a method of location the mobile station by using a single base station under the non-line-of-sight environment. Each position and scattering distance of scatters can be estimated through the circle fitting algorithm, so the problem of single-station-location is converted to the multi-station-location problem. The simulation result also verified the ability of this method.
{"title":"The Maneuverable Single Based Station Position Method in the Non-Line-of-Sight Cellular Environment","authors":"Yang Tianchi, Jin Liang","doi":"10.1109/NSWCTC.2009.120","DOIUrl":"https://doi.org/10.1109/NSWCTC.2009.120","url":null,"abstract":"The single-station-location research arouses more and more attention for the advantage of simplicity, flexibility and maneuverability. This paper proposed a method of location the mobile station by using a single base station under the non-line-of-sight environment. Each position and scattering distance of scatters can be estimated through the circle fitting algorithm, so the problem of single-station-location is converted to the multi-station-location problem. The simulation result also verified the ability of this method.","PeriodicalId":433291,"journal":{"name":"2009 International Conference on Networks Security, Wireless Communications and Trusted Computing","volume":"11 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":"128057028","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 investigates a random edge deletion model for directed scale-free graphs that grow with preferential attachment depending on the in- and out-degrees, we show that the resulting in- and out-degree distributions are power laws with correlated exponents, reproducing observed properties of the world-wide web.
{"title":"Random Edge Deletion in Directed Scale-Free Graphs","authors":"Yunzhi Yan, Han-Xing Wang","doi":"10.1109/NSWCTC.2009.309","DOIUrl":"https://doi.org/10.1109/NSWCTC.2009.309","url":null,"abstract":"This paper investigates a random edge deletion model for directed scale-free graphs that grow with preferential attachment depending on the in- and out-degrees, we show that the resulting in- and out-degree distributions are power laws with correlated exponents, reproducing observed properties of the world-wide web.","PeriodicalId":433291,"journal":{"name":"2009 International Conference on Networks Security, Wireless Communications and Trusted Computing","volume":"32 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":"133930594","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
扫码关注我们
求助内容：
应助结果提醒方式：