Search

Emergency vehicles have been employed in rescue operations and supportive services, attending victims and managing critical situations in smart cities. Such vehicles, notably ambulances, fire trucks, police cars and transit agents vehicles, may be tracked and monitored in some applications for different functions. When such emergency vehicles are not equipped with GPS receivers, cameras can be used to view emergency signs printed on them, allowing indirect identification of emergency vehicles, although many complexities have to be considered when performing visual sensors-based tracking and monitoring. In this context, this paper proposes a mathematical model focused on the evaluation of the coverage efficiency of a group of visual sensors over moving vehicles, aimed at visual coverage of emergency signs. For that, vehicles, emergency signs and visual sensors are mathematically modelled in this paper, with coverage interactions among these elements being computed based on proposed geometry equations and algorithms. Doing so, the effectiveness of the positioning and configurations of visual sensors can be evaluated without requiring actual deployment, potentially reducing costs when assessing visual monitoring systems in this scenario.

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.

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.

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.

In critical industrial monitoring and control applications, dependability evaluation will be usually required. For wireless sensor networks deployed in industrial plants, dependability evaluation can provide valuable information, enabling proper preventive or contingency measures to assure their correct and safe operation. However, when employing sensor nodes equipped with cameras, visual coverage failures may have a deep impact on the perceived quality of industrial applications, besides the already expected impacts of hardware and connectivity failures. This article proposes a comprehensive mathematical model for dependability evaluation centered on the concept of Quality of Monitoring (QoM), processing availability, reliability and effective coverage parameters in a combined way. Practical evaluation issues are discussed and simulation results are presented to demonstrate how the proposed model can be applied in wireless industrial sensor networks when assessing and enhancing their dependability.

The adoption of sensors-based monitoring systems supported by Internet of Things technologies has opened new possibilities for data retrieving and processing in urban areas. Among such possibilities, emergencies management is expected to play an important role in how modern cities will evolve, reducing the negative impacts of critical events and improving the quality of life perceived by their inhabitants. Actually, when an emergency is detected and alerted, emergency vehicles, notably ambulances, fire trucks, police cars and transit agents vehicles, should be quickly assigned to respond to that situation, as soon as possible. In this context, we propose a dynamic algorithm to automatically assign emergency vehicles in smart city scenarios, exploiting for that a sensors-based emergency detection system to provide emergency alerts. The proposed algorithm can then be used to quickly assign a number of emergency vehicles in the first moments of an emergency, which can potentially save lives and improve existing crisis management applications in smart cities.

Wireless sensor networks (WSNs) can be used to support monitoring activities in a wide range of applications and communication environments. Its usage in extreme conditions, in what concerns pressure, temperature, and humidity, must be carefully assessed before the network deployment. In particular, the temperature variations have a direct impact upon the behavior of WSNs through the batteries of sensor nodes. These electrochemical devices are highly susceptible to temperature variations, which modifies the offered effective charge capacity. In this context, it is difficult to estimate the behavior of batteries over time, impairing the extraction of relevant information for energy-aware approaches. Such information, particularly battery state of charge, voltage, and lifetime, is often used by WSN simulators to predict the communication behavior in different scenarios. Nevertheless, WSN simulators generally use simplistic battery models, causing significant deviations in simulation results when compared with actual WSN deployments. This paper describes the implementation of the Temperature-Dependent Kinetic Battery Model (T-KiBaM) in the Castalia simulator, which enables a considerable improvement of the accuracy of simulations in communication environments with different temperature conditions. An experimental assessment has been performed with temperature variations over time to validate the usage of the T-KiBaM battery model. The experimental results indicate that the T-KiBaM model is quite accurate when estimating battery behavior under both different temperature set points and different temperature variations.

In this work we address a problem of practical relevance -the delivery of X.509 v3 digital certificates to end users on personal computers and smartphones- and we seek to describe the design, construction and evaluation of an artifact with which it is possible to solve it. Seven meta-requirements were defined, which have been instantiated into an artifact, which in turn has been empirically evaluated. The evaluation of the artifact has demonstrated its effectiveness based on actual use and perceived ease of use. The results of this work contribute to positioning personal computers and smartphones as alternative cryptographic modules to smart cards for some usage scenarios.

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.

