In order to solve the transponder collision problem in a RFID system, this paper proposes a hybrid algorithm which combines strengths of existing high-performance algorithms while avoiding their major drawbacks. Experiments show this hybrid algorithm uses fewer time slots and less total communication time compared to adaptive slot-count algorithm based on ALOHA as well as enhanced anti-collision algorithm based on binary tree, both of which are superior and well accepted algorithms in literature. Meanwhile, high computational intensity of adaptive slot-count algorithm is significantly relieved, and memory consumption of enhanced anti-collision algorithm is reduced to a negligible level. Results from simulations under large number of transponders and long transponder IDs, which is the case in real RFID applications, suggest the advantage of this hybrid algorithm is prominent.
{"title":"A Hybrid Anti-Collision Algorithm for RFID with Enhanced Throughput and Reduced Memory Consumption","authors":"Majun Zheng, Jing Xie, Zhigang Mao, Yongxin Zhu","doi":"10.1109/EUC.2008.103","DOIUrl":"https://doi.org/10.1109/EUC.2008.103","url":null,"abstract":"In order to solve the transponder collision problem in a RFID system, this paper proposes a hybrid algorithm which combines strengths of existing high-performance algorithms while avoiding their major drawbacks. Experiments show this hybrid algorithm uses fewer time slots and less total communication time compared to adaptive slot-count algorithm based on ALOHA as well as enhanced anti-collision algorithm based on binary tree, both of which are superior and well accepted algorithms in literature. Meanwhile, high computational intensity of adaptive slot-count algorithm is significantly relieved, and memory consumption of enhanced anti-collision algorithm is reduced to a negligible level. Results from simulations under large number of transponders and long transponder IDs, which is the case in real RFID applications, suggest the advantage of this hybrid algorithm is prominent.","PeriodicalId":430277,"journal":{"name":"2008 IEEE/IFIP International Conference on Embedded and Ubiquitous Computing","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114832629","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}
Hyuncheol Kim, Jungha Paik, Bumhan Lee, Dong Hoon Lee
Position based routing protocols have been a great deal of attention in vehicular ad hoc networks. The routing protocols are very efficient in high mobility ad hoc network since the path to a destination can be proactively determined by location information of neighbor and destination nodes. However, this causes the leakage of the private information of drivers, such as a vehicle identifier or location information of a vehicle. Hence, providing privacy of a user should be considered in the protocol. In this paper, we design a novel routing protocol, called SARC, which provides efficient path discovery and privacy protection in route discovery and data forwarding phase. To achieve this goal we present a street-based path calculation algorithm for route discovery, and define and analyze the identity, location, and route anonymity in our protocol.
{"title":"SARC: A Street-Based Anonymous Vehicular Ad Hoc Routing Protocol for City Environment","authors":"Hyuncheol Kim, Jungha Paik, Bumhan Lee, Dong Hoon Lee","doi":"10.1109/EUC.2008.97","DOIUrl":"https://doi.org/10.1109/EUC.2008.97","url":null,"abstract":"Position based routing protocols have been a great deal of attention in vehicular ad hoc networks. The routing protocols are very efficient in high mobility ad hoc network since the path to a destination can be proactively determined by location information of neighbor and destination nodes. However, this causes the leakage of the private information of drivers, such as a vehicle identifier or location information of a vehicle. Hence, providing privacy of a user should be considered in the protocol. In this paper, we design a novel routing protocol, called SARC, which provides efficient path discovery and privacy protection in route discovery and data forwarding phase. To achieve this goal we present a street-based path calculation algorithm for route discovery, and define and analyze the identity, location, and route anonymity in our protocol.","PeriodicalId":430277,"journal":{"name":"2008 IEEE/IFIP International Conference on Embedded and Ubiquitous Computing","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127140854","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}
Available WLAN Mesh network access protocols and trusted network connect protocols can not satisfy the performance and security requirements of WLAN Mesh networks in trusted environment. A provably secure trusted access protocol MN-TAP for the WLAN Mesh Networks is proposed. Such protocol will achieve authentication and key confirmation among the access requestor, policy enforcement point and policy decision point within 4 protocol rounds. Meanwhile, the protocol can realize the platform authentication and platform integrity verification in the first round of protocol interaction, which will improve the efficiency of the protocol and decrease the overhead of the server. We use a provably secure model, named the universally composable secure model, to analyze the security of the protocol. And we use of compare analysis to discover the performance advantages of the protocol. The results show that: the protocol is a UC-secure protocol, and the performance has great advantages over the current protocols.
{"title":"Provably Secure Trusted Access Protocol for WLAN Mesh Networks","authors":"Zhuo Ma, Jianfeng Ma, Yulong Shen","doi":"10.1109/EUC.2008.144","DOIUrl":"https://doi.org/10.1109/EUC.2008.144","url":null,"abstract":"Available WLAN Mesh network access protocols and trusted network connect protocols can not satisfy the performance and security requirements of WLAN Mesh networks in trusted environment. A provably secure trusted access protocol MN-TAP for the WLAN Mesh Networks is proposed. Such protocol will achieve authentication and key confirmation among the access requestor, policy enforcement point and policy decision point within 4 protocol rounds. Meanwhile, the protocol can realize the platform authentication and platform integrity verification in the first round of protocol interaction, which will improve the efficiency of the protocol and decrease the overhead of the server. We use a provably secure model, named the universally composable secure model, to analyze the security of the protocol. And we use of compare analysis to discover the performance advantages of the protocol. The results show that: the protocol is a UC-secure protocol, and the performance has great advantages over the current protocols.","PeriodicalId":430277,"journal":{"name":"2008 IEEE/IFIP International Conference on Embedded and Ubiquitous Computing","volume":"47 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126137761","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 ability to determine the trust of an agent relative to other agents can be useful for applications that require to select a subset of trusted agents. However, in an open, distributed system, it is difficult to realize this functionality. Selecting agents on the basis of trust can be seen as an extension of the usual Trust Management service. In this paper, we propose a fully distributed method for selection of the most trusted agents. We investigate the sensitivity of this method to adversaries and propose improvements to its security. The performance of the method and the quality of the selection is studied in detail.
{"title":"Discovering the Most Trusted Agents without Central Control","authors":"Tomasz Kaszuba, K. Rządca, A. Wierzbicki","doi":"10.1109/EUC.2008.126","DOIUrl":"https://doi.org/10.1109/EUC.2008.126","url":null,"abstract":"The ability to determine the trust of an agent relative to other agents can be useful for applications that require to select a subset of trusted agents. However, in an open, distributed system, it is difficult to realize this functionality. Selecting agents on the basis of trust can be seen as an extension of the usual Trust Management service. In this paper, we propose a fully distributed method for selection of the most trusted agents. We investigate the sensitivity of this method to adversaries and propose improvements to its security. The performance of the method and the quality of the selection is studied in detail.","PeriodicalId":430277,"journal":{"name":"2008 IEEE/IFIP International Conference on Embedded and Ubiquitous Computing","volume":"56 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126525799","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}
Shenglin Gui, Lei Luo, Qian Liu, Fulei Guo, Shaopeng Lu
There is more and more the ubiquitous use of different types of real-time embedded (RTE) systems in our daily lives with rapid developments in science and technology. Because design faults might result in injury or even death to human beings who are using these systems, how to ensure the RTE systems are really safe is very important. The schedulability problem is a very important problem needs to be guaranteed in real-time software. In this paper, based on the Architecture Analysis and Design Language (AADL), we present Hybrid Automaton with Relative Time Constraints (HARTC) and Arrival Time Automaton (ATA) to abstract the semantics and external environment of each thread component in AADL respectively. Thus, we translate the schedulability problem in the system modeled by AADL into the reachability problem of locations in the product of HARTCs and ATAs. Then, we study the condition under which the reachability of HARTC is decidable. Under this condition, we develop a schedulability analysis tool called UCaS as a plug-in which can be integrated in the open source tool OSATE. We illustrate the schedulability analysis and simulation result provided by UCaS through an example. Finally, we give future directions need to be solved and our conclusion.
{"title":"UCaS: A Schedulability Analysis Tool for AADL Models","authors":"Shenglin Gui, Lei Luo, Qian Liu, Fulei Guo, Shaopeng Lu","doi":"10.1109/EUC.2008.115","DOIUrl":"https://doi.org/10.1109/EUC.2008.115","url":null,"abstract":"There is more and more the ubiquitous use of different types of real-time embedded (RTE) systems in our daily lives with rapid developments in science and technology. Because design faults might result in injury or even death to human beings who are using these systems, how to ensure the RTE systems are really safe is very important. The schedulability problem is a very important problem needs to be guaranteed in real-time software. In this paper, based on the Architecture Analysis and Design Language (AADL), we present Hybrid Automaton with Relative Time Constraints (HARTC) and Arrival Time Automaton (ATA) to abstract the semantics and external environment of each thread component in AADL respectively. Thus, we translate the schedulability problem in the system modeled by AADL into the reachability problem of locations in the product of HARTCs and ATAs. Then, we study the condition under which the reachability of HARTC is decidable. Under this condition, we develop a schedulability analysis tool called UCaS as a plug-in which can be integrated in the open source tool OSATE. We illustrate the schedulability analysis and simulation result provided by UCaS through an example. Finally, we give future directions need to be solved and our conclusion.","PeriodicalId":430277,"journal":{"name":"2008 IEEE/IFIP International Conference on Embedded and Ubiquitous Computing","volume":"43 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121936645","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 pervasive computing environments (PCE), context information can have a strong impact on application adaptation, not only at application logic level but also security management level. From a access control perspective, it is required that the access control models take into account context information such as location and time, in determining whether access should be allowed or not. As context information represents real-world situations, it is associated with certain quality indicators that can influence directly in the access control decisions. In this paper, we showed the use of context information and its quality indicators to grant and to adapt access permissions to resources in the PCE.
{"title":"Using Context Quality Indicators for Improving Context-Based Access Control in Pervasive Environments","authors":"José Bringel Filho, H. Martin","doi":"10.1109/EUC.2008.171","DOIUrl":"https://doi.org/10.1109/EUC.2008.171","url":null,"abstract":"In pervasive computing environments (PCE), context information can have a strong impact on application adaptation, not only at application logic level but also security management level. From a access control perspective, it is required that the access control models take into account context information such as location and time, in determining whether access should be allowed or not. As context information represents real-world situations, it is associated with certain quality indicators that can influence directly in the access control decisions. In this paper, we showed the use of context information and its quality indicators to grant and to adapt access permissions to resources in the PCE.","PeriodicalId":430277,"journal":{"name":"2008 IEEE/IFIP International Conference on Embedded and Ubiquitous Computing","volume":"62 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122186364","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}
Xin Chen, Huaping Hu, Bo Liu, Fengtao Xiao, Zunguo Huang
With the more emphasis paid on network security and privacy, the research on anonymous communication system has developed quickly. In the past, researchers mainly focused on how to improve the anonymity, but few focused on the usability. This paper presents an anonymity-level selected hierarchical anonymous communication framework (ALHACF). In this framework, firstly the anonymity-level is selected by users according to his requirement, and then the path length and set of relay routers will be determined by the anonymity-level. The anonymity and communication performance of ALHACF are analyzed. The analysis indicates that ALHACF inherits the merit of HLLACF, and it can prevent some kinds of attack, keep good anonymity and increase the communication performance markedly.
{"title":"ALHACF: An Anonymity-Level Selected Hierarchical Anonymous Communication Framework","authors":"Xin Chen, Huaping Hu, Bo Liu, Fengtao Xiao, Zunguo Huang","doi":"10.1109/EUC.2008.132","DOIUrl":"https://doi.org/10.1109/EUC.2008.132","url":null,"abstract":"With the more emphasis paid on network security and privacy, the research on anonymous communication system has developed quickly. In the past, researchers mainly focused on how to improve the anonymity, but few focused on the usability. This paper presents an anonymity-level selected hierarchical anonymous communication framework (ALHACF). In this framework, firstly the anonymity-level is selected by users according to his requirement, and then the path length and set of relay routers will be determined by the anonymity-level. The anonymity and communication performance of ALHACF are analyzed. The analysis indicates that ALHACF inherits the merit of HLLACF, and it can prevent some kinds of attack, keep good anonymity and increase the communication performance markedly.","PeriodicalId":430277,"journal":{"name":"2008 IEEE/IFIP International Conference on Embedded and Ubiquitous Computing","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123229972","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}
Almost all recent researches on P2P system focus on how to build a highly usable P2P overlay network. Small routing table, short query path and robustness are included into their design objectives of overlay topology. In this paper, we define a new Cayley graph and propose a novel P2P overlay network CayleyChord based on it. The new overlay network has many excellent properties such as small routing table and short query path and high clustering and robustness. Our system has simpler routing (searching) and many other excellent properties than the most former systems such as Chord and Ulysses because of its symmetry. The performance is evaluated in this paper, indicating that CayleyChord can reach low routing table size and query path length. Furthermore, the robustness of CayleyChord based on the new Cayley graph model is also better than most the P2P overlay networks recently proposed.
{"title":"CayleyChord: A Novel P2P Overlay Network","authors":"W. Xiao, Mingxin He, Wenhong Wei","doi":"10.1109/EUC.2008.141","DOIUrl":"https://doi.org/10.1109/EUC.2008.141","url":null,"abstract":"Almost all recent researches on P2P system focus on how to build a highly usable P2P overlay network. Small routing table, short query path and robustness are included into their design objectives of overlay topology. In this paper, we define a new Cayley graph and propose a novel P2P overlay network CayleyChord based on it. The new overlay network has many excellent properties such as small routing table and short query path and high clustering and robustness. Our system has simpler routing (searching) and many other excellent properties than the most former systems such as Chord and Ulysses because of its symmetry. The performance is evaluated in this paper, indicating that CayleyChord can reach low routing table size and query path length. Furthermore, the robustness of CayleyChord based on the new Cayley graph model is also better than most the P2P overlay networks recently proposed.","PeriodicalId":430277,"journal":{"name":"2008 IEEE/IFIP International Conference on Embedded and Ubiquitous Computing","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126495475","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}
Load balancing plays a key role in workload scheduling policies which count in the performance improvement of parallel applications. A critical problem of load balancing is to make a reasonable definition of load index. Unfortunately, few studies provided enough scientific justifications for the choice of load indices. In this paper, a reasonable approach for defining a load index based on factor analysis theory is introduced, which is helpful to reasonable designs of workload scheduling algorithms. An example testing on an accounting log of the CM-5 parallel machine is presented to show the usage of this method.
{"title":"A Reasonable Approach for Defining Load Index in Parallel Computing","authors":"Zhuojun Zhuang, Yuan Luo, Minglu Li, Chuliang Weng","doi":"10.1109/EUC.2008.83","DOIUrl":"https://doi.org/10.1109/EUC.2008.83","url":null,"abstract":"Load balancing plays a key role in workload scheduling policies which count in the performance improvement of parallel applications. A critical problem of load balancing is to make a reasonable definition of load index. Unfortunately, few studies provided enough scientific justifications for the choice of load indices. In this paper, a reasonable approach for defining a load index based on factor analysis theory is introduced, which is helpful to reasonable designs of workload scheduling algorithms. An example testing on an accounting log of the CM-5 parallel machine is presented to show the usage of this method.","PeriodicalId":430277,"journal":{"name":"2008 IEEE/IFIP International Conference on Embedded and Ubiquitous Computing","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131712897","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}
Wireless local area network (WLAN) standards use the wired equivalent privacy (WEP) protocol to secure wireless communication standards. WEP uses RC4 stream cipher encrypt technique. But due to the leaks of the protocol, attackers may easily wiretap and attack the network. In recent years, the experts have proposed many schemes to mend the leak of WLAN security. A powerful key management solution is a comparatively efficient method. The enhancement of security of WLAN key management scheme may improve the security of the whole WLAN system. Moreover, under the current IEEE802.11 family standard, this scheme is more practical and effective.
{"title":"An Improved Key Management Scheme for WEP","authors":"Zhang Long-jun, Zou Tao","doi":"10.1109/EUC.2008.67","DOIUrl":"https://doi.org/10.1109/EUC.2008.67","url":null,"abstract":"Wireless local area network (WLAN) standards use the wired equivalent privacy (WEP) protocol to secure wireless communication standards. WEP uses RC4 stream cipher encrypt technique. But due to the leaks of the protocol, attackers may easily wiretap and attack the network. In recent years, the experts have proposed many schemes to mend the leak of WLAN security. A powerful key management solution is a comparatively efficient method. The enhancement of security of WLAN key management scheme may improve the security of the whole WLAN system. Moreover, under the current IEEE802.11 family standard, this scheme is more practical and effective.","PeriodicalId":430277,"journal":{"name":"2008 IEEE/IFIP International Conference on Embedded and Ubiquitous Computing","volume":"56 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115112134","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
扫码关注我们
求助内容：
应助结果提醒方式：