Wireless sensor networks (WSN) are inherently difficult to secure: Limited memory resources rule out the predistribution of keys or certificates, while manual device (and key) configuration in the field is not feasible due to the dynamic and ad-hoc nature of WSNs. All this is complicated by the fact that WSN nodes are not tamper resistant and operate over an unsecure wireless medium. Public key infrastructures (PKI) can help to address this problem by providing initial trust between network nodes. While it has been already shown, that public key encryption methods (like Elliptic Curve Cryptography - ECC) can be implemented on sensor nodes with very limited resources, a fully-fleshed PKI infrastructure that enables many different devices from potentially many different manufactures to participate in many different separate distributed networks in a secure manner has not been introduced yet. This paper presents AVCA, “Authentication using Virtual Certificate Authorities”, which is such a PKI architecture. It is based on commonly used and well established PKI concepts and designed specifically for resource constrained devices on distributed ad-hoc networks. It provides a mechanism to overcome the difficulties in securing many distributed networks with non tamper-proof devices. AVCA has many benefits including that the basis for initial trust is not stored on any of the sensor devices and that these devices do not require significant memory. The architecture itself can be quite easily integrated into existing protocol stacks including those defined by IEEE 802.15.4 [1] and ZigBee [2]. AVCA also enhances many of the original design goals of these wireless sensor network protocols such as simplicity, interoperability and scalability. The authors believe that AVCA offers a practical solution to many of the security issues that exist with sensor networks to date.
无线传感器网络(WSN)本身就难以保护:有限的内存资源排除了密钥或证书的预分发，而由于WSN的动态性和自组织性，在现场手动配置设备(和密钥)是不可实现的。由于WSN节点不能防篡改，并且在不安全的无线介质上运行，这一切都变得更加复杂。公钥基础设施(PKI)可以通过在网络节点之间提供初始信任来帮助解决这个问题。虽然已经证明，公钥加密方法(如椭圆曲线加密—ECC)可以在资源非常有限的传感器节点上实现，但尚未引入完整的PKI基础设施，该基础设施使来自潜在的许多不同制造商的许多不同设备能够以安全的方式参与许多不同的独立分布式网络。AVCA (Authentication using Virtual Certificate Authorities)是一种PKI体系结构。它基于常用和完善的PKI概念，专门为分布式ad-hoc网络上资源受限的设备设计。它提供了一种机制来克服使用非防篡改设备保护许多分布式网络的困难。AVCA有很多好处，包括初始信任的基础不存储在任何传感器设备上，这些设备不需要大量内存。该架构本身可以很容易地集成到现有的协议栈中，包括IEEE 802.15.4[1]和ZigBee[2]定义的协议栈。AVCA还增强了这些无线传感器网络协议的许多原始设计目标，如简单性、互操作性和可扩展性。作者认为，AVCA为迄今为止存在的许多传感器网络安全问题提供了一个实用的解决方案。
{"title":"Authentication Using Virtual Certificate Authorities: A New Security Paradigm for Wireless Sensor Networks","authors":"Edmond Holohan, M. Schukat","doi":"10.1109/NCA.2010.19","DOIUrl":"https://doi.org/10.1109/NCA.2010.19","url":null,"abstract":"Wireless sensor networks (WSN) are inherently difficult to secure: Limited memory resources rule out the predistribution of keys or certificates, while manual device (and key) configuration in the field is not feasible due to the dynamic and ad-hoc nature of WSNs. All this is complicated by the fact that WSN nodes are not tamper resistant and operate over an unsecure wireless medium. Public key infrastructures (PKI) can help to address this problem by providing initial trust between network nodes. While it has been already shown, that public key encryption methods (like Elliptic Curve Cryptography - ECC) can be implemented on sensor nodes with very limited resources, a fully-fleshed PKI infrastructure that enables many different devices from potentially many different manufactures to participate in many different separate distributed networks in a secure manner has not been introduced yet. This paper presents AVCA, “Authentication using Virtual Certificate Authorities”, which is such a PKI architecture. It is based on commonly used and well established PKI concepts and designed specifically for resource constrained devices on distributed ad-hoc networks. It provides a mechanism to overcome the difficulties in securing many distributed networks with non tamper-proof devices. AVCA has many benefits including that the basis for initial trust is not stored on any of the sensor devices and that these devices do not require significant memory. The architecture itself can be quite easily integrated into existing protocol stacks including those defined by IEEE 802.15.4 [1] and ZigBee [2]. AVCA also enhances many of the original design goals of these wireless sensor network protocols such as simplicity, interoperability and scalability. The authors believe that AVCA offers a practical solution to many of the security issues that exist with sensor networks to date.","PeriodicalId":276374,"journal":{"name":"2010 Ninth IEEE International Symposium on Network Computing and Applications","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-07-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116789358","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Service-oriented architecture (SOA) is a powerful distributed computing paradigm that provides high-level abstractions for developing, deploying, and executing distributed systems while hiding many platform-level details. SOA platforms host functionality as deployed services, support decoupled interaction between service providers and service consumers, and manage low-level plumbing and dispatching among various deployed components. As with any distributed computing platform, SOA presents challenges for security and survivability beyond those that exist in more static and local platforms. As SOA platforms become popular and more widely used in a variety of distributed systems, it is important to explore their security challenges and vulnerabilities, and to understand how well those are addressed by the current security features of SOA platforms. This paper reports on a case study that evaluated the vulnerability profile of a SOA platform based on the popular open source JBoss Application Server.
{"title":"Understanding the Vulnerabilities of a SOA Platform - A Case Study","authors":"A. Gronosky, M. Atighetchi, P. Pal","doi":"10.1109/NCA.2010.32","DOIUrl":"https://doi.org/10.1109/NCA.2010.32","url":null,"abstract":"Service-oriented architecture (SOA) is a powerful distributed computing paradigm that provides high-level abstractions for developing, deploying, and executing distributed systems while hiding many platform-level details. SOA platforms host functionality as deployed services, support decoupled interaction between service providers and service consumers, and manage low-level plumbing and dispatching among various deployed components. As with any distributed computing platform, SOA presents challenges for security and survivability beyond those that exist in more static and local platforms. As SOA platforms become popular and more widely used in a variety of distributed systems, it is important to explore their security challenges and vulnerabilities, and to understand how well those are addressed by the current security features of SOA platforms. This paper reports on a case study that evaluated the vulnerability profile of a SOA platform based on the popular open source JBoss Application Server.","PeriodicalId":276374,"journal":{"name":"2010 Ninth IEEE International Symposium on Network Computing and Applications","volume":"51 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-07-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122366422","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}
Recent advances in wireless communications technology and low-power, low-cost CMOS imaging sensors enable a new sensing modality employing ubiquitous distributed video sensing. In many video sensing applications multimedia streams are often required by the base station to provide detailed information of the target spot in the sensor field. However, limited bandwidth, unstable network environment, and data transmission interference prevent the large-scale deployment of such applications without new strategies for energy and data capacity management. In this paper we propose a dynamic path formation algorithm based on our data path throughput estimation model. Coupled with a distributed TDMA packet scheduling scheme, this path formation algorithm can establish throughput-aware video delivery path between source and destination. OPNET simulation results indicate that the throughput estimation is accurate and our proposed TDMA scheme is preferred for streaming applications. We also explore the use of distributed mobile base stations as an option to improve the egress of video data streams from the system.
{"title":"QoS-enabled Video Streaming in Wireless Sensor Networks","authors":"Song Guo, T. Little","doi":"10.1109/NCA.2010.38","DOIUrl":"https://doi.org/10.1109/NCA.2010.38","url":null,"abstract":"Recent advances in wireless communications technology and low-power, low-cost CMOS imaging sensors enable a new sensing modality employing ubiquitous distributed video sensing. In many video sensing applications multimedia streams are often required by the base station to provide detailed information of the target spot in the sensor field. However, limited bandwidth, unstable network environment, and data transmission interference prevent the large-scale deployment of such applications without new strategies for energy and data capacity management. In this paper we propose a dynamic path formation algorithm based on our data path throughput estimation model. Coupled with a distributed TDMA packet scheduling scheme, this path formation algorithm can establish throughput-aware video delivery path between source and destination. OPNET simulation results indicate that the throughput estimation is accurate and our proposed TDMA scheme is preferred for streaming applications. We also explore the use of distributed mobile base stations as an option to improve the egress of video data streams from the system.","PeriodicalId":276374,"journal":{"name":"2010 Ninth IEEE International Symposium on Network Computing and Applications","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-07-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114629521","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Wireless Mesh Networks (WMN) provide a flexible and inexpensive way to expand network applications to mobile entities. However, high communication reliability demands can not be met by regular WMNs due to mobility and inherent properties of wireless communication. Failing links are common events which impose a major challenge for providing a dependable communication service. By the use of suitable cross-layer models, we provide a timely detection of failed links without compromising the network stability. It is shown that the packet loss caused by a link failure can be reduced from a time-dependent value to at most four consecutive packets. For a typical control application this means an improvement by a factor of 100. In addition to an empirical evaluation we demonstrate the applicability of the mechanism by utilizing it in a real-world WMN to allow the tele-operation of a mobile robot.
{"title":"Modeling Fast Link Failure Detection for Dependable Wireless Mesh Networks","authors":"Timo Lindhorst, G. Lukas, E. Nett","doi":"10.1109/NCA.2010.13","DOIUrl":"https://doi.org/10.1109/NCA.2010.13","url":null,"abstract":"Wireless Mesh Networks (WMN) provide a flexible and inexpensive way to expand network applications to mobile entities. However, high communication reliability demands can not be met by regular WMNs due to mobility and inherent properties of wireless communication. Failing links are common events which impose a major challenge for providing a dependable communication service. By the use of suitable cross-layer models, we provide a timely detection of failed links without compromising the network stability. It is shown that the packet loss caused by a link failure can be reduced from a time-dependent value to at most four consecutive packets. For a typical control application this means an improvement by a factor of 100. In addition to an empirical evaluation we demonstrate the applicability of the mechanism by utilizing it in a real-world WMN to allow the tele-operation of a mobile robot.","PeriodicalId":276374,"journal":{"name":"2010 Ninth IEEE International Symposium on Network Computing and Applications","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-07-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131360362","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}
Many studies in SoC (System-on-Chip) areas ignore the scheduling of messages exchanged between hardware-software components as a fine level of inter-component communication granularity. Such a message scheduling scheme in hardware-software codesign of SoC systems has received comparatively less attention in the literature despite their importance as an element of a complete partitioning solution. In this paper, we attempt to resolve a message scheduling problem to meet the semantics of inter-component communications. Additionally, we evaluate the performance of hardware-software codesign for network protocol stacks.
{"title":"Evaluation of a Hardware-Software Codesign Technique of Network Protocol Stacks","authors":"Taehoon Kim, S. Tak","doi":"10.1109/NCA.2010.49","DOIUrl":"https://doi.org/10.1109/NCA.2010.49","url":null,"abstract":"Many studies in SoC (System-on-Chip) areas ignore the scheduling of messages exchanged between hardware-software components as a fine level of inter-component communication granularity. Such a message scheduling scheme in hardware-software codesign of SoC systems has received comparatively less attention in the literature despite their importance as an element of a complete partitioning solution. In this paper, we attempt to resolve a message scheduling problem to meet the semantics of inter-component communications. Additionally, we evaluate the performance of hardware-software codesign for network protocol stacks.","PeriodicalId":276374,"journal":{"name":"2010 Ninth IEEE International Symposium on Network Computing and Applications","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-07-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132055832","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}
Size-based task assignment policies have shown significant performance improvements over traditional task assignment policies under highly variable workload conditions. However, these policies are not suitable to assign tasks in time sharing systems. Moreover, these policies are not scalable and they also generate significant amount of wasted processing. This paper proposes a Multi-Level-Multi-Server Task Assignment Policy with Work-Conserving Migration (MLMS-WC-M) that addresses these issues. MLMS-WC-M has three important features. First, it gives preferential treatment to tasks with short processing requirements. Second, it utilises a 2-level variance reduction mechanism. Third, it supports work-conserving migration. We evaluate the performance of MLMS-WC-M against the performance of several well known task assignment policies. The proposed policy outperforms existing policies significantly under a wide range of workload conditions.
{"title":"Multi-level Multi-server Task Assignment with Work-Conserving Migration","authors":"Malith Jayasinghe, Z. Tari, P. Zeephongsekul","doi":"10.1109/NCA.2010.31","DOIUrl":"https://doi.org/10.1109/NCA.2010.31","url":null,"abstract":"Size-based task assignment policies have shown significant performance improvements over traditional task assignment policies under highly variable workload conditions. However, these policies are not suitable to assign tasks in time sharing systems. Moreover, these policies are not scalable and they also generate significant amount of wasted processing. This paper proposes a Multi-Level-Multi-Server Task Assignment Policy with Work-Conserving Migration (MLMS-WC-M) that addresses these issues. MLMS-WC-M has three important features. First, it gives preferential treatment to tasks with short processing requirements. Second, it utilises a 2-level variance reduction mechanism. Third, it supports work-conserving migration. We evaluate the performance of MLMS-WC-M against the performance of several well known task assignment policies. The proposed policy outperforms existing policies significantly under a wide range of workload conditions.","PeriodicalId":276374,"journal":{"name":"2010 Ninth IEEE International Symposium on Network Computing and Applications","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-07-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131065492","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
In this paper, we present a geographic routing algorithm which can adapt to different levels of mobility by changing its parameters according to the network in which it is running. Routing decisions are based on directions and geographical positions of the nodes and there is no need for an external location system. Discoveries are done using unicast messages resulting in few control messages being sent both to discover and to maintain routing information. After a series of tests, we show the algorithm low overhead, high adaptability and robustness as it only relies on the end-points (source and destination nodes) to guarantee a successful transmission.
{"title":"A Geographic Unicast Routing Algorithm Using no Location Service","authors":"D. Silvestre, T. Vazão","doi":"10.1109/nca.2010.52","DOIUrl":"https://doi.org/10.1109/nca.2010.52","url":null,"abstract":"In this paper, we present a geographic routing algorithm which can adapt to different levels of mobility by changing its parameters according to the network in which it is running. Routing decisions are based on directions and geographical positions of the nodes and there is no need for an external location system. Discoveries are done using unicast messages resulting in few control messages being sent both to discover and to maintain routing information. After a series of tests, we show the algorithm low overhead, high adaptability and robustness as it only relies on the end-points (source and destination nodes) to guarantee a successful transmission.","PeriodicalId":276374,"journal":{"name":"2010 Ninth IEEE International Symposium on Network Computing and Applications","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-07-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131072518","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}
S. Karunasekera, C. Mendis, A. Skvortsov, A. Gunatilaka
Due to the significant amount of energy consumed by chemical sensors for sensing, reducing sensing activity is critical for improving the lifespan of chemical sensor networks. In this paper, we consider a simple decentralized dynamic sensor activation protocol that aims to maintain a majority of sensors in the inactive (passive) state in the absence of a chemical attack, and rapidly activate the sensors when an attack is detected. This paper proposes two analytical models to study the behavior of the sensor network under the proposed protocol. Our first analytical model employs the known analogy between the information spread in a sensor network and the propagation of epidemics across a population. The second model describes the protocol by using a framework of graph theory
{"title":"A Decentralized Dynamic Sensor Activation Protocol for Chemical Sensor Networks","authors":"S. Karunasekera, C. Mendis, A. Skvortsov, A. Gunatilaka","doi":"10.1109/NCA.2010.39","DOIUrl":"https://doi.org/10.1109/NCA.2010.39","url":null,"abstract":"Due to the significant amount of energy consumed by chemical sensors for sensing, reducing sensing activity is critical for improving the lifespan of chemical sensor networks. In this paper, we consider a simple decentralized dynamic sensor activation protocol that aims to maintain a majority of sensors in the inactive (passive) state in the absence of a chemical attack, and rapidly activate the sensors when an attack is detected. This paper proposes two analytical models to study the behavior of the sensor network under the proposed protocol. Our first analytical model employs the known analogy between the information spread in a sensor network and the propagation of epidemics across a population. The second model describes the protocol by using a framework of graph theory","PeriodicalId":276374,"journal":{"name":"2010 Ninth IEEE International Symposium on Network Computing and Applications","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-07-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129539808","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}
Charlie Wiseman, Jyoti Parwatikar, Kenneth F. Wong, J. DeHart, J. Turner
Networking testbeds have become an increasingly important part of the networking research cycle. One of the primary reasons for this is that testbeds offer researchers access to network conditions and environments which are very difficult to reproduce in a local laboratory. This work presents the design of the Open Network Laboratory (ONL) testbed. The underlying infrastructure of ONL is general enough to support resource extensibility and heterogeneity at a fundamental level. New types of resources (e.g., multicore PCs, FPGAs, network processors, etc) can be added to the testbed without modifying any testbed infrastructure software. Resource types can also be extended to support multiple distinct sets of functionality (e.g., an FPGA might act as a router, a switch, or a traffic generator). Moreover, users can dynamically add new resource extensions without any modification to the existing infrastructure.
{"title":"Design of an Extensible Network Testbed","authors":"Charlie Wiseman, Jyoti Parwatikar, Kenneth F. Wong, J. DeHart, J. Turner","doi":"10.1109/NCA.2010.22","DOIUrl":"https://doi.org/10.1109/NCA.2010.22","url":null,"abstract":"Networking testbeds have become an increasingly important part of the networking research cycle. One of the primary reasons for this is that testbeds offer researchers access to network conditions and environments which are very difficult to reproduce in a local laboratory. This work presents the design of the Open Network Laboratory (ONL) testbed. The underlying infrastructure of ONL is general enough to support resource extensibility and heterogeneity at a fundamental level. New types of resources (e.g., multicore PCs, FPGAs, network processors, etc) can be added to the testbed without modifying any testbed infrastructure software. Resource types can also be extended to support multiple distinct sets of functionality (e.g., an FPGA might act as a router, a switch, or a traffic generator). Moreover, users can dynamically add new resource extensions without any modification to the existing infrastructure.","PeriodicalId":276374,"journal":{"name":"2010 Ninth IEEE International Symposium on Network Computing and Applications","volume":"106 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-07-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121289027","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}
Jesper Grønbæk, H. Schwefel, A. Ceccarelli, A. Bondavalli
Performing decentralized network fault diagnosis based on network traffic is challenging. Besides inherent stochastic behaviour of observations, measurements may be subject to errors degrading diagnosis timeliness and accuracy. In this paper we present a novel approach in which we aim to mitigate issues of measurement errors by quantifying uncertainty. The uncertainty information is applied in the diagnostic component to improve its robustness. Three diagnosis components have been proposed based on the Hidden Markov Model formalism: (H0) representing a classical approach, (H1) a static compensation of (H0) to uncertainties and (H2) dynamically adapting diagnosis to uncertainty information. From uncertainty injection scenarios of added measurement noise we demonstrate how using uncertainty information can provide a structured approach of improving diagnosis.
{"title":"Improving Robustness of Network Fault Diagnosis to Uncertainty in Observations","authors":"Jesper Grønbæk, H. Schwefel, A. Ceccarelli, A. Bondavalli","doi":"10.1109/NCA.2010.41","DOIUrl":"https://doi.org/10.1109/NCA.2010.41","url":null,"abstract":"Performing decentralized network fault diagnosis based on network traffic is challenging. Besides inherent stochastic behaviour of observations, measurements may be subject to errors degrading diagnosis timeliness and accuracy. In this paper we present a novel approach in which we aim to mitigate issues of measurement errors by quantifying uncertainty. The uncertainty information is applied in the diagnostic component to improve its robustness. Three diagnosis components have been proposed based on the Hidden Markov Model formalism: (H0) representing a classical approach, (H1) a static compensation of (H0) to uncertainties and (H2) dynamically adapting diagnosis to uncertainty information. From uncertainty injection scenarios of added measurement noise we demonstrate how using uncertainty information can provide a structured approach of improving diagnosis.","PeriodicalId":276374,"journal":{"name":"2010 Ninth IEEE International Symposium on Network Computing and Applications","volume":"51 3","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-07-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133288534","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
扫码关注我们
求助内容：
应助结果提醒方式：