The adoption of emergency alerting systems can bring countless benefits when managing urban areas, industrial plants, farms, roads and virtually any area that is subject to the occurrence of critical events, supporting in rescue operations and reducing their negative impacts. For such systems, a promising approach is to exploit scalar sensors to detect events of interest, allowing for the distributed monitoring of different variables. However, the use of cameras as visual sensors can enhance the detection of critical events, which can be employed along with scalar sensors for a more comprehensive perception of the environment. Although the particularities of visual sensing may be challenging in some scenarios, the combination of scalar and visual sensors for the early detection of emergency situations can be valuable for many scenarios, such as smart cities and industry 4.0, bringing promising results. Therefore, in this article, we extend a sensors-based emergency detection and alerting system to also exploit visual monitoring when identifying critical events. Implementation and experimental details are provided to reinforce the use of cameras as a relevant sensor unit, bringing promising results for emergencies management.

Nowadays one of the web browsers constraints is their limited capacity for interaction with end-user physical cryptographic devices, such as smart cards and cryptographic tokens. For this reason, in this article, we present an artifact that provides to web applications the ability to perform asymmetric cryptographic operations on the client-side using these devices. The artifact, designed as a service, presents two functions: (1) creation of electronic signatures of electronic documents and (2) electronic authentication of users into websites. It was designed with the purpose of allowing web developers to perform integrations in a simple and fast way. Through an empirical evaluation, in a controlled experiment, short-time integration was evidenced, confirming its potential usefulness for web developers.

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.

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.

Modern cities are subject to a lot of periodic or unexpected critical events, which may have different monitoring and control requirements according to the expected impacts on people safety and urban mobility. When multiple monitoring and automation systems are deployed, adaptive wireless sensor networks may adjust sensing and transmission configurations according to the detected events, optimizing the network overall operation. In this context, mobile sinks come as an effective way to enhance monitoring performance in smart city environments. However, practical issues related to the available roads and traffic load should be considered, allowing the computation of the best final positions and movement paths for each sink. Therefore, this paper proposes algorithms to compute dynamic sinks movement in reactive wireless sensor networks, supporting efficient adaptation to event-based monitoring in smart cities.

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 clustertree 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.

In the last decade, the FlexRay communication protocol has been promoted as a standard for dependable in-vehicular communications. In the FlexRay protocol, the communication timeline is organized as a sequence of four segments, whereas the Static Segment assigns a set of static slots for the transmission of synchronous messages. In this paper, we address the following problems: "How to efficiently transmit periodic messages in the Static Segment without requiring their periods to be multiples of, or to be synchronized with the FlexRay Communication Cycle?" "Is it possible to guarantee that periodic messages are transferred before their deadlines, without imposing such strict synchronization?" Unlike traditional approaches that use linear-programming based techniques, we evaluate the minimum number of allocated slots using traditional Response Time Analysis (RTA). The use of RTA techniques allows us to consider the timing requirements associated to each of the asynchronous message streams. Unlike other approaches, the RTA-based technique proposed in this paper: (a) is able to deal with message stream sets where periods are not multiple of the FlexRay cycle duration and (b) does not require the strict synchronization between tasks/signals at the application layer and slots at the FlexRay communication controller. The proposed slot allocation scheme may be of high practical interest when considering the interconnection of FlexRay/CAN in-vehicular communication systems, allowing the remapping of existing CAN message streams to FlexRay.

Wireless sensor networks are an emerging technology that can provide valuable information for a large series of monitoring and control applications. Comprising many monitoring scenarios with different particularities, as industrial management, weather forecasting, home automation, traffic management and rescue operations, just to cite a few, wireless sensor networks bring many possibilities for innovative applications that cannot be addressed by conventional wireless network technologies. When sensors are equipped with cameras or microphones, multimedia data can be retrieved from the monitored field, enriching the perception of the target area. However, the constrained nature of wireless sensor networks imposes many challenges to multimedia transmission, fostering development of optimized protocols. In this chapter, we present the state of the art of multimedia transmission in wireless sensor networks, covering topics as routing, error control, congestion avoidance, real-time delivery, compression and QoS, potentially supporting in the development of wireless multimedia sensor networks.

