With the great progress of information technologies, computers are embedded into everywhere to make our daily life convenient, efficient and invisible. In order to utilize this progress for learning, a scheduler system, a Ubiquitous Learning System (ULS) was proposed. ULS contributes a lot to improve studentpsilas learning efficiency. Yet improvement can still be made to the system by using sensor networks. In our new design, we embed various kinds of sensors, like temperature sensor, oxygen sensor, light sensor, into the environment. Based on the information collected by such sensors, decisions can be made by the control center to adjust the environment automatically for learner. Our research result reveals that the improved ULS not only benefited learners to acquire their learning habits but also improve their learning efficiency.
{"title":"An Improved Design of the Ubiquitous Learning System Based on Sensor Networks","authors":"M. Dong, Gongwei Zhang, K. Ota, Song Guo, M. Guo","doi":"10.1109/EUC.2008.169","DOIUrl":"https://doi.org/10.1109/EUC.2008.169","url":null,"abstract":"With the great progress of information technologies, computers are embedded into everywhere to make our daily life convenient, efficient and invisible. In order to utilize this progress for learning, a scheduler system, a Ubiquitous Learning System (ULS) was proposed. ULS contributes a lot to improve studentpsilas learning efficiency. Yet improvement can still be made to the system by using sensor networks. In our new design, we embed various kinds of sensors, like temperature sensor, oxygen sensor, light sensor, into the environment. Based on the information collected by such sensors, decisions can be made by the control center to adjust the environment automatically for learner. Our research result reveals that the improved ULS not only benefited learners to acquire their learning habits but also improve their learning efficiency.","PeriodicalId":430277,"journal":{"name":"2008 IEEE/IFIP International Conference on Embedded and Ubiquitous Computing","volume":"2 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":"125121968","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 sensor networks are designed for outdoor environment surveillance and require benign coverage, steady working status and long lifetime, moreover, they require efficient security services for rigorous applications. Most security schemes are designed to work efficiently only when bidirectional links exist. So do most key establishment protocols for WSNs. Traditional key establishment schemes delete all the unidirectional links from the network. Hence, the sensors covered only by unidirectional links are excluded from the collaborating network, even if they are stable and energetic. These schemes shorten the lifetime and decrease the connectivity of the whole network. To improve the network connectivity and increase the number of available sensors in the network, a security mechanism is proposed for wireless sensor networks exploiting unidirectional links. By searching local connection components in a small area, this mechanism helps negotiate shared secrets among nodes that may covered by unidirectional links. It obtains identity authentication and perfect resilience against node compromise.The simulation reveals that, our scheme can greatly increase the proportion of available sensor nodes and network connectivity, which will efficiently prolong the network lifetime.
{"title":"Reliable Key Establishment Scheme Exploiting Unidirectional Links in Wireless Sensor Networks","authors":"Yuanyuan Zhang, Dawu Gu, B. Preneel","doi":"10.1109/EUC.2008.10","DOIUrl":"https://doi.org/10.1109/EUC.2008.10","url":null,"abstract":"Wireless sensor networks are designed for outdoor environment surveillance and require benign coverage, steady working status and long lifetime, moreover, they require efficient security services for rigorous applications. Most security schemes are designed to work efficiently only when bidirectional links exist. So do most key establishment protocols for WSNs. Traditional key establishment schemes delete all the unidirectional links from the network. Hence, the sensors covered only by unidirectional links are excluded from the collaborating network, even if they are stable and energetic. These schemes shorten the lifetime and decrease the connectivity of the whole network. To improve the network connectivity and increase the number of available sensors in the network, a security mechanism is proposed for wireless sensor networks exploiting unidirectional links. By searching local connection components in a small area, this mechanism helps negotiate shared secrets among nodes that may covered by unidirectional links. It obtains identity authentication and perfect resilience against node compromise.The simulation reveals that, our scheme can greatly increase the proportion of available sensor nodes and network connectivity, which will efficiently prolong the network lifetime.","PeriodicalId":430277,"journal":{"name":"2008 IEEE/IFIP International Conference on Embedded and Ubiquitous Computing","volume":"30 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":"125551604","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 generalized dynamic energy performance scaling (DEPS) framework is proposed for exploring application-specific energy-saving potential in hard real-time embedded systems. This software-centric framework focuses on system-wide energy reduction and takes advantage of possible power control mechanisms to trade off performance for energy savings. Three existing technologies, i.e., dynamic hardware resource configuration (DHRC), dynamic voltage frequency scaling (DVFS), and dynamic power management (DPM) have been employed in this framework to achieve the maximal energy savings. Static and dynamic schemes of DEPS are proposed to deal with stable or variable workload in the embedded systems. Through a case study, its effectiveness has been validated.
{"title":"A Generalized Framework for System-Wide Energy Savings in Hard Real-Time Embedded Systems","authors":"Gang Zeng, H. Tomiyama, H. Takada, T. Ishihara","doi":"10.1109/EUC.2008.101","DOIUrl":"https://doi.org/10.1109/EUC.2008.101","url":null,"abstract":"A generalized dynamic energy performance scaling (DEPS) framework is proposed for exploring application-specific energy-saving potential in hard real-time embedded systems. This software-centric framework focuses on system-wide energy reduction and takes advantage of possible power control mechanisms to trade off performance for energy savings. Three existing technologies, i.e., dynamic hardware resource configuration (DHRC), dynamic voltage frequency scaling (DVFS), and dynamic power management (DPM) have been employed in this framework to achieve the maximal energy savings. Static and dynamic schemes of DEPS are proposed to deal with stable or variable workload in the embedded systems. Through a case study, its effectiveness has been validated.","PeriodicalId":430277,"journal":{"name":"2008 IEEE/IFIP International Conference on Embedded and Ubiquitous Computing","volume":"1 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":"129226085","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}
Service discovery, an essential building block of nomadic and ubiquitous computing applications, needs to be secured to be effectively deployed. Centralized and decentralized approaches have been proposed to this end. This paper analyzes the application layer secure matching function using a Markovian performance model in order to analyze the effects of DoS attacks in centralized and decentralized service discovery systems and to assess anti-clogging mechanisms as a protection against such attacks. This study highlights the determinant parameters that should be evaluated for ensuring a scalable and secure service discovery deployment.
{"title":"On the Impact of DoS Attacks on Secure Service Discovery","authors":"S. Trabelsi, G. Urvoy-Keller, Y. Roudier","doi":"10.1109/EUC.2008.182","DOIUrl":"https://doi.org/10.1109/EUC.2008.182","url":null,"abstract":"Service discovery, an essential building block of nomadic and ubiquitous computing applications, needs to be secured to be effectively deployed. Centralized and decentralized approaches have been proposed to this end. This paper analyzes the application layer secure matching function using a Markovian performance model in order to analyze the effects of DoS attacks in centralized and decentralized service discovery systems and to assess anti-clogging mechanisms as a protection against such attacks. This study highlights the determinant parameters that should be evaluated for ensuring a scalable and secure service discovery deployment.","PeriodicalId":430277,"journal":{"name":"2008 IEEE/IFIP International Conference on Embedded and Ubiquitous Computing","volume":"13 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":"130890964","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}
F. Tang, M. Guo, Minglu Li, Zhijun Wang, Zixue Cheng
Routing is an important issue in any type of networks. Multiple-hop based routing in sensor networks suffer performance downgrade from too many hops with the increase of the size of sensor nodes, as well as various attacks. A number of approaches have been proposed for routing in sensor networks, but they lack of sufficient support for secure routing in large-scale sensor networks. In this paper, we propose a scalable and secure routing protocol that can work energy-efficiently and resist most of attacks. By hierarchical and long-distance mesh routing, our protocol significantly reduces average number of hops for data transmission. Lightweight security mechanism enables the routing protocol to survive from most attacks against sensor networks.
{"title":"Scalable and Secure Routing for Large-Scale Sensor Networks","authors":"F. Tang, M. Guo, Minglu Li, Zhijun Wang, Zixue Cheng","doi":"10.1109/EUC.2008.47","DOIUrl":"https://doi.org/10.1109/EUC.2008.47","url":null,"abstract":"Routing is an important issue in any type of networks. Multiple-hop based routing in sensor networks suffer performance downgrade from too many hops with the increase of the size of sensor nodes, as well as various attacks. A number of approaches have been proposed for routing in sensor networks, but they lack of sufficient support for secure routing in large-scale sensor networks. In this paper, we propose a scalable and secure routing protocol that can work energy-efficiently and resist most of attacks. By hierarchical and long-distance mesh routing, our protocol significantly reduces average number of hops for data transmission. Lightweight security mechanism enables the routing protocol to survive from most attacks against sensor networks.","PeriodicalId":430277,"journal":{"name":"2008 IEEE/IFIP International Conference on Embedded and Ubiquitous Computing","volume":"126 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":"128856178","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 DHT based P2P networks, the heterogeneity of node capacity and the skewness in query pattern could result in lookup load imbalance. Indegree adjustment is an effective, light-weighted and heterogeneity-aware approach to balance lookup traffic in local area, but not globally. In this paper we present a hybrid algorithm combining in degree adjustment and virtual server (VS) approaches to address both local and global lookup imbalance in DHT networks. We divide local nodes into zones, and select strong nodes to form a virtual server group (VSG). Hot zones can apply for virtual servers from VSG in order to distribute load in system wide. Nodes and VSs in the zones use indegree adjustment to maintain zone balance. We can therefore significantly improve the load balancing of traffic in these systems, and consequently their performance.Results from experimental evaluation demonstrate the effectiveness of our approach.
{"title":"Adaptive Load Balancing for Lookups in Heterogeneous DHT","authors":"Zhi Chen, Guowei Huang, Jingdong Xu, Yang Yang","doi":"10.1109/EUC.2008.153","DOIUrl":"https://doi.org/10.1109/EUC.2008.153","url":null,"abstract":"In DHT based P2P networks, the heterogeneity of node capacity and the skewness in query pattern could result in lookup load imbalance. Indegree adjustment is an effective, light-weighted and heterogeneity-aware approach to balance lookup traffic in local area, but not globally. In this paper we present a hybrid algorithm combining in degree adjustment and virtual server (VS) approaches to address both local and global lookup imbalance in DHT networks. We divide local nodes into zones, and select strong nodes to form a virtual server group (VSG). Hot zones can apply for virtual servers from VSG in order to distribute load in system wide. Nodes and VSs in the zones use indegree adjustment to maintain zone balance. We can therefore significantly improve the load balancing of traffic in these systems, and consequently their performance.Results from experimental evaluation demonstrate the effectiveness of our approach.","PeriodicalId":430277,"journal":{"name":"2008 IEEE/IFIP International Conference on Embedded and Ubiquitous Computing","volume":"42 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":"126861788","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 mobile device that a user carries around usually contains data private to the user but has restricted human-device interaction capabilities. There is, however, no lack of stationary computers, or kiosks, with rich computing and user interaction resources in a userpsilas typical surrounding environment. Security is a concern when integrating a mobile device with an environment kiosk. In particular, the mobile user needs to be assured that the environment kiosk that he is using does not contain malicious code that may exploit his sensitive data on device, and that such sensitive data will not be left on the kiosk for attackers to exploit. In this paper, we present an OS-agnostic approach for trustworthy and secure kiosk computing. Our approach supports secure user session initiation, strong session isolation and quick session startup, and mitigates a number of security threats such as man-in-the-middle attack, session stealing attack, and keyboard tampering attack.
{"title":"Towards Trustworthy and Secure Kiosk Computing for Mobile Users","authors":"Dong Zhou, H. Inamura","doi":"10.1109/EUC.2008.170","DOIUrl":"https://doi.org/10.1109/EUC.2008.170","url":null,"abstract":"A mobile device that a user carries around usually contains data private to the user but has restricted human-device interaction capabilities. There is, however, no lack of stationary computers, or kiosks, with rich computing and user interaction resources in a userpsilas typical surrounding environment. Security is a concern when integrating a mobile device with an environment kiosk. In particular, the mobile user needs to be assured that the environment kiosk that he is using does not contain malicious code that may exploit his sensitive data on device, and that such sensitive data will not be left on the kiosk for attackers to exploit. In this paper, we present an OS-agnostic approach for trustworthy and secure kiosk computing. Our approach supports secure user session initiation, strong session isolation and quick session startup, and mitigates a number of security threats such as man-in-the-middle attack, session stealing attack, and keyboard tampering attack.","PeriodicalId":430277,"journal":{"name":"2008 IEEE/IFIP International Conference on Embedded and Ubiquitous Computing","volume":"41 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":"126338823","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}
Yu Huang, X. Ma, Xianping Tao, Jiannong Cao, Jian Lu
Context-awareness is a key issue in pervasive computing. Context-aware applications are prone to the context consistency problem, where applications are confronted with conflicting contexts and cannot decide how to adapt themselves. In pervasive computing environments, users are often willing to accept certain degree of context inconsistency, as long as it can reduce the consistency maintenance cost, e.g., query delay and battery power. However, existing consistency maintenance schemes do not enable the users to make such tradeoffs. To this end, we propose the probabilistic consistency checking for pervasive context (PCCPC) algorithm. Detailed performance analysis shows that PCCPC enables the users to check consistency over arbitrarily specified ratio of context. We also conduct experiments to study the cost reduced by probabilistic checking. The analytical and the experimental results show that PCCPC enables the users to efficiently make tradeoffs between context consistency and the associated checking cost.
{"title":"A Probabilistic Approach to Consistency Checking for Pervasive Context","authors":"Yu Huang, X. Ma, Xianping Tao, Jiannong Cao, Jian Lu","doi":"10.1109/EUC.2008.129","DOIUrl":"https://doi.org/10.1109/EUC.2008.129","url":null,"abstract":"Context-awareness is a key issue in pervasive computing. Context-aware applications are prone to the context consistency problem, where applications are confronted with conflicting contexts and cannot decide how to adapt themselves. In pervasive computing environments, users are often willing to accept certain degree of context inconsistency, as long as it can reduce the consistency maintenance cost, e.g., query delay and battery power. However, existing consistency maintenance schemes do not enable the users to make such tradeoffs. To this end, we propose the probabilistic consistency checking for pervasive context (PCCPC) algorithm. Detailed performance analysis shows that PCCPC enables the users to check consistency over arbitrarily specified ratio of context. We also conduct experiments to study the cost reduced by probabilistic checking. The analytical and the experimental results show that PCCPC enables the users to efficiently make tradeoffs between context consistency and the associated checking cost.","PeriodicalId":430277,"journal":{"name":"2008 IEEE/IFIP International Conference on Embedded and Ubiquitous Computing","volume":"53 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":"130341037","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}
Sparse matrix vector multiplication (SpMxV) is a core operation in many engineering, scientific and financial applications. Due to the sparse nature of the underlying matrices, irregular memory access patterns and short row lengths often slow down the performance significantly. Past implementations of SpMxV have been reported to be run at 10% or less of the machine's peak capability. In this paper we present a novel hardware support called distTree for efficient SpMxV. It is shown that replacing the column indices of sparse matrices with extra hardware is achievable and yields an average speedup by a factor of two for the suite of benchmarks used. The matrix data set for the distTree is approximately 30% less than that for conventional CSR algorithms so that distTree is beneficial in terms of not only performance but also memory usage. Thorough analysis is done by looking at the correlation between the performance speedups and various matrices properties.
{"title":"Hardware Support for Efficient Sparse Matrix Vector Multiplication","authors":"A. Ku, J.Y. Kuo, Jingling Xue","doi":"10.1109/EUC.2008.154","DOIUrl":"https://doi.org/10.1109/EUC.2008.154","url":null,"abstract":"Sparse matrix vector multiplication (SpMxV) is a core operation in many engineering, scientific and financial applications. Due to the sparse nature of the underlying matrices, irregular memory access patterns and short row lengths often slow down the performance significantly. Past implementations of SpMxV have been reported to be run at 10% or less of the machine's peak capability. In this paper we present a novel hardware support called distTree for efficient SpMxV. It is shown that replacing the column indices of sparse matrices with extra hardware is achievable and yields an average speedup by a factor of two for the suite of benchmarks used. The matrix data set for the distTree is approximately 30% less than that for conventional CSR algorithms so that distTree is beneficial in terms of not only performance but also memory usage. Thorough analysis is done by looking at the correlation between the performance speedups and various matrices properties.","PeriodicalId":430277,"journal":{"name":"2008 IEEE/IFIP International Conference on Embedded and Ubiquitous Computing","volume":"1 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":"130464458","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 EPCglobal Network is a network providing a shared view of the disposition of EPC-bearing objects between EPCglobal subscribers, within a relevant business context. In the EPCglobal Network, product data is distributed to several EPCISes(EPC Information Services) via movement of the product. The ONS (Object Naming Service) and the EPCISDS (EPCIS Discovery Service) are used to identify the distributed data for tracing the product. However, there is neither a standard scenario for access to the services when tracing the product nor a defined standard for EPCISDS. This paper suggests a novel architecture for tracing product data with EPCISDS and ONS. Our architecture provides a concrete substructure for product tracing services.
EPCglobal Network是一个网络，在相关的业务环境中，EPCglobal订户之间提供epc承载对象配置的共享视图。在EPC全球网络中，产品数据通过产品的移动分发到几个EPC信息服务(EPC Information Services)。使用ONS(对象命名服务)和EPCISDS (EPCIS发现服务)来识别分布式数据，以便跟踪产品。但是，在跟踪产品时既没有访问服务的标准场景，也没有为EPCISDS定义的标准。本文提出了一种利用EPCISDS和ONS跟踪产品数据的新体系结构。我们的体系结构为产品跟踪服务提供了具体的子结构。
{"title":"Discovery Architecture for the Tracing of Products in the EPCglobal Network","authors":"Gyeongtaek Lee, J. Shin, Dae-Won Park, H. Kwon","doi":"10.1109/EUC.2008.69","DOIUrl":"https://doi.org/10.1109/EUC.2008.69","url":null,"abstract":"The EPCglobal Network is a network providing a shared view of the disposition of EPC-bearing objects between EPCglobal subscribers, within a relevant business context. In the EPCglobal Network, product data is distributed to several EPCISes(EPC Information Services) via movement of the product. The ONS (Object Naming Service) and the EPCISDS (EPCIS Discovery Service) are used to identify the distributed data for tracing the product. However, there is neither a standard scenario for access to the services when tracing the product nor a defined standard for EPCISDS. This paper suggests a novel architecture for tracing product data with EPCISDS and ONS. Our architecture provides a concrete substructure for product tracing services.","PeriodicalId":430277,"journal":{"name":"2008 IEEE/IFIP International Conference on Embedded and Ubiquitous Computing","volume":"11 Suppl 12 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":"116693800","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
扫码关注我们
求助内容：
应助结果提醒方式：