Pub Date : 2004-05-24DOI: 10.1109/WSTFEUS.2004.10002
Y. Hong, H. W. Goo
We present a heuristic for producing a fault-tolerant schedule of given periodic tasks in distributed real-time systems. Tasks are divided into two classes according to their task utilization. In order to recover from faults, a hybrid scheme based on space redundancy and time redundancy is used. We use a very simple and fast heuristic to provide fault tolerance and reduce time overhead in case of transient faults in distributed real-time systems. We show that our approach can improve processor utilization.
{"title":"A fault-tolerant technique for scheduling periodic tasks in real-time systems","authors":"Y. Hong, H. W. Goo","doi":"10.1109/WSTFEUS.2004.10002","DOIUrl":"https://doi.org/10.1109/WSTFEUS.2004.10002","url":null,"abstract":"We present a heuristic for producing a fault-tolerant schedule of given periodic tasks in distributed real-time systems. Tasks are divided into two classes according to their task utilization. In order to recover from faults, a hybrid scheme based on space redundancy and time redundancy is used. We use a very simple and fast heuristic to provide fault tolerance and reduce time overhead in case of transient faults in distributed real-time systems. We show that our approach can improve processor utilization.","PeriodicalId":170872,"journal":{"name":"Second IEEE Workshop on Software Technologies for Future Embedded and Ubiquitous Systems, 2004. Proceedings.","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2004-05-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116057095","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}
Pub Date : 2004-05-11DOI: 10.1109/WSTFEUS.2004.10018
WoongChul Choi, Yongsuk Lee, S. Rhee, K. Chung, Jang-Yeon Lee, Jin-Woong Cho, W. Cho
In this paper, we make MAC protocol improvements for performance enhancement of multihop ad-hoc wireless networks. A node in ad-hoc wireless networks can transmit a packet only when the medium is available, and while a packet is being transmitted, no other node is allowed to transmit a packet if they are in carrier sensing range. Carrier sensing range can be divided into two disjoint areas of transmission range and carrier sensing zone, and we address the importance of the protocol procedure when a node is in carrier sensing zone. The characteristic of the carrier sensing zone is that a node can not know when the remaining time of the ongoing transmission session expires or exactly when the media becomes available. Current MAC protocol does not behave in much different way between when a node is in transmission range and in carrier sensing zone. We have conducted a comprehensive simulation to study the performance improvements. The simulation results indicate that the performance is increased and the number of dropped packets due to collision is significantly reduced as much as a half.
{"title":"End-to-end performance improvements for multi-hop ad-hoc wireless networks","authors":"WoongChul Choi, Yongsuk Lee, S. Rhee, K. Chung, Jang-Yeon Lee, Jin-Woong Cho, W. Cho","doi":"10.1109/WSTFEUS.2004.10018","DOIUrl":"https://doi.org/10.1109/WSTFEUS.2004.10018","url":null,"abstract":"In this paper, we make MAC protocol improvements for performance enhancement of multihop ad-hoc wireless networks. A node in ad-hoc wireless networks can transmit a packet only when the medium is available, and while a packet is being transmitted, no other node is allowed to transmit a packet if they are in carrier sensing range. Carrier sensing range can be divided into two disjoint areas of transmission range and carrier sensing zone, and we address the importance of the protocol procedure when a node is in carrier sensing zone. The characteristic of the carrier sensing zone is that a node can not know when the remaining time of the ongoing transmission session expires or exactly when the media becomes available. Current MAC protocol does not behave in much different way between when a node is in transmission range and in carrier sensing zone. We have conducted a comprehensive simulation to study the performance improvements. The simulation results indicate that the performance is increased and the number of dropped packets due to collision is significantly reduced as much as a half.","PeriodicalId":170872,"journal":{"name":"Second IEEE Workshop on Software Technologies for Future Embedded and Ubiquitous Systems, 2004. Proceedings.","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2004-05-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125602305","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}
Pub Date : 2004-05-11DOI: 10.1109/WSTFEUS.2004.10035
J. Nakazawa, J. Yura, H. Tokuda
We propose a new service modeling and lookup method based on service shaping. In existing service frameworks, assembling ubiquitous services requires application programmers to translate their requirements to the type space defined by service programmers. This translation, however, disables some of user requirements due to abstraction gap and time gap between the user tasks and service types. This raises a problem which we call the hidden service problem, where an application cannot find a service which satisfies a user's request, even if the service exists. To cope with this problem, we propose a shape-based service framework, called Galaxy. In Galaxy service framework, service programmers are required to describe capability of service, called, shape, for each service in an XML document. Applications can query services by specifying partial shape without depending on programmer-defined types.
{"title":"Galaxy: a service shaping approach for addressing the hidden service problem","authors":"J. Nakazawa, J. Yura, H. Tokuda","doi":"10.1109/WSTFEUS.2004.10035","DOIUrl":"https://doi.org/10.1109/WSTFEUS.2004.10035","url":null,"abstract":"We propose a new service modeling and lookup method based on service shaping. In existing service frameworks, assembling ubiquitous services requires application programmers to translate their requirements to the type space defined by service programmers. This translation, however, disables some of user requirements due to abstraction gap and time gap between the user tasks and service types. This raises a problem which we call the hidden service problem, where an application cannot find a service which satisfies a user's request, even if the service exists. To cope with this problem, we propose a shape-based service framework, called Galaxy. In Galaxy service framework, service programmers are required to describe capability of service, called, shape, for each service in an XML document. Applications can query services by specifying partial shape without depending on programmer-defined types.","PeriodicalId":170872,"journal":{"name":"Second IEEE Workshop on Software Technologies for Future Embedded and Ubiquitous Systems, 2004. Proceedings.","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2004-05-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134166338","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}
Pub Date : 2004-05-11DOI: 10.1109/WSTFEUS.2004.10014
Félix F. Ramos
In this article is presented a formal methodology to develop software solutions based on agents. The proposed methodology is based on Beliefs-Intentions agent architecture and uses the temporal logic alphabet and axioms to model the system. The methodology details explicitly the multiagent construction phases from the specification to the verification. Contributions of this article are: first, propose an analysis and design methodology, which use interaction as support for developing distributed complex application. Second, propose a formal object language in order to specify in a natural and comprehensive way the multiagent characteristics and properties, and also validate this specification.
{"title":"Methodology for analysis and design of systems","authors":"Félix F. Ramos","doi":"10.1109/WSTFEUS.2004.10014","DOIUrl":"https://doi.org/10.1109/WSTFEUS.2004.10014","url":null,"abstract":"In this article is presented a formal methodology to develop software solutions based on agents. The proposed methodology is based on Beliefs-Intentions agent architecture and uses the temporal logic alphabet and axioms to model the system. The methodology details explicitly the multiagent construction phases from the specification to the verification. Contributions of this article are: first, propose an analysis and design methodology, which use interaction as support for developing distributed complex application. Second, propose a formal object language in order to specify in a natural and comprehensive way the multiagent characteristics and properties, and also validate this specification.","PeriodicalId":170872,"journal":{"name":"Second IEEE Workshop on Software Technologies for Future Embedded and Ubiquitous Systems, 2004. Proceedings.","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2004-05-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133412921","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}
Pub Date : 2004-05-11DOI: 10.1109/WSTFEUS.2004.10034
N. Kushwaha, Minkoo Kim, Dong Yoon Kim, W. Cho
We propose an intelligent agent model for smart home environments. In ubiquitous computing environments like smart home, agents have to learn user's preferences in order to assist them. These preferences are represented by user profiles. Our proposed UT-AGENT uses case-based reasoning (CBR) to acquire knowledge about user actions that are worth recording to determine their preferences and Bayesian network (BN) as an inference tool to model relationships between them. UT-AGENT maintains the status of every device present in the home and activates them as per user preference. It generates a sequence of expected user's query and simultaneously activates the devices with preset preference settings.
{"title":"An intelligent agent for ubiquitous computing environments: smart home UT-AGENT","authors":"N. Kushwaha, Minkoo Kim, Dong Yoon Kim, W. Cho","doi":"10.1109/WSTFEUS.2004.10034","DOIUrl":"https://doi.org/10.1109/WSTFEUS.2004.10034","url":null,"abstract":"We propose an intelligent agent model for smart home environments. In ubiquitous computing environments like smart home, agents have to learn user's preferences in order to assist them. These preferences are represented by user profiles. Our proposed UT-AGENT uses case-based reasoning (CBR) to acquire knowledge about user actions that are worth recording to determine their preferences and Bayesian network (BN) as an inference tool to model relationships between them. UT-AGENT maintains the status of every device present in the home and activates them as per user preference. It generates a sequence of expected user's query and simultaneously activates the devices with preset preference settings.","PeriodicalId":170872,"journal":{"name":"Second IEEE Workshop on Software Technologies for Future Embedded and Ubiquitous Systems, 2004. Proceedings.","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2004-05-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115707772","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}
Pub Date : 2004-05-11DOI: 10.1109/WSTFEUS.2004.10012
Celal Öztürk, Yanyong Zhang, W. Trappe, M. Ott
Wireless sensor networks are currently being investigated for ubiquitous computing applications. Privacy is a critical issue for these networks as adversaries may be able to eavesdrop or observe the presence of sensor data to infer information that was not intended to be revealed. The devices that constitute sensor networks are low-powered, compute-constrained devices. Any privacy solution should carefully consider the tradeoffs between supporting location-privacy and energy consumption. We explore two main classes of privacy issues: content privacy and originator location privacy. Content privacy can be maintained through conventional cryptographic methods that provide data confidentiality. We briefly discuss system design techniques that are needed to prevent an adversary from correlating observations from multiple messages to infer the content of encrypted sensor readings. We then examine the issue of protecting the originating sensor's location by studying several multihop routing mechanisms for ad hoc networks. We focus our discussion on three classes of routing protocols: the class of the shortest path routing protocols, the class offloading protocols, and a hybrid class of routing.
{"title":"Source-location privacy for networks of energy-constrained sensors","authors":"Celal Öztürk, Yanyong Zhang, W. Trappe, M. Ott","doi":"10.1109/WSTFEUS.2004.10012","DOIUrl":"https://doi.org/10.1109/WSTFEUS.2004.10012","url":null,"abstract":"Wireless sensor networks are currently being investigated for ubiquitous computing applications. Privacy is a critical issue for these networks as adversaries may be able to eavesdrop or observe the presence of sensor data to infer information that was not intended to be revealed. The devices that constitute sensor networks are low-powered, compute-constrained devices. Any privacy solution should carefully consider the tradeoffs between supporting location-privacy and energy consumption. We explore two main classes of privacy issues: content privacy and originator location privacy. Content privacy can be maintained through conventional cryptographic methods that provide data confidentiality. We briefly discuss system design techniques that are needed to prevent an adversary from correlating observations from multiple messages to infer the content of encrypted sensor readings. We then examine the issue of protecting the originating sensor's location by studying several multihop routing mechanisms for ad hoc networks. We focus our discussion on three classes of routing protocols: the class of the shortest path routing protocols, the class offloading protocols, and a hybrid class of routing.","PeriodicalId":170872,"journal":{"name":"Second IEEE Workshop on Software Technologies for Future Embedded and Ubiquitous Systems, 2004. Proceedings.","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2004-05-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128621827","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}
Pub Date : 2004-05-11DOI: 10.1109/WSTFEUS.2004.10010
I. Park, Young Han Kim, Sang-san Lee
Address allocation to mobile nodes is an important problem in mobile ad-hoc networks (MANET). Recently, several schemes have been proposed for address allocation in pure MANET environment, but they do not consider the access requirement of mobile nodes to the global Internet. In this paper, we consider the hybrid MANET where the pure MANET is interconnected to the external Internet by some gateways. For global-scope address allocation in this hybrid MANET, we present a new address allocation scheme by modifying the IPv6 stateless address autoconfiguration protocol. The proposed protocol decreases the latency of address allocation period by enhancing the duplicate address detection (DAD) mechanism of the address autoconfiguration protocol.
{"title":"IPv6 address allocation in hybrid mobile ad-hoc networks","authors":"I. Park, Young Han Kim, Sang-san Lee","doi":"10.1109/WSTFEUS.2004.10010","DOIUrl":"https://doi.org/10.1109/WSTFEUS.2004.10010","url":null,"abstract":"Address allocation to mobile nodes is an important problem in mobile ad-hoc networks (MANET). Recently, several schemes have been proposed for address allocation in pure MANET environment, but they do not consider the access requirement of mobile nodes to the global Internet. In this paper, we consider the hybrid MANET where the pure MANET is interconnected to the external Internet by some gateways. For global-scope address allocation in this hybrid MANET, we present a new address allocation scheme by modifying the IPv6 stateless address autoconfiguration protocol. The proposed protocol decreases the latency of address allocation period by enhancing the duplicate address detection (DAD) mechanism of the address autoconfiguration protocol.","PeriodicalId":170872,"journal":{"name":"Second IEEE Workshop on Software Technologies for Future Embedded and Ubiquitous Systems, 2004. Proceedings.","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2004-05-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116117197","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}
Pub Date : 2004-05-11DOI: 10.1109/WSTFEUS.2004.10016
S. Han, Yeo Bong Yoon, H. Youn, W. Cho
Ubiquitous computing environment involves a variety of devices of different capabilities. Here middleware takes a crucial role for efficiently coordinating the components and providing proper services. In this paper we propose a new middleware architecture called HOMEROS, which allows high flexibility by adopting a hybrid-network model and dynamically configurable reflective ORB. It consists of three layers, and the effectiveness of it is demonstrated by showing a ubiquitous printing service scenario.
{"title":"A new middleware architecture for ubiquitous computing environment","authors":"S. Han, Yeo Bong Yoon, H. Youn, W. Cho","doi":"10.1109/WSTFEUS.2004.10016","DOIUrl":"https://doi.org/10.1109/WSTFEUS.2004.10016","url":null,"abstract":"Ubiquitous computing environment involves a variety of devices of different capabilities. Here middleware takes a crucial role for efficiently coordinating the components and providing proper services. In this paper we propose a new middleware architecture called HOMEROS, which allows high flexibility by adopting a hybrid-network model and dynamically configurable reflective ORB. It consists of three layers, and the effectiveness of it is demonstrated by showing a ubiquitous printing service scenario.","PeriodicalId":170872,"journal":{"name":"Second IEEE Workshop on Software Technologies for Future Embedded and Ubiquitous Systems, 2004. Proceedings.","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2004-05-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115248468","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}
Pub Date : 2004-05-11DOI: 10.1109/WSTFEUS.2004.10017
Hyun-Jin Park, Seog-Hong Park, W. Cho, Hyoung-Kyu Song
We investigate a home entertainment and computing network proposal, which takes advantage of UWB impulse radio technology. Time hopping combined with pulse position modulation represents the original proposal for UWB communication systems. Recently, other schemes have been considered in order to obtain better performance in particular scenarios. OFDM-based UWB system uses OFDM modulation with a frequency hopped pulse train in order to achieve full multipath diversity in multipath fading channels. Direct sequence code division multiple access is well known as a powerful multiple-access technique in the presence of strong narrowband interference. We investigate modulation schemes (DSC, OFDM) and design approach (LDPC) for improving the performance of home entertainment network.
{"title":"Ubiquitous home networking based on ultra wide bandwidth communication systems","authors":"Hyun-Jin Park, Seog-Hong Park, W. Cho, Hyoung-Kyu Song","doi":"10.1109/WSTFEUS.2004.10017","DOIUrl":"https://doi.org/10.1109/WSTFEUS.2004.10017","url":null,"abstract":"We investigate a home entertainment and computing network proposal, which takes advantage of UWB impulse radio technology. Time hopping combined with pulse position modulation represents the original proposal for UWB communication systems. Recently, other schemes have been considered in order to obtain better performance in particular scenarios. OFDM-based UWB system uses OFDM modulation with a frequency hopped pulse train in order to achieve full multipath diversity in multipath fading channels. Direct sequence code division multiple access is well known as a powerful multiple-access technique in the presence of strong narrowband interference. We investigate modulation schemes (DSC, OFDM) and design approach (LDPC) for improving the performance of home entertainment network.","PeriodicalId":170872,"journal":{"name":"Second IEEE Workshop on Software Technologies for Future Embedded and Ubiquitous Systems, 2004. Proceedings.","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2004-05-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122347847","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}
Pub Date : 2004-05-11DOI: 10.1109/WSTFEUS.2004.10024
R. Meier, J. Kaiser, B. Hughes, C. Brudna, V. Cahill
We describe an event model that has been designed to address the predictability requirements of applications operating in mobile environments based on hierarchically structured WAN-of-CANs networks. The event model supports an event channel concept for modeling the guarantees provided by the underlying heterogeneous communication infrastructure. The networks that comprise such a WAN-of-CANs may provide fundamentally different degrees of quality of service and as a result can be viewed as zones within which certain guarantees can be enforced. Event channels operating in CAN-based subnetworks typically with strong timing behavior may support hard temporal and reliability attributes whereas channels interconnecting these subnetworks using wireless networks support weaker timing attributes.
{"title":"An event model for real-time systems in mobile environments","authors":"R. Meier, J. Kaiser, B. Hughes, C. Brudna, V. Cahill","doi":"10.1109/WSTFEUS.2004.10024","DOIUrl":"https://doi.org/10.1109/WSTFEUS.2004.10024","url":null,"abstract":"We describe an event model that has been designed to address the predictability requirements of applications operating in mobile environments based on hierarchically structured WAN-of-CANs networks. The event model supports an event channel concept for modeling the guarantees provided by the underlying heterogeneous communication infrastructure. The networks that comprise such a WAN-of-CANs may provide fundamentally different degrees of quality of service and as a result can be viewed as zones within which certain guarantees can be enforced. Event channels operating in CAN-based subnetworks typically with strong timing behavior may support hard temporal and reliability attributes whereas channels interconnecting these subnetworks using wireless networks support weaker timing attributes.","PeriodicalId":170872,"journal":{"name":"Second IEEE Workshop on Software Technologies for Future Embedded and Ubiquitous Systems, 2004. Proceedings.","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2004-05-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126004602","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
扫码关注我们
求助内容：
应助结果提醒方式：