Jingjing Xu, Yann-Hang Lee, W. Tsai, Wu Li, Young-Sung Son, Jun-Hee Park, Kyung-Duk Moon
Given the diversity of home environment, appliances, and residents, the applications for smart homes must be configurable and adaptive. Instead of programming each household, we propose an ontology-based framework to facilitate the automatic composition of appropriate applications. The system composes appropriate services depending upon the available equipments in each individual household automatically. Meanwhile, it dynamically adjusts the environment parameters to match the customer needs and to encompass the available resource. With its supporting on customized function template editing, customers are able to specify their usual behavior templates as different mode.
{"title":"Ontology-Based Smart Home Solution and Service Composition","authors":"Jingjing Xu, Yann-Hang Lee, W. Tsai, Wu Li, Young-Sung Son, Jun-Hee Park, Kyung-Duk Moon","doi":"10.1109/ICESS.2009.60","DOIUrl":"https://doi.org/10.1109/ICESS.2009.60","url":null,"abstract":"Given the diversity of home environment, appliances, and residents, the applications for smart homes must be configurable and adaptive. Instead of programming each household, we propose an ontology-based framework to facilitate the automatic composition of appropriate applications. The system composes appropriate services depending upon the available equipments in each individual household automatically. Meanwhile, it dynamically adjusts the environment parameters to match the customer needs and to encompass the available resource. With its supporting on customized function template editing, customers are able to specify their usual behavior templates as different mode.","PeriodicalId":335217,"journal":{"name":"2009 International Conference on Embedded Software and Systems","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-05-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125833927","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}
Flooding Time Synchronization Protocol (FTSP) is an extendable, robust and steady protocol, which has high synchronization precision in wireless sensor networks. This paper improves the traditional FTSP, according to the characteristics of industrial wireless sensor networks. The key idea is that the node should avoid transmitting the time synchronization message with the rootID and seqNum, which are the same as the ones in the previous transmitted time synchronization message. Simulation result indicates that in an 8-hop network containing 81 Mica2 sensor nodes, our improved FTSP solves the problem in a reelection process. It can reduce the totals of sent and received frames by 20% comparing with the traditional FTSP, while saving the battery power of the sensor nodes and making network persist with synchronization as long as possible.
{"title":"An Improved Flooding Time Synchronization Protocol for Industrial Wireless Networks","authors":"Na Xu, Xiaotong Zhang, Qin Wang, Jing Liang, Guangrong Pan, Meng Zhang","doi":"10.1109/ICESS.2009.10","DOIUrl":"https://doi.org/10.1109/ICESS.2009.10","url":null,"abstract":"Flooding Time Synchronization Protocol (FTSP) is an extendable, robust and steady protocol, which has high synchronization precision in wireless sensor networks. This paper improves the traditional FTSP, according to the characteristics of industrial wireless sensor networks. The key idea is that the node should avoid transmitting the time synchronization message with the rootID and seqNum, which are the same as the ones in the previous transmitted time synchronization message. Simulation result indicates that in an 8-hop network containing 81 Mica2 sensor nodes, our improved FTSP solves the problem in a reelection process. It can reduce the totals of sent and received frames by 20% comparing with the traditional FTSP, while saving the battery power of the sensor nodes and making network persist with synchronization as long as possible.","PeriodicalId":335217,"journal":{"name":"2009 International Conference on Embedded Software and Systems","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-05-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115051157","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}
L. Cordeiro, B. Fischer, Huan Chen, Joao Marques-Silva
In recent days, the complexity of software has increased significantly in embedded products in such a way that the verification of Embedded Software (ESW) now plays an important role to ensure the product's quality. Embedded systems engineers usually face the problems of verifying properties that have to meet the application's deadline, access the memory region, handle concurrency, and control the hardware registers. This work proposes a semiformal verification approach that combines dynamic and static verification to stress and cover exhaustively the state space of the system. We perform a case study on embedded software used in the medical devices domain. We conclude that the proposed approach improves the coverage and reduces substantially the verification time.
{"title":"Semiformal Verification of Embedded Software in Medical Devices Considering Stringent Hardware Constraints","authors":"L. Cordeiro, B. Fischer, Huan Chen, Joao Marques-Silva","doi":"10.1109/ICESS.2009.82","DOIUrl":"https://doi.org/10.1109/ICESS.2009.82","url":null,"abstract":"In recent days, the complexity of software has increased significantly in embedded products in such a way that the verification of Embedded Software (ESW) now plays an important role to ensure the product's quality. Embedded systems engineers usually face the problems of verifying properties that have to meet the application's deadline, access the memory region, handle concurrency, and control the hardware registers. This work proposes a semiformal verification approach that combines dynamic and static verification to stress and cover exhaustively the state space of the system. We perform a case study on embedded software used in the medical devices domain. We conclude that the proposed approach improves the coverage and reduces substantially the verification time.","PeriodicalId":335217,"journal":{"name":"2009 International Conference on Embedded Software and Systems","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-05-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116021733","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}
Ruihua Zhang, Zhiping Jia, Heyou Cheng, Xin Li, Dongcheng Han
Due to the limited transmission range, data sensed by each sensor has to be forwarded in a multi-hop fashion before being delivered to the sink. The sensors closer to the sink have to forward comparatively more message than sensors at the periphery of the network¿the nodes will deplete their batteries earlier. Besides the loss of the sensing capabilities of the nodes close to the sink, a more serious consequence of the death of the first tier of sensor nodes is the loss of connectivity between the nodes at the periphery of the network and the sink. It makes the wireless networks expire. To alleviate this undesired effect, we adopt two improved schemes. The first one is to redistribute the total energy budget with data traffic load; the second one is to balance the uneven traffic by power control method. They maximize the useful lifetime of the network. We show by theoretical analysis, as well as simulation, that they substantially improve the network lifetime.
{"title":"The Improved Scheme of Prolong-Lifetime in Wireless Sensor Networks","authors":"Ruihua Zhang, Zhiping Jia, Heyou Cheng, Xin Li, Dongcheng Han","doi":"10.1109/ICESS.2009.32","DOIUrl":"https://doi.org/10.1109/ICESS.2009.32","url":null,"abstract":"Due to the limited transmission range, data sensed by each sensor has to be forwarded in a multi-hop fashion before being delivered to the sink. The sensors closer to the sink have to forward comparatively more message than sensors at the periphery of the network¿the nodes will deplete their batteries earlier. Besides the loss of the sensing capabilities of the nodes close to the sink, a more serious consequence of the death of the first tier of sensor nodes is the loss of connectivity between the nodes at the periphery of the network and the sink. It makes the wireless networks expire. To alleviate this undesired effect, we adopt two improved schemes. The first one is to redistribute the total energy budget with data traffic load; the second one is to balance the uneven traffic by power control method. They maximize the useful lifetime of the network. We show by theoretical analysis, as well as simulation, that they substantially improve the network lifetime.","PeriodicalId":335217,"journal":{"name":"2009 International Conference on Embedded Software and Systems","volume":"142 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-05-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129430050","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}
Liming Wang, Xiyang Liu, Ailong Song, Lin Xu, Tao Liu
Cross platform debugging can make the software debugging and hardware platform developing work simultaneity in embedded system development, which accelerates the development lifecycle dramatically. Reverse execution can run program backward to historic points, may provide programmers with a useful approach of fast locating the cause of the program failure. In this paper, we propose a reversible debugging framework for cross debugging and implement a prototype reversible debugger called Reversible Debugger for Cross Platform (RDXP) on X86/Linux platform based on PORD. The evaluation shows that RDXP provides an efficient and portable software debugging environment with reasonable speed and memory consumption.
{"title":"An Effective Reversible Debugger of Cross Platform Based on Virtualization","authors":"Liming Wang, Xiyang Liu, Ailong Song, Lin Xu, Tao Liu","doi":"10.1109/ICESS.2009.96","DOIUrl":"https://doi.org/10.1109/ICESS.2009.96","url":null,"abstract":"Cross platform debugging can make the software debugging and hardware platform developing work simultaneity in embedded system development, which accelerates the development lifecycle dramatically. Reverse execution can run program backward to historic points, may provide programmers with a useful approach of fast locating the cause of the program failure. In this paper, we propose a reversible debugging framework for cross debugging and implement a prototype reversible debugger called Reversible Debugger for Cross Platform (RDXP) on X86/Linux platform based on PORD. The evaluation shows that RDXP provides an efficient and portable software debugging environment with reasonable speed and memory consumption.","PeriodicalId":335217,"journal":{"name":"2009 International Conference on Embedded Software and Systems","volume":"97 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-05-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132369984","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. Zhu, Walid Taha, Robert Cartwright, M. Martel, Jeremy G. Siek
Digital computers permeate our physical world. This phenomenon creates a pressing need for tools that help us understand a priori how digital computers can affect their physical environment. In principle, simulation can be a powerful tool for animating models of the world. Today, however, there is not a single simulation environment that comes with a guarantee that the results of the simulation are determined purely by a real-valued model and not by artifacts of the digitized implementation. As such, simulation with guaranteed fidelity does not yet exist.Towards addressing this problem, we offer an expository account of what is known about exact real arithmetic. We argue that this technology, which has roots that are over 200 years old, bears significant promise as offering exactly the right technology to build simulation environments with guaranteed fidelity. And while it has only been sparsely studied in this large span of time, there are reasons to believe that the time is right to accelerate research in this direction.
{"title":"In Pursuit of Real Answers","authors":"A. Zhu, Walid Taha, Robert Cartwright, M. Martel, Jeremy G. Siek","doi":"10.1109/ICESS.2009.91","DOIUrl":"https://doi.org/10.1109/ICESS.2009.91","url":null,"abstract":"Digital computers permeate our physical world. This phenomenon creates a pressing need for tools that help us understand a priori how digital computers can affect their physical environment. In principle, simulation can be a powerful tool for animating models of the world. Today, however, there is not a single simulation environment that comes with a guarantee that the results of the simulation are determined purely by a real-valued model and not by artifacts of the digitized implementation. As such, simulation with guaranteed fidelity does not yet exist.Towards addressing this problem, we offer an expository account of what is known about exact real arithmetic. We argue that this technology, which has roots that are over 200 years old, bears significant promise as offering exactly the right technology to build simulation environments with guaranteed fidelity. And while it has only been sparsely studied in this large span of time, there are reasons to believe that the time is right to accelerate research in this direction.","PeriodicalId":335217,"journal":{"name":"2009 International Conference on Embedded Software and Systems","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-05-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130751650","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. Zhu, Jun Inoue, Marisa Linnea Peralta, Walid M. Taha, M. O'Malley, D. Powell
Haptic feedback can be a critical component of virtual environments used in cognitive research, rehabilitation, military training, and entertainment. A limiting factor in the innovation and the acceptance of virtual environments with haptic feedback is the time and cost required to build them. This paper presents a development environment called iAcumen that supports a new approach for programming such systems. This approach allows the developer to directly express physical equations describing the underlying dynamics. By raising the level of abstraction for the developer, we avoid many of the problems that limit the effectiveness of traditional approaches.
{"title":"Implementing Haptic Feedback Environments from High-Level Descriptions","authors":"A. Zhu, Jun Inoue, Marisa Linnea Peralta, Walid M. Taha, M. O'Malley, D. Powell","doi":"10.1109/ICESS.2009.90","DOIUrl":"https://doi.org/10.1109/ICESS.2009.90","url":null,"abstract":"Haptic feedback can be a critical component of virtual environments used in cognitive research, rehabilitation, military training, and entertainment. A limiting factor in the innovation and the acceptance of virtual environments with haptic feedback is the time and cost required to build them. This paper presents a development environment called iAcumen that supports a new approach for programming such systems. This approach allows the developer to directly express physical equations describing the underlying dynamics. By raising the level of abstraction for the developer, we avoid many of the problems that limit the effectiveness of traditional approaches.","PeriodicalId":335217,"journal":{"name":"2009 International Conference on Embedded Software and Systems","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-05-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133478584","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}
Xuefeng Piao, Heeheon Kim, Yookun Cho, Moonju Park, Sangchul Han, Minkyu Park, Seong-je Cho
Minimizing energy consumption with guaranteeing real-time constraints in low-power embedded systems is gaining more importance as real-time applications become more widely used in embedded systems. Dynamic voltage scaling is a technique to reduce energy consumption by lowering supply voltage. However, lowering supply voltage may interfere with scheduling algorithms, so that tasks may not be successfully scheduled. In this paper, we formulate the problem of minimizing energy consumption for Pre-scheduling as an optimization problem, and show that the problem is a nonlinear convex optimization with linear constraints which can be solved by sequential quadratic programming. By solving the problem, we can obtain the optimal supply voltage and successful scheduling of all tasks is guaranteed.
{"title":"Energy Consumption Optimization of Real-Time Embedded Systems","authors":"Xuefeng Piao, Heeheon Kim, Yookun Cho, Moonju Park, Sangchul Han, Minkyu Park, Seong-je Cho","doi":"10.1109/ICESS.2009.43","DOIUrl":"https://doi.org/10.1109/ICESS.2009.43","url":null,"abstract":"Minimizing energy consumption with guaranteeing real-time constraints in low-power embedded systems is gaining more importance as real-time applications become more widely used in embedded systems. Dynamic voltage scaling is a technique to reduce energy consumption by lowering supply voltage. However, lowering supply voltage may interfere with scheduling algorithms, so that tasks may not be successfully scheduled. In this paper, we formulate the problem of minimizing energy consumption for Pre-scheduling as an optimization problem, and show that the problem is a nonlinear convex optimization with linear constraints which can be solved by sequential quadratic programming. By solving the problem, we can obtain the optimal supply voltage and successful scheduling of all tasks is guaranteed.","PeriodicalId":335217,"journal":{"name":"2009 International Conference on Embedded Software and Systems","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-05-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115843288","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}
Fault-tolerant routing is the ability to survive failure of individual components and usually uses several virtual channels (VCs) to overcome faulty nodes or links. A well-known wormhole-switched routing algorithm for 2-D mesh interconnection network called f-cube3 uses three virtual channels to pass faulty regions, while only one virtual channel is used when a message does not encounter any fault. One of the integral stages of designing Network-on-Chips (NoCs) is the development of an efficient communication system in order to provide low latency networks. We have proposed a new fault-tolerant routing algorithm based on f-cube3 as a solution to reduce the delay of network packets which uses less number of VCs in comparison with f-cube3. Moreover, in this method we have improved the use of VCs per each physical link by reducing required channels to two. Furthermore, simulations of both f-cube3 and our algorithm based on same conditions have been presented.
{"title":"An Enhanced Fault-Tolerant Routing Algorithm for Mesh Network-on-Chip","authors":"Arshin Rezazadeh, M. Fathy, Gholamali Rahnavard","doi":"10.1109/ICESS.2009.89","DOIUrl":"https://doi.org/10.1109/ICESS.2009.89","url":null,"abstract":"Fault-tolerant routing is the ability to survive failure of individual components and usually uses several virtual channels (VCs) to overcome faulty nodes or links. A well-known wormhole-switched routing algorithm for 2-D mesh interconnection network called f-cube3 uses three virtual channels to pass faulty regions, while only one virtual channel is used when a message does not encounter any fault. One of the integral stages of designing Network-on-Chips (NoCs) is the development of an efficient communication system in order to provide low latency networks. We have proposed a new fault-tolerant routing algorithm based on f-cube3 as a solution to reduce the delay of network packets which uses less number of VCs in comparison with f-cube3. Moreover, in this method we have improved the use of VCs per each physical link by reducing required channels to two. Furthermore, simulations of both f-cube3 and our algorithm based on same conditions have been presented.","PeriodicalId":335217,"journal":{"name":"2009 International Conference on Embedded Software and Systems","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-05-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124082551","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}
Recently, for embedded systems, the complexity of the software is rapidly increasing due to the advancement in the fields of multimedia and network. Due to these developments, it is difficult to find the cause of problems in system. This is especially true when the causes of problems are buried in the kernel layer, finding them more difficult to compare with the user layer. One reason of the difficulties comes from that there are no effective system which can analyze kernel problem available for developers.In this paper, we propose a system named Kernel Analysis System (KAS) that can find errors and bugs in kernel. As a case study, the KAS find timer latency which is serious problem for the real-time processing system in kernel layer. It can effectively find the problem and support to find the cause of them. In the future, we try to generalize the system to find the other problems and causes to support the developers.
{"title":"Analysis of Embedded Linux Using Kernel Analysis System","authors":"Ki-Dok Kwon, Midori Sugaya, T. Nakajima","doi":"10.1109/ICESS.2009.74","DOIUrl":"https://doi.org/10.1109/ICESS.2009.74","url":null,"abstract":"Recently, for embedded systems, the complexity of the software is rapidly increasing due to the advancement in the fields of multimedia and network. Due to these developments, it is difficult to find the cause of problems in system. This is especially true when the causes of problems are buried in the kernel layer, finding them more difficult to compare with the user layer. One reason of the difficulties comes from that there are no effective system which can analyze kernel problem available for developers.In this paper, we propose a system named Kernel Analysis System (KAS) that can find errors and bugs in kernel. As a case study, the KAS find timer latency which is serious problem for the real-time processing system in kernel layer. It can effectively find the problem and support to find the cause of them. In the future, we try to generalize the system to find the other problems and causes to support the developers.","PeriodicalId":335217,"journal":{"name":"2009 International Conference on Embedded Software and Systems","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-05-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129868395","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
扫码关注我们
求助内容：
应助结果提醒方式：