The operation of Wireless Sensor Networks (WSNs) is subject to multiple constraints, among which one of the most critical is available energy. Sensor nodes are typically powered by electrochemical batteries. The stored energy in battery devices is easily influenced by the operating temperature and the discharge current values. Therefore, it becomes difficult to estimate their voltage/charge behavior over time, which are relevant variables for the implementation of energy-aware policies. Nowadays, there are hardware and/or software approaches that can provide information about the battery operating conditions. However, this type of hardware-based approach increases the battery production cost, which may impair its use for sensor node implementations. The objective of this work is to propose a software-based approach to estimate both the state of charge and the voltage of batteries inWSN nodes based on the use of a temperature-dependent analytical battery model. The achieved results demonstrate the feasibility of using embedded analytical battery models to estimate the lifetime of batteries, without affecting the tasks performed by the WSN nodes.

Energy consumption is a major concern in Wireless Sensor Networks (WSNs) since nodes are powered by batteries. Usually, batteries have low capacity and can not be replaced due to economic and/or logistical issues. In addition, batteries are complex devices as they depend on electrochemical reactions to generate energy. As a result, batteries exhibit non-linear behaviour over time, which makes difficult to estimate their lifetime. Analytical battery models are abstractions that allow estimating the battery lifetime through mathematical equations, taking into account important effects such as rate capacity and charge recovery. The recovery effect is very important since it enables charge gains in the battery after its electrochemical stabilization. Sleep scheduling approaches may take advantage of the recovery effect by adding sleep periods in the node activities in order to extend the network lifetime. This work aims to analyse the recovery effect within WSN context, particularly regarding low-power nodes. To do so, we use an analytical battery model for analysing the battery performance over time, during the node execution.

Energy consumption is a major issue in Wireless Sensor Networks (WSNs), as nodes are powered by chemical batteries with an upper bounded lifetime. Estimating the lifetime of batteries is a difficult task, as it depends on several factors, such as operating temperatures and discharge rates. Analytical battery models can be used for estimating both the battery lifetime and the voltage behavior over time. Still, available models usually do not consider the impact of operating temperatures on the battery behavior. The target of this work is to extend the widely-used Kinetic Battery Model (KiBaM) to include the effect of temperature on the battery behavior. The proposed Temperature-Dependent KiBaM (T-KiBaM) is able to handle operating temperatures, providing better estimates for the battery lifetime and voltage behavior. The performed experimental validation shows that T-KiBaM achieves an average accuracy error smaller than 0.33%, when estimating the lifetime of Ni-MH batteries for different temperature conditions. In addition, T-KiBaM significantly improves the original KiBaM voltage model. The proposed model can be easily adapted to handle other battery technologies, enabling the consideration of different WSN deployments.

The IEEE 802.15.4/ZigBee standards support the implementation of cluster-tree networks, which are a suitable topology to deploy wide-scale networks. In this type of topology, an important issue is the configuration of the superframe duration that is allocated to each of the network clusters. In this paper, we propose an allocation scheme for setting-up these superframe duration values. The proposed scheme allocates adequate duration values for each cluster coordinator, based on the message load originated from its child nodes (including child coordinators and its descendants). The target of the proposed allocation scheme is to improve the network throughput and to reduce network congestion and dropped messages. Its main advantages are: 1) to have a balanced allocation of network resources to the different clusters; 2) the message generation at the application layer does not need to be synchronised with the beacon arrival; and 3) the message periods do not need to be multiple of the beacon interval.

Wireless sensor networks are being widely used to support time-critical applications, even knowing that previous versions of the IEEE 802.15.4 standard have a limited capacity to ensure a timely communication service. Its main limitation is the reduced number of available GTS slots. More recently, the IEEE 802.15.4e LLDN mode has been released to address this issue. It provides static TDMA-based communication, with a larger number of available slots to support time-critical communication. However, it does not provide any guidelines on how to allocate slots, in order to guarantee the message real-time requirements. In this paper, we propose a methodology to allocate LLDN slots based on the traffic load imposed by the supported message streams. The proposed allocation scheme is able to handle message streams with periodicities that are not multiple of the beacon interval, and also to support static and dynamic prioritizing of message streams.

The LLDN (Low Latency Deterministic Network) mode is a IEEE 802.15.4e amendment specifically designed for industrial applications requiring low latency and low loss rate. It is based on a static TDMA scheme composed of fixed-size slots. One of its limitations regards the support of messages with different sizes and different periodicities. In this paper, a slot allocation scheme is proposed, enabling the support of heterogeneous message streams. The rationale is to compute a suitable timeslot size to communication devices, enabling adaptive control of the superframe without changing the LLDN standard. This paper shows that it is possible to accommodate heterogeneous message streams while maintaining low cycle times when transmitting messages with variable payload.

