The first step in the diagnosis of failure occurrences in discrete event systems is the verification of the system diagnosability. Several works have addressed this problem using either diagnosers or verifiers for both centralized and decentralized architectures. In this technical note, we propose a new algorithm to verify decentralized diagnosability of discrete event systems. The proposed algorithm requires polynomial time in the number of states and events of the system and has lower computational complexity than all other methods found in the literature. In addition, it can also be applied to the centralized case.Index Terms-Automata, computational complexity, diagnosability verification, discrete-event systems (DES), failure diagnosis.

Wireless sensor networks have been considered as an effective solution to a wide range of applications due to their prominent characteristics concerning information retrieving and distributed processing. When visual information can be also retrieved by sensor nodes, applications acquire a more comprehensive perception of monitored environments, fostering the creation of wireless visual sensor networks. As such networks are being more often considered for critical monitoring and control applications, usually related to catastrophic situation prevention, security enhancement and crises management, fault tolerance becomes a major expected service for visual sensor networks. A way to address this issue is to evaluate the system dependability through quantitative attributes (e.g., reliability and availability), which require a proper modeling strategy to describe the system behavior. That way, in this paper, we propose a methodology to model and evaluate the dependability of wireless visual sensor networks using Fault Tree Analysis and Markov Chains. The proposed modeling strategy considers hardware, battery, link and coverage failures, besides considering routing protocols on the network communication behavior. The methodology is automated by a framework developed and integrated with the SHARPE (Symbolic Hierarchical Automated Reliability and Performance Evaluator) tool. The achieved results show that this methodology is useful to compare different network implementations and the corresponding dependability, enabling the uncovering of potentially weak points in the network behavior.

Wireless sensor networks comprising nodes equipped with cameras have become common in many scenarios, providing valuable visual data for some relevant services such as localization, tracking, patterns identification and emergencies detection. In this context, algorithms and optimization approaches have been designed to perform different types of quality assessment or performance enhancement tasks, addressing challenging issues such as networking, compression, availability, reliability, security, energy efficiency and virtually any subject related to the operational challenges of those networks. However, the dynamics of coverage failures have not been properly modelled in visual sensor networks, resulting in unrealistic perceptions when optimizing or assessing quality in most visual sensing scenarios. Particularly, the Field of View of visual sensors will be affected by occlusion caused by obstacles in the monitored field, which may turn such sensors inadequate for the expected monitoring services of the considered network. Therefore, this article proposes a mathematical model to assess occlusion caused by mobile obstacles such as vehicles on a road or forklifts in an industrial plant, aiming at the selection of the visual sensor nodes that will not have their coverage significantly restricted by those obstacles. Doing so, the proposed model can be exploited by any optimization or quality assessment approach in wireless visual sensor networks, providing a preprocessing method when selecting visual nodes. INDEX TERMS Wireless sensor networks, visual sensing, sensors selection, coverage failures, mathematical modelling.

Wireless visual sensor networks are commonly employed on several applications contexts such as smart cities, intelligent transportation systems and industrial management, aiming at the use of visual data from cameras to provide enhanced information and to expand the networks utilities. In these scenarios, some applications may require high-definition images when performing more specialized tasks, for example in face and text recognition, adding an important monitoring requirement when using camera-based sensors. In fact, it is important to ensure that the network is able to gather visual data with the associated required quality to each task, and such perceived quality may be processed as a function of the Field of View (FoV) of the visual sensors. In order to address this issue, new quality metrics are proposed for wireless visual sensor networks that are deployed to perform area coverage, exploiting for that different perceptions of the FoV. Those metrics are proposed along with redeployment optimization methods for visual sensor nodes aiming at the improvement of the perceived monitoring quality, which are based on greedy and evolutionary-based approaches. The proposed metrics and algorithms are expected to be more realistic than previous solutions, allowing flexible processing of variables as cameras' positions, orientations and viewing angles, providing then high flexibility on the definition of parameters and significantly contributing to the development of sensor networks based on visual sensors. INDEX TERMS Wireless sensor networks, Area coverage, Optimization, Visual quality, Quality of monitoring, Quality metric, Visual sensing, Field of view, Mathematical modelling.

No abstract

No abstract

No abstract

No abstract