Pub Date : 2009-03-23DOI: 10.1109/ISADS.2009.5207349
M. Brzozowski, K. Piotrowski, P. Langendörfer
Realizing highly reliable wireless sensor networks with a long lifetime is a challenging task. A long lifetime is normally achieved by low duty cycles and rare activity. High reliability requires the replication of data to cope with dying nodes, network fragmentation, etc. These problems become even harder to tackle in networks with no wired sink (decentralized networks), which can synchronize the nodes and store data. We thoroughly investigated the challenges and present a reasonable approach, which adopts cross-layer rendezvous and data dissemination schemes. Our protocol can achieve very good results for lifetime, efficient replication handling and data gathering in decentralized sensor networks. Off-the-shelf sensor nodes based on our approach offer a lifetime of two years. However, our simulation results reveal that very long sleep phases may lead to increased power consumption, which is not expected.
{"title":"A cross-layer approach for data replication and gathering in decentralized long-living wireless sensor networks","authors":"M. Brzozowski, K. Piotrowski, P. Langendörfer","doi":"10.1109/ISADS.2009.5207349","DOIUrl":"https://doi.org/10.1109/ISADS.2009.5207349","url":null,"abstract":"Realizing highly reliable wireless sensor networks with a long lifetime is a challenging task. A long lifetime is normally achieved by low duty cycles and rare activity. High reliability requires the replication of data to cope with dying nodes, network fragmentation, etc. These problems become even harder to tackle in networks with no wired sink (decentralized networks), which can synchronize the nodes and store data. We thoroughly investigated the challenges and present a reasonable approach, which adopts cross-layer rendezvous and data dissemination schemes. Our protocol can achieve very good results for lifetime, efficient replication handling and data gathering in decentralized sensor networks. Off-the-shelf sensor nodes based on our approach offer a lifetime of two years. However, our simulation results reveal that very long sleep phases may lead to increased power consumption, which is not expected.","PeriodicalId":342911,"journal":{"name":"2009 International Symposium on Autonomous Decentralized Systems","volume":"4 9","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-03-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114049398","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 : 2009-03-23DOI: 10.1109/ISADS.2009.5207333
Yansheng Zhang, F. Bastani
Autonomous decentralized multi-robot systems require a large number of robots to interact with each other in real-time to cooperatively perform some tasks. This paper systematically investigates the major issues that need to be addressed in methods of building multi-robot based virtual devices. A hierarchical structure is presented to enable the user to tele-control the system when some contingency occurs. Hence, the virtual device interface makes a user and multiple robots to cooperate seamlessly on various tasks that are difficult for a fully autonomous system or a fully tele-controlled system to perform. Specially, we present the virtual structure for a rigid-body transportation system that employs a large number of robots to lift a rigid body and transport it to a user specified location. Path and motion planners are designed to allow the system to move smoothly along an optimal path.
{"title":"Virtual-device framework for autonomous decentralized multi-robot systems","authors":"Yansheng Zhang, F. Bastani","doi":"10.1109/ISADS.2009.5207333","DOIUrl":"https://doi.org/10.1109/ISADS.2009.5207333","url":null,"abstract":"Autonomous decentralized multi-robot systems require a large number of robots to interact with each other in real-time to cooperatively perform some tasks. This paper systematically investigates the major issues that need to be addressed in methods of building multi-robot based virtual devices. A hierarchical structure is presented to enable the user to tele-control the system when some contingency occurs. Hence, the virtual device interface makes a user and multiple robots to cooperate seamlessly on various tasks that are difficult for a fully autonomous system or a fully tele-controlled system to perform. Specially, we present the virtual structure for a rigid-body transportation system that employs a large number of robots to lift a rigid body and transport it to a user specified location. Path and motion planners are designed to allow the system to move smoothly along an optimal path.","PeriodicalId":342911,"journal":{"name":"2009 International Symposium on Autonomous Decentralized Systems","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-03-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121331907","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 : 2009-03-23DOI: 10.1109/ISADS.2009.5207355
P. Papaioannou, P. Nastou, Y. Stamatiou, C. Zaroliagis
Elliptic Curve Cryptography (ECC) is one of the most promising alternatives to conventional public key cryptography, such as RSA and ElGamal, since it employs keys of smaller sizes for the same level of cryptographic strength. Smaller key sizes imply smaller hardware units for performing the arithmetic operations required by cryptographic protocols and, thus, ECC is an ideal candidate for implementation in embedded systems where the major computational resources (speed and storage) are limited. In this paper we present a port, written in ANSI C for maximum portability, of an open source ECC-based cryptographic library (ECC-LIB) to ATMEL's AT76C520 802.11 WLAN Access Point. One of the major features of this port, not found in similar ports, is that it supports Complex Multiplication (CM) for the construction of Elliptic Curves with good security properties. We present some experimental results that demonstrate that the port is efficient and can lead to generic embedded systems with robust ECC-based cryptographic protocols using cryptographically strong ECCs generated with CM. As an application of the ported library, an EC Diffie-Hellman key exchange protocol is developed as an alternative of the 4-way key handshake protocol of the 802.11 protocol.
{"title":"Secure Elliptic Curve generation and key establishment on a 802.11 WLAN embedded device","authors":"P. Papaioannou, P. Nastou, Y. Stamatiou, C. Zaroliagis","doi":"10.1109/ISADS.2009.5207355","DOIUrl":"https://doi.org/10.1109/ISADS.2009.5207355","url":null,"abstract":"Elliptic Curve Cryptography (ECC) is one of the most promising alternatives to conventional public key cryptography, such as RSA and ElGamal, since it employs keys of smaller sizes for the same level of cryptographic strength. Smaller key sizes imply smaller hardware units for performing the arithmetic operations required by cryptographic protocols and, thus, ECC is an ideal candidate for implementation in embedded systems where the major computational resources (speed and storage) are limited. In this paper we present a port, written in ANSI C for maximum portability, of an open source ECC-based cryptographic library (ECC-LIB) to ATMEL's AT76C520 802.11 WLAN Access Point. One of the major features of this port, not found in similar ports, is that it supports Complex Multiplication (CM) for the construction of Elliptic Curves with good security properties. We present some experimental results that demonstrate that the port is efficient and can lead to generic embedded systems with robust ECC-based cryptographic protocols using cryptographically strong ECCs generated with CM. As an application of the ported library, an EC Diffie-Hellman key exchange protocol is developed as an alternative of the 4-way key handshake protocol of the 802.11 protocol.","PeriodicalId":342911,"journal":{"name":"2009 International Symposium on Autonomous Decentralized Systems","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-03-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126458143","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 : 2009-03-23DOI: 10.1109/ISADS.2009.5208120
Xiaodong Lu, K. Mori
The market and users' requirements have been rapidly changing and diversified. Under these heterogeneous and dynamic situations, not only the system structure itself, but also the accessible information services would be changed constantly. To cope with the continuously changing conditions of service provision and utilization, Faded Information Field (FIF) has been proposed, which is an agent-based distributed information service system architecture. In the case of a mono-service request, the system is designed to improve users' access time and preserve load balancing through the information structure. However, with interdependent requests of multi-service increasing, adaptability, reliability and timeliness have to be assured by the system. In this paper, the relationship between the timeliness and the reliability of correlated services allocation and access is clarified. Based on these factors, the autonomous network-based heterogeneous information services integration technology to provide one-stop service for users' multi-service requests is proposed. The simulation results show the effectiveness of the proposed technology in comparison with the conventional systems.
{"title":"Autonomous information services integration architecture for service assurance in multi-agent systems","authors":"Xiaodong Lu, K. Mori","doi":"10.1109/ISADS.2009.5208120","DOIUrl":"https://doi.org/10.1109/ISADS.2009.5208120","url":null,"abstract":"The market and users' requirements have been rapidly changing and diversified. Under these heterogeneous and dynamic situations, not only the system structure itself, but also the accessible information services would be changed constantly. To cope with the continuously changing conditions of service provision and utilization, Faded Information Field (FIF) has been proposed, which is an agent-based distributed information service system architecture. In the case of a mono-service request, the system is designed to improve users' access time and preserve load balancing through the information structure. However, with interdependent requests of multi-service increasing, adaptability, reliability and timeliness have to be assured by the system. In this paper, the relationship between the timeliness and the reliability of correlated services allocation and access is clarified. Based on these factors, the autonomous network-based heterogeneous information services integration technology to provide one-stop service for users' multi-service requests is proposed. The simulation results show the effectiveness of the proposed technology in comparison with the conventional systems.","PeriodicalId":342911,"journal":{"name":"2009 International Symposium on Autonomous Decentralized Systems","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-03-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125252947","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 : 2009-03-23DOI: 10.1109/ISADS.2009.5207335
Hosung Park, Taehee Kim, Jeongcheol Lee, Min-Sook Jin, Sang-Ha Kim
In many sensor applications such as intruder tracking, reliable data dissemination is necessary. Existing studies in ad hoc networks generally apply end-to-end control for reliability. This approach however could not adapt to wireless sensor networks (WSNs). Existing studies in WSNs generally apply multi-path approach for reliability. This approach however only increases probability but could not assure data dissemination. In typical WSNs, data are delivered from a source node to a destination node on routing path that is fixed within a certain period of time. This routing path is well-matched with notion of virtual circuit. Approaches based on virtual circuit traditionally use hop-by-hop control for reliable data dissemination. In this paper, we apply notion of virtual circuit to WSNs and propose hop-by-hop control for reliable data dissemination. The proposed scheme consists of three major functionalities: virtual circuit construction, hop-by-hop control, and virtual circuit management. Virtual circuit construction make sure constructing fixed routing path by routing table. Hop-by-hop control guarantees data transmission between two nodes, i.e. one hop, on virtual circuit by error detection and retransmission. Virtual circuit management prevents disconnecting circuit by reconstructing circuit. Simulation results show that the proposed scheme is efficient in terms of data delivery ratio and energy consumption.
{"title":"Hop-by-hop control for reliable data dissemination in wireless sensor networks","authors":"Hosung Park, Taehee Kim, Jeongcheol Lee, Min-Sook Jin, Sang-Ha Kim","doi":"10.1109/ISADS.2009.5207335","DOIUrl":"https://doi.org/10.1109/ISADS.2009.5207335","url":null,"abstract":"In many sensor applications such as intruder tracking, reliable data dissemination is necessary. Existing studies in ad hoc networks generally apply end-to-end control for reliability. This approach however could not adapt to wireless sensor networks (WSNs). Existing studies in WSNs generally apply multi-path approach for reliability. This approach however only increases probability but could not assure data dissemination. In typical WSNs, data are delivered from a source node to a destination node on routing path that is fixed within a certain period of time. This routing path is well-matched with notion of virtual circuit. Approaches based on virtual circuit traditionally use hop-by-hop control for reliable data dissemination. In this paper, we apply notion of virtual circuit to WSNs and propose hop-by-hop control for reliable data dissemination. The proposed scheme consists of three major functionalities: virtual circuit construction, hop-by-hop control, and virtual circuit management. Virtual circuit construction make sure constructing fixed routing path by routing table. Hop-by-hop control guarantees data transmission between two nodes, i.e. one hop, on virtual circuit by error detection and retransmission. Virtual circuit management prevents disconnecting circuit by reconstructing circuit. Simulation results show that the proposed scheme is efficient in terms of data delivery ratio and energy consumption.","PeriodicalId":342911,"journal":{"name":"2009 International Symposium on Autonomous Decentralized Systems","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-03-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124012990","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 : 2009-03-23DOI: 10.1109/ISADS.2009.5207325
M. Matsubara, T. Kojima, K. Shimamura, N. Kanekawa, K. Sakurai
X-by-Wire systems are expected to enhance vehicle driving performance and safety. Regarding the dependable and cost-effective electronic platform for X-by-Wire systems, the network centric architecture is proposed based on a concept of autonomous decentralized systems. This architecture enables that, if one node fails, the remaining normal nodes autonomously execute a backup control to maintain the system function. This mechanism is served by a membership functionality implemented in a middleware that is independent from applications so that this mechanism can be applied to any applications. Following the concept proposal, the node status monitoring algorithm is designed because it is essential to identify the failed node accurately to execute the autonomous backup control. In this paper, to obtain a stability of a system throughout a driving, a sequence for autonomous start up and stop of the system is newly designed applying the node status monitoring function.
{"title":"Node status monitoring and state transition mechanism for network centric X-by-Wire systems","authors":"M. Matsubara, T. Kojima, K. Shimamura, N. Kanekawa, K. Sakurai","doi":"10.1109/ISADS.2009.5207325","DOIUrl":"https://doi.org/10.1109/ISADS.2009.5207325","url":null,"abstract":"X-by-Wire systems are expected to enhance vehicle driving performance and safety. Regarding the dependable and cost-effective electronic platform for X-by-Wire systems, the network centric architecture is proposed based on a concept of autonomous decentralized systems. This architecture enables that, if one node fails, the remaining normal nodes autonomously execute a backup control to maintain the system function. This mechanism is served by a membership functionality implemented in a middleware that is independent from applications so that this mechanism can be applied to any applications. Following the concept proposal, the node status monitoring algorithm is designed because it is essential to identify the failed node accurately to execute the autonomous backup control. In this paper, to obtain a stability of a system throughout a driving, a sequence for autonomous start up and stop of the system is newly designed applying the node status monitoring function.","PeriodicalId":342911,"journal":{"name":"2009 International Symposium on Autonomous Decentralized Systems","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-03-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126794946","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 : 2009-03-23DOI: 10.1109/ISADS.2009.5207359
C. Papazoglou, A. Pomportsis, P. Sarigiannidis, G. Papadimitriou
Optical burst switching (OBS) has emerged as a viable switching alternative in backbone optical networks since it can support high data rates with an intermediate granularity compared to wavelength routing and optical packet switching. At the edges of an OBS cloud, packets are assembled to form bursts which enter the network core and are switched on the fly using bandwidth previously reserved by their control packets at each node. A key problem in OBS networks is the assignment of wavelengths to incoming bursts, i.e. the scheduling of bursts. This paper proposes two new techniques which are shown to improve burst scheduling algorithms by lowering their complexity. The first proposed technique is based on a triangular estimator that defines a “drop zone”; bursts that fall into this area are considered to have a very low probability of finding a suitable wavelength and as such, no effort is made to schedule them. According to the second approach, the drop zone is defined dynamically based on the burst drop history. Simulation results show that both approaches yield burst drop rates marginally higher or identical to the LAUC-VF scheduling algorithm while reducing the number of channel or void checks and thus the algorithm complexity and execution time.
{"title":"Techniques for improved scheduling in optical burst switched networks","authors":"C. Papazoglou, A. Pomportsis, P. Sarigiannidis, G. Papadimitriou","doi":"10.1109/ISADS.2009.5207359","DOIUrl":"https://doi.org/10.1109/ISADS.2009.5207359","url":null,"abstract":"Optical burst switching (OBS) has emerged as a viable switching alternative in backbone optical networks since it can support high data rates with an intermediate granularity compared to wavelength routing and optical packet switching. At the edges of an OBS cloud, packets are assembled to form bursts which enter the network core and are switched on the fly using bandwidth previously reserved by their control packets at each node. A key problem in OBS networks is the assignment of wavelengths to incoming bursts, i.e. the scheduling of bursts. This paper proposes two new techniques which are shown to improve burst scheduling algorithms by lowering their complexity. The first proposed technique is based on a triangular estimator that defines a “drop zone”; bursts that fall into this area are considered to have a very low probability of finding a suitable wavelength and as such, no effort is made to schedule them. According to the second approach, the drop zone is defined dynamically based on the burst drop history. Simulation results show that both approaches yield burst drop rates marginally higher or identical to the LAUC-VF scheduling algorithm while reducing the number of channel or void checks and thus the algorithm complexity and execution time.","PeriodicalId":342911,"journal":{"name":"2009 International Symposium on Autonomous Decentralized Systems","volume":"309 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-03-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123034574","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 : 2009-03-23DOI: 10.1109/ISADS.2009.5207377
T. Hamai, M. Fujii, Yu Watanabe
Peer-to-peer (P2P) networks use diverse connectivity between participants in networks. P2P networks are useful for many purposes. Sharing content files containing audio, video, data or anything in digital format is very common, and real-time data, such as telephony traffic, is also passed using P2P technology. Because the P2P communication model differs from that of conventional server and client system, further security threats emerge, which are not applicable to server and client architecture. The Telecommunication Standardization Sector (ITU-T) developed network security Recommendations for P2P telecommunications on behalf of the International Telecommunication Union (ITU). This paper provides general survey of the Recommendations.
{"title":"ITU-T recommendations on peer-to-peer (P2P) network security","authors":"T. Hamai, M. Fujii, Yu Watanabe","doi":"10.1109/ISADS.2009.5207377","DOIUrl":"https://doi.org/10.1109/ISADS.2009.5207377","url":null,"abstract":"Peer-to-peer (P2P) networks use diverse connectivity between participants in networks. P2P networks are useful for many purposes. Sharing content files containing audio, video, data or anything in digital format is very common, and real-time data, such as telephony traffic, is also passed using P2P technology. Because the P2P communication model differs from that of conventional server and client system, further security threats emerge, which are not applicable to server and client architecture. The Telecommunication Standardization Sector (ITU-T) developed network security Recommendations for P2P telecommunications on behalf of the International Telecommunication Union (ITU). This paper provides general survey of the Recommendations.","PeriodicalId":342911,"journal":{"name":"2009 International Symposium on Autonomous Decentralized Systems","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-03-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129481160","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 : 2009-03-23DOI: 10.1109/ISADS.2009.5207353
K. Shin-ike, H. Iima
In school education there are many kinds of learning styles, and it is known that group learning (collaborative learning) is more effective than individual learning. In colllaborative learning it is very important how to deternime the optimal combination of students in order to improve the learning effect In this paper we propose a method to improve the learning effect of collaborative learning resning. A neural network model is fiest applied for predicting learning result of pairs of students in collaborative learning. Then, in order to determine the opptimal pairs of students, a genetic algorithm is applied with the prediction result obtanined from the neural network. Based on this combination of students,we carried out an experiment of collaborative learning at a college in Japan. It was confirmed from the experimental results that the proposed method was effective.
{"title":"A method for Development of collaborative learning by using a neural network and a genetic algorithm","authors":"K. Shin-ike, H. Iima","doi":"10.1109/ISADS.2009.5207353","DOIUrl":"https://doi.org/10.1109/ISADS.2009.5207353","url":null,"abstract":"In school education there are many kinds of learning styles, and it is known that group learning (collaborative learning) is more effective than individual learning. In colllaborative learning it is very important how to deternime the optimal combination of students in order to improve the learning effect In this paper we propose a method to improve the learning effect of collaborative learning resning. A neural network model is fiest applied for predicting learning result of pairs of students in collaborative learning. Then, in order to determine the opptimal pairs of students, a genetic algorithm is applied with the prediction result obtanined from the neural network. Based on this combination of students,we carried out an experiment of collaborative learning at a college in Japan. It was confirmed from the experimental results that the proposed method was effective.","PeriodicalId":342911,"journal":{"name":"2009 International Symposium on Autonomous Decentralized Systems","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-03-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116677024","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 : 2009-03-23DOI: 10.1109/ISADS.2009.5207388
I. Abe, Y. Nakamoto, Hiroyuki Terada, Tatsunori Osaki
The size and complexity of large-scale distributed embedded systems such as automotive and process control have increased recently. Sophisticated systems in distributed systems that are safe and environment friendly require numerous types of sensor data, which are collected from various devices and sent to computers through networks. In order to develop large-scale distributed embedded systems, distributed object technology such as CORBA is widely used. In this study, we focus our attention on MICO, an implementation of CORBA; we study the performance of MICO and the overhead of a sample distributed system. MICO can be used for developing an execution environment platform for distributed embedded system software.
{"title":"Approaches to evaluate performance of MICO as distributed automotive software platform","authors":"I. Abe, Y. Nakamoto, Hiroyuki Terada, Tatsunori Osaki","doi":"10.1109/ISADS.2009.5207388","DOIUrl":"https://doi.org/10.1109/ISADS.2009.5207388","url":null,"abstract":"The size and complexity of large-scale distributed embedded systems such as automotive and process control have increased recently. Sophisticated systems in distributed systems that are safe and environment friendly require numerous types of sensor data, which are collected from various devices and sent to computers through networks. In order to develop large-scale distributed embedded systems, distributed object technology such as CORBA is widely used. In this study, we focus our attention on MICO, an implementation of CORBA; we study the performance of MICO and the overhead of a sample distributed system. MICO can be used for developing an execution environment platform for distributed embedded system software.","PeriodicalId":342911,"journal":{"name":"2009 International Symposium on Autonomous Decentralized Systems","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-03-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133337597","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
扫码关注我们
求助内容：
应助结果提醒方式：