In this paper, a new Traffic Separation mechanism (TSm) is proposed for CSMA-based networks. The TSm mechanism is intended to be used as an underlying traffic separation mechanism, able to prioritize traffic in CSMA-based networks. It allows the coexistence of standard CSMA (non-modified) stations with TSm (modified) stations in the same communication domain. When a station implementing the TSm mechanism has a high-priority message to transfer, it will impose its transfer prior to any message from standard CSMA stations. This behavior guarantees the highest transmitting probability to the TSm-enabled station in open communication environments. Therefore, the TSm approach can be used as an underlying mechanism to build real-time communication systems upon CSMA-based networks. The behavior of the TSm mechanism was assessed by simulation in the case of a relevant CSMA-based network (IEEE 802.11). The simulation analysis shows that the TSm mechanism guarantees values for both the throughput and the average access delay that significantly improve the results obtained for standard IEEE 802.11 stations.

X-by-wire applications have extremely demanding reliability requirements that are increasingly being addressed through the adoption of distributed and fault-tolerant architectures. The development of these applications is facilitated by the availability of high-level services such as agreement or reliable broadcast (RB). Some dependable communication buses, e.g., TTP-C, already provide these services, whereas FlexRay does not. In this paper, we present an approach to evaluate the reliability of a family of RB protocols implemented both on top of FlexRay and on top of ordinary time-division multiple access (TDMA). In particular, we evaluate the impact of the acknowledgment policy on the reliability of these protocols. We express the reliability as the probability of violation of the agreement and validity properties of the protocol during a mission. For that, we develop an analytical model based on discrete-time Markov chains, which considers a comprehensive set of faults (permanent, transient, omissive, and asymmetric) affecting both nodes and channels, and their effects on the protocol execution. The structure of the model is quite flexible and easily adaptable to other TDMA-based protocols. To assess the sensitivity of the protocol to both internal and external factors, we carried out a large number of experiments considering several network configurations and fault rates. The results show that for FlexRay, the negative-acknowledgment policy provides the same reliability as the positive-acknowledgment policy. However, for TDMA-based protocols that lack FlexRay's ability to distinguish silence from the loss of a message, the negative-acknowledgment policy leads to lower reliability, and its fitness for safety-critical applications depends on the system configuration and environment conditions.

Currently, there is a trend towards the implementation of industrial communication systems using wireless networks. However, keeping up with the timing constraints of real-time traffic in wireless environments is a hard task. The main reason is that real-time devices must share the same communication medium with timing unconstrained devices. The VTP-CSMA architecture has been proposed to deal with this problem. It considers an unified wireless system in one frequency band, where the communication bandwidth is shared by real-time and non-real-time communicating devices. The proposed architecture is based on a virtual token passing (VTP) procedure that circulates a virtual token among real-time devices. This virtual token is complemented by an underlying traffic separation mechanism that prioritizes the real-time traffic over the non-real-time traffic. This is one of the most innovative aspects of the proposed architecture, as most part of real-time communication approaches are not able to handle timing unconstrained traffic sharing the same communication medium. A ring management procedure for the VTP-CSMA architecture is also proposed, allowing real-time stations to adequately join/leave the virtual ring.

The IEEE 802.11 standard has been evolving over the past decade, introducing a set of new mechanisms at the MAC layer to improve the Quality of Service (QoS) provided to the communication. Among such improvements, we highlight the evolution from earlier DCF and PCF, until more recent EDCA and HCCA MAC layer mechanisms. In this paper we perform a simulation assessment of these four MAC mechanisms, evaluating their ability to support real-time (RT) communication. More specifically, we assess their ability to handle RT traffic in open communication environments composed of RT and non-RT stations operating in the same frequency channel and coverage area. The target of this paper is to highlight and understand the limitations of each mechanism when supporting RT communication. We show that for most of the situations, including less demanding scenarios, these mechanisms are not adequate to support RT traffic.

