Mobile agent technologies have been widely used in distributed computing to take care of the task execution for the user. However, pervasive computing presents new challenges to existing mobile agent systems, especially the need for the context-aware self-configuring collaboration with the services provided by the physical objects. In order to address the problem, this paper presents a self-configuring personal agent platform to enable a mobile agent to adapt to the on-demand collaboration with the services. The platform consists of a Ubiquitous Intelligent Object (UIO) model the pervasive computing environment modeling, a code repository to provide executable codes which can be downloaded and instantiated as a mobile agent's capability at runtime, a service registry server for UIOs to publish and subscribe services, and personal agents, one for each individual user. A prototype of platform has been implemented as proof-of-concept and a preliminary performance study has also been carried out on it using a case study.
{"title":"A Self-configuring Personal Agent Platform for Pervasive Computing","authors":"Yuhong Feng, Jiannong Cao, Ivan Lau, Xuan Liu","doi":"10.1109/EUC.2008.163","DOIUrl":"https://doi.org/10.1109/EUC.2008.163","url":null,"abstract":"Mobile agent technologies have been widely used in distributed computing to take care of the task execution for the user. However, pervasive computing presents new challenges to existing mobile agent systems, especially the need for the context-aware self-configuring collaboration with the services provided by the physical objects. In order to address the problem, this paper presents a self-configuring personal agent platform to enable a mobile agent to adapt to the on-demand collaboration with the services. The platform consists of a Ubiquitous Intelligent Object (UIO) model the pervasive computing environment modeling, a code repository to provide executable codes which can be downloaded and instantiated as a mobile agent's capability at runtime, a service registry server for UIOs to publish and subscribe services, and personal agents, one for each individual user. A prototype of platform has been implemented as proof-of-concept and a preliminary performance study has also been carried out on it using a case study.","PeriodicalId":430277,"journal":{"name":"2008 IEEE/IFIP International Conference on Embedded and Ubiquitous Computing","volume":"35 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":"123287485","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 describes about underwater data transmission simulator. Analysis procedures for various underwater environments and other factors were analyzed. A new simulator based on the analysis results was implemented and performance evaluations were conducted using the developed simulator considering various ack techniques into account.
{"title":"Omnet++ Based Simulation for Underwater Environment","authors":"S. Shin, Soo-Hyun Park","doi":"10.1109/EUC.2008.34","DOIUrl":"https://doi.org/10.1109/EUC.2008.34","url":null,"abstract":"This paper describes about underwater data transmission simulator. Analysis procedures for various underwater environments and other factors were analyzed. A new simulator based on the analysis results was implemented and performance evaluations were conducted using the developed simulator considering various ack techniques into account.","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":"129448819","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}
We present Pool-Based APROB Channel, based on pool mix model, to provide anonymity against global active adversary. The adversary has capability to monitor all external activities of system, to delay and to create messages in the system. Our proposal is to solve the limitation of APROB Channel which concerns only global delaying adversary. Pool-Based APROB Channel provides flexibility for users to justify their level of anonymity (and speed) and satisfies probabilistic real-time condition which ensures to deliver any message within a predefined duration with high probability. Experimental evaluation shows that our system provides lower source-hiding property than APROB Channel with the same environment and users' behaviors (rate and number of sent messages).
{"title":"Pool-Based APROB Channel to Provide Resistance against Global Active Adversary under Probabilistic Real-Time Condition","authors":"Minh Tran, Trung-Thanh Nguyen, I. Echizen","doi":"10.1109/EUC.2008.110","DOIUrl":"https://doi.org/10.1109/EUC.2008.110","url":null,"abstract":"We present Pool-Based APROB Channel, based on pool mix model, to provide anonymity against global active adversary. The adversary has capability to monitor all external activities of system, to delay and to create messages in the system. Our proposal is to solve the limitation of APROB Channel which concerns only global delaying adversary. Pool-Based APROB Channel provides flexibility for users to justify their level of anonymity (and speed) and satisfies probabilistic real-time condition which ensures to deliver any message within a predefined duration with high probability. Experimental evaluation shows that our system provides lower source-hiding property than APROB Channel with the same environment and users' behaviors (rate and number of sent messages).","PeriodicalId":430277,"journal":{"name":"2008 IEEE/IFIP International Conference on Embedded and Ubiquitous Computing","volume":"3 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":"125550505","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 raises and discusses a completely new challenge in the age of ubiquitous computing: how to test and debug a computing system running continuously and persistently? The ultimate goal of ubiquitous computing is to provide users with the way of computing anytime and anywhere. A necessary condition and/or fundamental assumption to underlie ubiquitous computing are that there certainly are computing systems working anytime available anywhere throughout the physical world. Therefore, ubiquitous computing must lead to requiring that computing systems can run continuously and persistently without stopping. However, all the existing testing and debugging techniques take programs of a system rather than the running system itself as the objects and/or targets, and assume that any program can be executed repeatedly with various input data only for testing and debugging without regard to stopping the task that program has to perform. In order to develop, use, and maintain persistent computing systems, we have to find a completely new methodology and its related techniques to test and debug a persistent computing system at run-time without stopping it. This is a completely new challenge in ubiquitous computing.
{"title":"Testing and Debugging Persistent Computing Systems: A New Challenge in Ubiquitous Computing","authors":"Jingde Cheng","doi":"10.1109/EUC.2008.173","DOIUrl":"https://doi.org/10.1109/EUC.2008.173","url":null,"abstract":"This paper raises and discusses a completely new challenge in the age of ubiquitous computing: how to test and debug a computing system running continuously and persistently? The ultimate goal of ubiquitous computing is to provide users with the way of computing anytime and anywhere. A necessary condition and/or fundamental assumption to underlie ubiquitous computing are that there certainly are computing systems working anytime available anywhere throughout the physical world. Therefore, ubiquitous computing must lead to requiring that computing systems can run continuously and persistently without stopping. However, all the existing testing and debugging techniques take programs of a system rather than the running system itself as the objects and/or targets, and assume that any program can be executed repeatedly with various input data only for testing and debugging without regard to stopping the task that program has to perform. In order to develop, use, and maintain persistent computing systems, we have to find a completely new methodology and its related techniques to test and debug a persistent computing system at run-time without stopping it. This is a completely new challenge in ubiquitous computing.","PeriodicalId":430277,"journal":{"name":"2008 IEEE/IFIP International Conference on Embedded and Ubiquitous Computing","volume":"104 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":"117204043","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 main contribution of this paper is to present hardware algorithms for redundant radix-2r number system in the FPGA to accelerate Montgomery modulo multiplication with many bits, which have applications in security systems such as RSA encryption and decryption. Quite surprisingly, our hardware algorithm for Montgomery modulo multiplication of two dr-bit numbers can be completed in only d+1 clock cycles. Since most FPGAs have 18-bit multipliers and 18 k-bit block RAMs, it makes sense to let r=16. Our hardware algorithm for Montgomery modulo multiplication for 256-bit numbers runs only 17 clock cycles using redundant radix-64 k (i.e.radix-216) number system. The experimental results for Xilinx Virtex-II Pro Family FPGA XC2VP100-6 show that the clock frequency of our circuit is independent of d. Further, the hardware algorithm for 1024-bit Montgomery modulo multiplication using the redundant number system is 3 times faster than that using the conventional number system. Also, for 256-bit Montgomery modulo multiplication, our hardware algorithm runs in 0.322 mus, while a previously known implementation runs in 1.22 mus although our implementation uses less than a half slices.
{"title":"Accelerating Montgomery Modulo Multiplication for Redundant Radix-64k Number System on the FPGA Using Dual-Port Block RAMs","authors":"K. Shigemoto, K. Kawakami, K. Nakano","doi":"10.1109/EUC.2008.30","DOIUrl":"https://doi.org/10.1109/EUC.2008.30","url":null,"abstract":"The main contribution of this paper is to present hardware algorithms for redundant radix-2r number system in the FPGA to accelerate Montgomery modulo multiplication with many bits, which have applications in security systems such as RSA encryption and decryption. Quite surprisingly, our hardware algorithm for Montgomery modulo multiplication of two dr-bit numbers can be completed in only d+1 clock cycles. Since most FPGAs have 18-bit multipliers and 18 k-bit block RAMs, it makes sense to let r=16. Our hardware algorithm for Montgomery modulo multiplication for 256-bit numbers runs only 17 clock cycles using redundant radix-64 k (i.e.radix-216) number system. The experimental results for Xilinx Virtex-II Pro Family FPGA XC2VP100-6 show that the clock frequency of our circuit is independent of d. Further, the hardware algorithm for 1024-bit Montgomery modulo multiplication using the redundant number system is 3 times faster than that using the conventional number system. Also, for 256-bit Montgomery modulo multiplication, our hardware algorithm runs in 0.322 mus, while a previously known implementation runs in 1.22 mus although our implementation uses less than a half slices.","PeriodicalId":430277,"journal":{"name":"2008 IEEE/IFIP International Conference on Embedded and Ubiquitous Computing","volume":"63 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":"122476904","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 rule-based localization methods proposed in this paper are based on two important observations. First, although the absolute RSS values change with time, the relative RSS (RRSS) values between several Access Points (APs) are more stable than the absolute RSSs. Thus, we can use RRSSs as rules for inferring a client's location. Second, when a unique location cannot be obtained based on RRSS rules, the localization process can backtrack to the previous observed client location. By analyzing the accessible paths on the floor plan, locations that are not reacheable from the previous location can be disqualified. Based on these two key observations, we propose several localization methods, implement them in a life environment and conduct extensive experiments to measure the localization accuracy of the proposed methods. We found that our methods achieve much higher accuracy than the state-of-the-art localization methods, namely, RADAR, LOCADIO and WHAM!.
{"title":"Rule-Based WiFi Localization Methods","authors":"Qiuxia Chen, Lee, Wang-Chien Lee","doi":"10.1109/EUC.2008.51","DOIUrl":"https://doi.org/10.1109/EUC.2008.51","url":null,"abstract":"The rule-based localization methods proposed in this paper are based on two important observations. First, although the absolute RSS values change with time, the relative RSS (RRSS) values between several Access Points (APs) are more stable than the absolute RSSs. Thus, we can use RRSSs as rules for inferring a client's location. Second, when a unique location cannot be obtained based on RRSS rules, the localization process can backtrack to the previous observed client location. By analyzing the accessible paths on the floor plan, locations that are not reacheable from the previous location can be disqualified. Based on these two key observations, we propose several localization methods, implement them in a life environment and conduct extensive experiments to measure the localization accuracy of the proposed methods. We found that our methods achieve much higher accuracy than the state-of-the-art localization methods, namely, RADAR, LOCADIO and WHAM!.","PeriodicalId":430277,"journal":{"name":"2008 IEEE/IFIP International Conference on Embedded and Ubiquitous Computing","volume":"219 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":"116112595","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}
Rong-Jhang Liao, Pei-Lun Suei, Yung-Feng Lu, Tei-Wei Kuo, Chun-Sho Lee
A large-scaled RFID application often needs a highly efficient database system in data processing. This research is motivated by the strong demand of an efficient index structure design for main-memory database systems of RFID applications. In this paper, a signature-based grid index structure is proposed for efficient data queries and storage. An efficient methodology is proposed to locate duplicates and to execute batch deletions and range queries based on application domain knowhow. The capability of the design is implemented in an open source main-memory database system H2 and evaluated by realistic workloads of RFID applications.
{"title":"A Signature-based Grid Index Design for RFID Main-Memory Databases","authors":"Rong-Jhang Liao, Pei-Lun Suei, Yung-Feng Lu, Tei-Wei Kuo, Chun-Sho Lee","doi":"10.1109/EUC.2008.105","DOIUrl":"https://doi.org/10.1109/EUC.2008.105","url":null,"abstract":"A large-scaled RFID application often needs a highly efficient database system in data processing. This research is motivated by the strong demand of an efficient index structure design for main-memory database systems of RFID applications. In this paper, a signature-based grid index structure is proposed for efficient data queries and storage. An efficient methodology is proposed to locate duplicates and to execute batch deletions and range queries based on application domain knowhow. The capability of the design is implemented in an open source main-memory database system H2 and evaluated by realistic workloads of RFID applications.","PeriodicalId":430277,"journal":{"name":"2008 IEEE/IFIP International Conference on Embedded and Ubiquitous Computing","volume":"7 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":"127456930","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}
With its growth and wide applications, virtualization has come through a revival in computer system community. Virtualization offers a lot of benefits including flexibility, security, ease to configuration and management, reduction of cost and so forth, but at the same time it also brings a certain degree of performance overhead. Furthermore, virtual machine monitor (VMM) is the core component of virtual machine (VM) system and its effectiveness greatly impacts the performance of whole system. In this paper, we measure and analyze the performance of two open source virtual machine monitors-Xen and KVM using LINPACK, LMbench and IOzone, and provide a quantitative and qualitative comparison of both virtual machine monitors.
{"title":"Performance Measuring and Comparing of Virtual Machine Monitors","authors":"Jianhua Che, Qinming He, Qinghua Gao, Dawei Huang","doi":"10.1109/EUC.2008.127","DOIUrl":"https://doi.org/10.1109/EUC.2008.127","url":null,"abstract":"With its growth and wide applications, virtualization has come through a revival in computer system community. Virtualization offers a lot of benefits including flexibility, security, ease to configuration and management, reduction of cost and so forth, but at the same time it also brings a certain degree of performance overhead. Furthermore, virtual machine monitor (VMM) is the core component of virtual machine (VM) system and its effectiveness greatly impacts the performance of whole system. In this paper, we measure and analyze the performance of two open source virtual machine monitors-Xen and KVM using LINPACK, LMbench and IOzone, and provide a quantitative and qualitative comparison of both virtual machine monitors.","PeriodicalId":430277,"journal":{"name":"2008 IEEE/IFIP International Conference on Embedded and Ubiquitous Computing","volume":"8 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":"125184037","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}
Yanbin Peng, B. Liao, Ji Gao, Jun Hu, CunHao Wang, Jie-Qing Ai, Hang Guo
In order to enable the individual agents to be aware of the both macro constraints from agent social and instructions from agent's owner, a norm and policy extended agent BDI model (called NPCD-Agent) has been proposed, by integrating norms and policies into traditional agent BDI model. On the basis of NPCD-Agent model, this paper proposes a semantic model of multi-agent system (called MASNP), where cooperative problem solving (CPS) process is formally described. On the one hand, at the social level, the social constraint of agents can be specified by means of norms defined by the social administrators. And on the other hand, agents are instructed by polices presented by their owners. A case study shows that macro social constraint and instruction from agent's owner are both considered in CPS process, which makes the CPS process more reasonable.
{"title":"Cooperative Problem Solving Process Based on MAS_NP Model","authors":"Yanbin Peng, B. Liao, Ji Gao, Jun Hu, CunHao Wang, Jie-Qing Ai, Hang Guo","doi":"10.1109/EUC.2008.109","DOIUrl":"https://doi.org/10.1109/EUC.2008.109","url":null,"abstract":"In order to enable the individual agents to be aware of the both macro constraints from agent social and instructions from agent's owner, a norm and policy extended agent BDI model (called NPCD-Agent) has been proposed, by integrating norms and policies into traditional agent BDI model. On the basis of NPCD-Agent model, this paper proposes a semantic model of multi-agent system (called MASNP), where cooperative problem solving (CPS) process is formally described. On the one hand, at the social level, the social constraint of agents can be specified by means of norms defined by the social administrators. And on the other hand, agents are instructed by polices presented by their owners. A case study shows that macro social constraint and instruction from agent's owner are both considered in CPS process, which makes the CPS process more reasonable.","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":"134010319","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}
Won-Hee Han, Sung-Won Kim, Sun-Mi Park, Chang-Wu Lee, J. Park, Y. Jeong
This paper designs LS-ware (Large-Scale USN middleware) in order to collect and save large-scale sensing data and to analyze collected data and run status sensing function. LS-ware not only provides USN middlewarepsilas basic function such as Meta information, quality process, or status management, but also makes large-scale sensing data light-weighted and provides a suitable event processing feature. LS-ware develops and utilizes a four level scheduling algorithm for continuous large-scale sensing data collection. In order to manage sensing data more effectively, it parses data packet structure, extracts information, and looses datapsilas weight. It recognizes an event from light weighted sensing data, and sends the status information to a client.
{"title":"Large-Scale USN Middleware Based on Context-Aware","authors":"Won-Hee Han, Sung-Won Kim, Sun-Mi Park, Chang-Wu Lee, J. Park, Y. Jeong","doi":"10.1109/EUC.2008.211","DOIUrl":"https://doi.org/10.1109/EUC.2008.211","url":null,"abstract":"This paper designs LS-ware (Large-Scale USN middleware) in order to collect and save large-scale sensing data and to analyze collected data and run status sensing function. LS-ware not only provides USN middlewarepsilas basic function such as Meta information, quality process, or status management, but also makes large-scale sensing data light-weighted and provides a suitable event processing feature. LS-ware develops and utilizes a four level scheduling algorithm for continuous large-scale sensing data collection. In order to manage sensing data more effectively, it parses data packet structure, extracts information, and looses datapsilas weight. It recognizes an event from light weighted sensing data, and sends the status information to a client.","PeriodicalId":430277,"journal":{"name":"2008 IEEE/IFIP International Conference on Embedded and Ubiquitous Computing","volume":"18 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":"131294256","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
扫码关注我们
求助内容：
应助结果提醒方式：