Abstract

Abstract
The use of Wireless Sensor Network (WSN) based technologies is an attractive solution for large-scale sensing applications (wide area deployment), such as environmental monitoring, precision agriculture and industrial automation. IEEE 802.15.4/ZigBee standards are the most used communication protocols for WSN technologies, where the cluster-tree topology is pointed out as a suitable topology to support the implementation of large-scale WSNs. These networks are usually scheduled to prioritise convergecast (upstream) traffic generated from sensor nodes toward the sink node. However, this scheduling pattern results in higher delays for control messages (downstream traffic). Within this context, this paper proposes a Hybrid Beacon Scheduling (Fast-HyBeS) scheme to enable the periodic reconfiguration of cluster-tree WSNs. The underlying idea is to periodically schedule a downstream opportunity window, to allow a faster dissemination of control messages. This opportunity window follows a top-down scheduling approach that prioritises the downstream traffic. Simulation results show that the use of Fast-HyBeS can significantly decrease the end-to-end communication delay for control messages, when compared to the use of static convergecast scheduling schemes. Moreover, the simulation results also highlight that the Fast-HyBeS has a negligible impact upon end-to-end communication delays of the monitoring traffic.

Abstract
Area coverage is an inherent and important topic when dealing with wireless visual sensor networks, since it may be desired when addressing availability and fault tolerance in critical applications. This problem arises because more than one visual sensor may cover the same area, generating overlapped regions that can be exploited for different kinds of optimization and quality enhancement approaches. Actually, some methods to compute the resulted covered area by a set of sensors have been proposed, and they are initial steps to compute availability metrics that are necessary for many monitoring scenarios. Particularly, approximate approaches are promising when computing area coverage, potentially achieving good results, although such methods lack proper evaluation and analysis about complexity, performance and precision. In this context, we perform an evaluation of a recent algorithm based on approximation for area coverage computing, comparing it with a precise algorithm developed in this work for this purpose. Doing so, it is desired to assess performance and accuracy of both algorithms, indicating the most appropriate approach when addressing availability in visual sensor networks.

Abstract
In this paper, the RT-WiFi architecture is proposed to handle real-time (RT) communication in infrastructured IEEE 802.11 networks operating in high density industrial environments. This architecture is composed of a time division multiple access (TDMA)-based coordination layer that schedules the medium access of RT traffic flows, and an underlying traffic separation mechanism that is able do handle the coexistence of RT and non-RT traffic sources in the same communication environment. The simulation assessment considers an overlapping basic service set (OBSS), where a set of RT and non-RT stations share the same frequency band. The performance assessment compares the behaviour of the RT-WiFi architecture vs. the behaviour of standard distributed coordination function (DCF), point coordination function (PCF), enhanced distributed channel access (EDCA), and hybrid coordination function (HCF) controlled channel access (HCCA) medium access control mechanisms. A realistic error-prone model has been used to measure the impact of message losses in the RT-WiFi architecture. It is shown that the proposed RT-WiFi architecture offers a significantly enhanced behaviour when compared with the use of IEEE 802.11 standard mechanisms, in what concerns average deadline misses and average access delays. Moreover, it also offers an almost constant access delay, which is a relevant characteristic when supporting RT applications.

Abstract
Wireless visual sensor networks (WVSN) bring a more comprehensive perception of monitored environments, leading to an increase adoption of such networks as a promising solution for a wide range of applications. Among many examples, highlight industrial applications related to the industry 4.0 paradigm, which increasingly require more data from manufacturing systems. Those sensor-based applications are in many cases safety-critical, requiring dependability guarantees mainly related with reliability and availability, that should be maintained during the whole network operation. Although several approaches have provided network deployment with dependability guarantees, sometimes the monitored environment or the application configurations can change during the network operation, which can violate the dependability requirements and demand network redeployment in order to keep those guarantees. In this paper we propose a novel algorithm to redeploy WVSN guided by the optimization of the application dependability, considering changes on cameras' orientations. A methodology is defined to support dependability analysis. We compare the results of the proposed algorithm with previous algorithms found in literature. The achieved results show that the proposed algorithm is useful and efficient to provide network redeployment, keeping or improving the application dependability.

Abstract
The development of efficient sensing technologies and the maturation of the Internet of Things (IoT) paradigm and related protocols have considerably fostered the expansion of sensor-based monitoring applications. A great number of those applications has been developed to monitor a set of information for better perception of the environment, with some of them being dedicated to identifying emergency situations. Current IoT-based emergency systems have limitations when considering the broader scope of smart cities, exploiting one or just a few monitoring variables or even allocating high computational burden to regular sensor nodes. In this context, we propose a distributed multi-tier emergency alerting system built around a number of sensor-based event detection units, providing real-time georeferenced information about the occurrence of critical events, while taking as input a configurable number of different scalar sensors and GPS data. The proposed system could then be used to detect and to deliver emergency alarms, which are computed based on the detected events, the previously known risk level of the affected areas and temporal information. Doing so, modularized and flexible perceptions of critical events are provided, according to the particularities of each considered smart city scenario. Besides implementing the proposed system in open-source electronic platforms, we also created a real-time visualization application to dynamically display emergency alarms on a map, demonstrating a feasible and useful application of the system as a supporting service. Therefore, this innovative approach and its corresponding physical implementation can bring valuable results for smart cities, potentially supporting the development of adaptive IoT-based emergency-aware applications.