The IEEE 802.15.4/ZigBee set of standards is one of the most used wireless sensor network technologies. This set of standards supports cluster-tree networks, which are suitable topologies for wide-scale deployments. The design of wide-scale wireless sensor networks is a challenging task because it is difficult to test, analyse and validate new designs in real scenarios. Thus, simulation becomes a convenient and feasible method for its assessment before deployment. Within this context, we provide a set of simulation models for IEEE 802.15.4/ZigBee-based networks, which are able to deal with wide-scale cluster-tree wireless sensor networks and to address their major challenges. The provided simulation models implement important mechanisms for the assessment of wide-scale cluster-tree networks and associated data communication mechanisms, enabling an easier design and test of wide-scale wireless sensor network implementations.

With the widespread deployment of wireless mesh networks (WMNs) in industrial environments, real-time (RT) communication may benefit from the multi-hop relaying infrastructure provided by WMNs. However, RT communication must be able to coexist with non-RT traffic sources that will interfere with RT communication. Within this context, this paper assesses the impact of interferences caused by non-RT traffic sources upon RT traffic in IEEE 802.11s mesh networks. Through an extensive set of simulations, we assess the impact of external traffic sources upon a set of RT message streams in different communication scenarios. According to the simulation results, we infer that RT traffic in 802.11s networks may be highly affected by external interferences, and therefore, such interferences must be taken into account when setting-up 802.11s networks. By varying the network load imposed by external interferences, we provide some useful hints about utilization thresholds above which the network can no longer reliably support RT traffic. We also present insights about the setting-up of some network parameters in order to optimize the RT communication performance.

Wireless visual sensor networks provide valuable information for many monitoring and control applications. Sometimes, a set of targets needs to be monitored by deployed visual sensors. For those networks, however, some active visual sources may fail, potentially degrading the application monitoring quality when targets become uncovered. Moreover, some applications may need different perspectives of the same target. As visual sensors will be used to monitor a set of targets, a high level of monitoring redundancy may be required and an effective way to achieve it is assuring that targets are being concurrently viewed by more than one visual sensor. We propose a centralized greedy algorithm to enhance redundancy in wireless visual sensor networks when visual sensors with adjustable orientations are deployed. Additionally, as some targets may be more critical for the application, we propose a priority-based configuration of the sensors' poses in order to achieve an optimized configuration for the visual sensors.

Wireless sensor networks can provide valuable information for a lot of measurement, tracking, surveillance, automation, and general-purpose monitoring applications. Information as humidity, temperature, pressure, infrared images, and noises will be sensed and packetized for distribution over the network, but corruption during transmission may compromise the accuracy of the retrieved information and even put people in danger. In fact, the sensed data may have different relevancies for the applications, altering the impact of packet corruptions. We propose a relevance-based partially reliable transmission approach to provide data delivery with different reliability guaranties, exploiting the relevancies of transmitted data when choosing the proper error recovery service. In this context, some error scenarios are investigated, considering different configurations of error bursts. We expect that the proposed partially reliable transmission mechanism can save energy over the network while assuring acceptable quality for sensing monitoring.

Fault Tolerance for Flexible Time-Triggered Ethernet-based systems (FT4FTT) is a project to devise an architecture for distributed embedded systems that provides both flexibility to changing real-time requirements and high reliability through fault tolerance. One of the key parts of such an architecture is the communication subsystem. When designing such a subsystem many decisions have to be made. To understand how such decisions impact the reliability of the final design, in this paper we present a framework to evaluate the reliability of a large number of potential designs. The approach is based on storing a finite subset of the design space for the communication subsystem of FT4FTT in an undirected graph and then generating a continuous-time Markov chain from the graph to evaluate the reliability of each design belonging to the subset.

The IEEE 802.15.4 standard proposes a flexible communication solution for Low-Rate Wireless Personal Area Networks, including Wireless Sensor Networks. In these networks, the transmission of messages or the Guaranteed Time Slot allocation are coordinated by the traditional CSMA/CA scheme, which does not provide any additional traffic differentiation mechanism. In a previous work, we proposed an approach that assigns priorities to the messages based on the (m, k)-firm task model. This paper proposes, in a complementary way, an experimental assessment in order to define the best parameters for messages prioritization. The experimental assessment considers a realistic scenario in which a set of sensor nodes, implementing the proposed scheme works in the same coverage area of another set of nodes that does not belong to the same Wireless Sensor Networks infrastructure.

Wireless visual sensor networks have been considered for a large set of monitoring applications related with surveillance, tracking and multipurpose visual monitoring. When sensors are deployed over a monitored field, permanent faults may happen during the network lifetime, reducing the monitoring quality or rendering parts or the entire network unavailable. In a different way from scalar sensor networks, camera-enabled sensors collect information following a directional sensing model, which changes the notions of vicinity and redundancy. Moreover, visual source nodes may have different relevancies for the applications, according to the monitoring requirements and cameras' poses. In this paper we discuss the most relevant availability issues related to wireless visual sensor networks, addressing availability evaluation and enhancement. Such discussions are valuable when designing, deploying and managing wireless visual sensor networks, bringing significant contributions to these networks.

Wireless Sensor Networks (WSNs) can be used to monitor hazardous and inaccessible areas. In these situations, the power supply (e.g. battery) of each node cannot be easily replaced. One solution to deal with the limited capacity of current power supplies is to deploy a large number of sensor nodes, since the lifetime and dependability of the network will increase through cooperation among nodes. Applications on WSN may also have other concerns, such as meeting temporal deadlines on message transmissions and maximizing the quality of information. Data fusion is a well-known technique that can be useful for the enhancement of data quality and for the maximization of WSN lifetime. In this paper, we propose an approach that allows the implementation of parallel data fusion techniques in IEEE 802.15.4 networks. One of the main advantages of the proposed approach is that it enables a trade-off between different user-defined metrics through the use of a genetic machine learning algorithm. Simulations and field experiments performed in different communication scenarios highlight significant improvements when compared with, for instance, the Gur Game approach or the implementation of conventional periodic communication techniques over IEEE 802.15.4 networks.

In this paper we propose a novel approach, named Real-Time Alternative-Route Definition (RT-ARounD), to support real-time message streams over large-scale wireless sensor networks. Starting from a standard cluster-tree topology, where each cluster has active and inactive periods, the proposal selects a set of nodes to build a mesh topology which is used during the inactive periods of the respective clusters to transmit messages with real-time requirements. This new topology is built considering shortest path routes between source and sink nodes. In that way, the number of hops that a real-time message needs to transverse can be drastically reduced, thereby improving the real-time responsiveness of the overall network. Moreover, the use of the inactive period guarantees that the normal cluster-tree operation remains unaffected.

Wireless sensor networks have been employed as an effective tool for a large set of monitoring applications, directly supporting applications not addressed by conventional Internet-based technologies. Camera-enabled sensors enhance the applicability of those networks allowing innovative visual monitoring functions. Sometimes, source nodes will perform real-time monitoring of an area of interest, where visual data packets will need to be transmitted with minimum delay. However, energy depletion of the nodes that compose the transmission paths may hamper the network capability to deliver packets with time constraints. In such context, we propose a delay-aware image transmission mechanism where the relevancies of DWT subbands are considered when forwarding packets to the next hop toward the sink. In fact, parts of DWT-based encoded visual data may have different relevancies for the reconstruction of the original visual information and those relevancies may be exploited when forwarding packets. In the proposed approach, high-relevant packets are forwarded through paths with lower average end-to-end delay, while the remaining packets flow through paths high higher delay, allowing that low-quality versions of the transmitted images reach the sink as soon as possible. Moreover, the best paths will need to relay fewer packets, potentially reducing energy consumption and enlarging their lifetime. We present simulation results to attest the benefits of the proposed mechanism.

When camera-enabled sensors are deployed for visual monitoring, a new set of innovative applications is allowed, enriching the use of wireless sensor network technologies. In these networks, energy-efficiency is a highly desired optimization issue, mainly because transmission of images and video streams over resource-constrained sensor networks is more stringent than transmission of conventional scalar data. Due to the nature of visual monitoring, that follows a directional sensing model, camera-enabled sensors may have different relevancies for the application, according to the desired monitoring tasks and the current sensors' poses and fields of view. Exploiting this concept, each data packet may be associated with a priority level related to the packet's origins, which may be in turn mapped to an energy threshold level. In such way, we propose an energy-efficient relaying mechanism where data packets are only forwarded to the next hop if the associated energy threshold level is below the current energy level of the relaying node. Thus, packets from low-relevant source nodes will be silently dropped when the current energy level of intermediate nodes run below the pre-defined thresholds. Doing so, energy is saved potentially prolonging the network lifetime. Besides the sensing relevancies of source nodes, the relevance of DWT subbands for reconstruction of original images is also considered. This allows the creation of a second level of packet prioritization, assuring a minimal level of image quality even for the least relevant source nodes. We performed simulations for the proposed relaying mechanism, assessing the expected performance over a traditional relaying paradigm. (41 refs)

An important feature for the design of algorithms for Wireless Sensor Networks is the estimation of its lifetime. To design communication protocols and data collection algorithms with low power consumption, a key factor is the ability to measure the actual consumption in the sensor node. This ability enables the verification of theoretical/simulated models, allowing an accurate estimation of the network longevity. This paper proposes a system for measuring the energy consumption levels of sensor nodes in normal operation, allowing the estimation of the real lifetime for each node, enabling the optimization of energy aware protocols. Presented data is related to the energy consumption of a MicaZ node and to the behavior of the full discharge of a battery pack. A set of polynomial functions describing this energy discharge are also presented that can be easily inserted into the battery models of network simulators to obtain a more realistic behavior.

Camera networks have been considered for a large set of visual monitoring applications. For some of them, cameras may be continuously monitoring scenes or groups of targets, but some events may trigger a critical level of visual monitoring, as in public security, industrial automation, and response to natural disasters. In such way, some critical events as a bomb explosion, a volcanic eruption, forest wildfire, or a car accident must be captured with high relevance, potentially helping when identifying responsibilities and during rescue operations. New relevance levels, which can be reflected in higher quality of transmitted images or video streams or even higher priority during transmission over the network must be quickly assigned to cameras that can view the critical events. In this work we propose a methodology to dynamically assign relevancies to cameras that view the area of critical events, employing scalar sensors and a decentralized decision mechanism. The resulting multimodal camera network can considerably enhance the critical surveillance in different monitoring applications. We propose some optimizations that exploit the monitoring relevance in such scenarios.

This paper proposes a new real-time communication scheme for 802.11e wireless networks. This scheme is called Group Sequential Communication (GSC). The GSC improves the efficiency of the Hybrid Coordination Function Controlled Channel Access (HCCA) mechanism by reducing the protocol overheads of the 802.11e amendment. The GSC approach eliminates the polling scheme used in traditional scheduling algorithm, by means of a virtual token passing procedure among members of the real-time group to whom is granted a high-priority and sequential access to communication medium. In order to improve the reliability of the proposed scheme, it is also proposed an error recovery mechanism based on block acknowledgment. The GSC was implemented in network simulator software and the performance results were compared to HCCA scheme, showing the efficient of the proposed approach when dealing with traditional industrial communication scenarios.

Wireless sensor networks may be deployed to retrieve visual information from the monitored field, enriching monitoring and control applications. Whenever a set of camera-enabled sensor nodes are deployed for time-critical monitoring, visual information as still images and video streams may need to reach the sink as soon as possible, requiring a differentiated treating of the network when compared with non-critical visual data. In such way, considering that source nodes may have different sensing relevancies for the application, according to the desired monitoring tasks and the current sensors' poses and fields of view, we propose a delay-aware multihop routing mechanism where higher relevant visual data packets are routed through paths with lower end-to-end delay. As sensor nodes are expected to be energy-constrained, transmitting only high-relevant packets through shorter/faster paths may prolong their lifetime and assure longer time-critical delivering, with low impact to the overall monitoring quality.

In this paper we make a comparative assessment between the RT-WiFi and HCCA approaches to handle realtime traffic in IEEE 802.11 networks operating in open communication environments. The main focus will be on the assessment of the admission control mechanism proposed for the RT-WiFi upper layer, that is based on a non-preemptive EDF scheduling algorithm combined with a mechanism that measures the blockage times on medium access of real-time stations due to retransmissions and delays. The goal is to achieve a good compromise between medium utilization and timeliness. This proposal is compared with HCCA, and the results show that RT-WiFi offers a significantly better behavior in what concerns the maximum number of admitted streams.

The usage of Wireless Sensor Networks (WSNs) in industrial environments has been steadily increasing, due to the reduced deployment and maintenance costs, when compared to the use of wired networks for connecting single I/O points in industrial applications. The most promising WSN standard is the one defined by the IEEE 802.15.4 standard. However, it does not support the adequate mechanisms to deal with the unreliable nature of an industrial communication environment. In this paper, we propose an extension of the use classes available for this standard, together with the proposal of adequate message retransmission schemes, in order to increase the reliability of message exchanges in industrial environments. To demonstrate the effectiveness of the proposed schemes, we present a simulation assessment of both the proposed message retransmission schemes and the Guaranteed Time Slots (GTS) mechanism, as defined by the standard. © 2012 IEEE.

Wireless sensor networks composed of camera-enabled source nodes can provide visual information of an area of interest, potentially enriching monitoring applications. While few bytes can represent scalar data, even low-resolution still images may require thousand of bytes, turning data fragmentation into a relevant design issue. Different optimization approaches have been proposed in recent years to achieve energy saving in wireless image sensor networks. However, the impact of image fragmentation upon the adopted MAC technology has been neglected in most cases. In this work we investigate the effect of frame size on image transmissions over wireless sensor networks, linking the maximum frame size, the useful payload and the frame error rate effects. Additionally, we discuss different approaches for transmissions of DWT-based encoded images and the impact of inserting application-specific information into the frame header. We believe that our discussions can contribute to the advance of the design of wireless image sensor networks. Â(c) 2012 IEEE.

One of the motivations for use of wireless sensor networks (WSNs) in industrial environments is related to the reduced deployment and maintenance costs, when compared to the use of wired networks for connecting single I/O points. Nevertheless, a well-known problem for the use of wireless communication in industrial environments is related to the unreliable nature of the communication medium. Therefore, the search for communication reliability in WSNs is a relevant topic of research for the scientific community. In this paper we propose an innovative message retransmission scheme, based on network coding techniques, to increase the reliability of message exchanges in industrial environments. The proposed technique: NetCod, that improve the probability of message deliver by allowing the message retransmission whenever a loss occurs is experimentally compared with state of the art techniques: BlockACK, Redundant TDMA and Master/Slave. A comparative experimental assessment of these four techniques was performed using MicaZ motes. Metrics such as: message loss, message transmission delay and power consumption were used to comparatively assess the behavior of these retransmission techniques. Â(c) 2012 IEEE.

Recent trends in distributed embedded systems, such as those found in avionics and trains, have shown an increase in the amount and heterogeneity of the information that needs to be exchanged, together with a growing importance of supporting dynamic reconfiguration and adaptive behaviors. In this paper we focus on Ethernet technologies with real-time reconfiguration support and we address the case of middle-size networking infrastructures with a few switches. We use the FTT-SE protocol with the needed adaptations to support dynamic heterogeneous real-time transactions in multi-hop networks. The paper presents a worst-case response-time analysis that provides timeliness guarantees, improving the results obtained with another previous analysis, decreasing the needed network capacity for guaranteed schedulability by 25% on average. Practical experiments and simulation results validate the proposed approach and analysis. © 2012 IEEE

In recent years, the FlexRay communication protocol been promoted as a de facto standard for in-vehicular communication. In the FlexRay protocol, the communication timeline is organized as a sequence of four segments, whereas the static segment defines a set of slots specifically designed for the transmission of synchronous messages. In this paper, we investigate the following problem: "how to allocate a minimum number of static slots to each FlexRay node, while guaranteeing that all synchronous messages will be transmitted before their deadlines." Unlike previous studies that use linear programming based techniques, we evaluate the number of allocated slots using traditional response time analysis (RTA) techniques. The use of RTA techniques allow us to consider the timing requirements imposed by the set of synchronous message streams. Unlike other approaches, the RTA-based technique proposed in this paper is able to deal with a) message stream sets where periods are not multiple of the FlexRay cycle duration, b) generation of messages at the application layer that are not synchronized with the FlexRay cycle, and c) on-line scheduling of the traffic transferred during the static segment, according to its deadline requirements. The proposed technique is integrated as a RT-Middleware in each node, to take full advantage of the proposed allocation scheme. © 2012 IEEE.

We present reliability models for a group membership protocol designed for TDMA networks such as FlexRay, a protocol that is likely to become the de facto standard for next generation automotive networks. The models are based on discrete-time Markov chains and consider a comprehensive set of fault scenarios. Furthermore, they are parametric allowing for a sensitivity analysis. The results, obtained by a numeric solution of the models using the PRISM model-checker, show that they are computationally practical for realistic configurations and that the GMP can achieve reliability levels in the range required for safety critical applications.