Search

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.

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 use of Wireless Sensor Network (WSN) technologies is an attractive option to support wide-scale monitoring applications, such as the ones that can be found in precision agriculture, environmental monitoring and industrial automation. The IEEE 802.15.4/ZigBee cluster-tree topology is a suitable topology to build wide-scale WSNs. Despite some of its known advantages, including timing synchronisation and duty-cycle operation, cluster-tree networks may suffer from severe network congestion problems due to the convergecast pattern of its communication traffic. Therefore, the careful adjustment of transmission opportunities (superframe durations) allocated to the cluster-heads is an important research issue. This paper proposes a set of proportional Superframe Duration Allocation (SDA) schemes, based on well-defined protocol and timing models, and on the message load imposed by child nodes (Load-SDA scheme), or by number of descendant nodes (Nodes-SDA scheme) of each cluster-head. The underlying reasoning is to adequately allocate transmission opportunities (superframe durations) and parametrize buffer sizes, in order to improve the network throughput and avoid typical problems, such as: network congestion, high end-to-end communication delays and discarded messages due to buffer overflows. Simulation assessments show how proposed allocation schemes may clearly improve the operation of wide-scale cluster-tree networks.

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.

This paper proposes a real-time communication scheme for wireless local area network (WLAN) infrastructure. This strategy was called Group Sequential Communication (GSC). The GSC has the main goal to reduce the network overhead due to the Polling, Ack and QoS Null Frames of Hybrid Coordination Function Controlled Channel Access (HCCA) in IEEE 802.11e, because it uses a Virtual Token Passing procedure to priority the real-time communication over WLAN. In order to improve the confiability of the new scheme is presented a fault-tolerant mechanism based on Block-Ack strategy to avoid missing real-time messages. The GSC was implemented in NS2 and simulation results have proved the superior performance of GSC in comparison with HCCA for real-time industrial communications.

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.

The IEEE 802.15.4 standard offers a flexible communication solution for low-rate wireless small area networks. When the beacon mode is enabled, real-time communication is possible by using the Guaranteed Time Slots (GTS) mechanism. However, the beacon-enabled mode only supports a maximum of seven GTS allocated in each superframe, preventing other nodes to benefit from the guaranteed service. This paper introduces the SIGHT (Skips In GTS scHeduling for IEEE 802.15.4 neTworks) model, which incorporates a dynamic GTS allocation policy for IEEE 802.15.4 networks based on the (m,k)-firm task model. Our approach ensures that at least m messages are allocated in a guaranteed slot, for any k consecutive superframes. It adopts a deterministic schedulability test and an on-line prioritization heuristic algorithm called Slotted DBP (Distance Based Priority) to attend requests according to this schedulability model. A simulation model has been developed, in order to compare the behaviour in overload conditions of the proposed Slotted DBP with other approaches (DWCS and FIFO).

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.

In some Wireless Sensor Network applications the sensor nodes share the same sensing activity, which means that for a considerable number of applications, not all nodes are required to perform sensing tasks during the network lifetime. Sleep-scheduling approaches can be applied in this scenario, enabling that some nodes turn off their radios, saving energy and bandwidth, as long as there are enough nodes to ensure the required Quality of Service (QoS) of the network. This paper presents a new adaptive approach for QoS and energy management in IEEE 802.15.4 networks, entitled Skip Game. This approach targets a trade-off between increasing the network lifetime and maintaining the QoS of the network, aiming a greater number of nodes to participate in the monitoring application. In order to evaluate the proposed approach, we performed some experiments using the OMNeT++ simulator tool under the MiXiM framework. The results show that the Skip Game outperforms both the traditional Gur Game and Gureen Game approaches in terms of QoS provision and network lifetime.

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.

Many Wireless Sensor Network (WSN) applications operate autonomously in unreliable or inaccessible environments, precluding maintenance or human intervention. Redundant deployment schemes are usually considered in this scenario, making the network resilient to failure and environmental changes. Furthermore, sleep-scheduling techniques can also be applied, enabling redundant nodes to turn off their radios, while active nodes perform monitoring services. This paper investigates the behavior of the (m, k)-Gur Game approach. The main goal of the (m, k)-Gur Game is to provide an uniform network coverage for monitoring applications, with autonomic nodes performing a self-regulated choice between sending message to a base station or sleep until the next period. The proposal was evaluated using the OMNeT++ simulator tool under the MiXiM framework. Preliminary results shows that the (m, k)-Gur Game outperforms the traditional GurGame approach in terms of QoS provision and network coverage.

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

Wireless visual sensor networks can provide significant information for a large set of monitoring and surveillance applications. In these networks, mobile sinks are often used to reduce energy consumption over the network, where many algorithms have been proposed for higher energy efficiency. Frequently, visual sensors may have different relevancies for the monitoring functions of the applications, according to their potential to provide significant data. Additionally, the relevancies of visual sensors may be quickly adjusted according to the occurrence of some critical event. In such cases, higher relevant source nodes may be concurrently transmitting visual information with higher quality or frequency, potentially increasing energy consumption in intermediate nodes from those sources toward the sink. We propose an autonomous balanced positioning algorithm for mobile sinks in order to shorten the transmission paths from higher relevant sources, directly benefiting multi-hop sensor networks with multiple active visual source nodes.

As Wireless Sensor Networks have been employed to support critical monitoring applications, network availability has become a major design concern. In these networks, redundancy can be exploited to enhance the attainable availability level, where redundant sensors can replace faulty nodes. When camera-enabled sensors are deployed to retrieve visual information, the perception of redundancy changes considerably, since the redundancy of visual sensors depends on the monitoring requirements of the applications. In such context, characteristics as deployment density, viewing angle and sensing range are relevant when planning wireless sensor network applications, directly impacting in the number of redundant nodes. We propose an algorithm to select redundant nodes in Wireless Visual Sensor Networks, according to the application requirements. Moreover, we discuss how parameters of the deployed network can influence on the number of redundant nodes.

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.

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)

Wireless sensor networks can be deployed for a large set of monitoring functions, providing information as humidity, pressure, temperature, luminosity, among many others. When monitored data is transmitted over wireless links, packets can be corrupted requiring some error recovery strategy. Hop-by-hop retransmission can provide an acceptable level of reliability, but can potentially increase the energy consumption of the network. In fact, wireless communications are error prone, and interferences may be concentrated in specific parts of the network. We propose a semi-reliable retransmission mechanism where only packets carrying critical information will be always retransmitted if corrupted. The remaining corrupted packets will not be retransmitted, saving energy of the network. We designed an energy consumption model to evaluate the proposed approach.

In several monitoring applications, such as those that can be found in industrial factory floor, it may be necessary to obtain an uniform sensing coverage, providing as much as possible the same coverage degree for the entire network area. The IEEE 802.15.4 has become an important standard in wireless sensor networks. However, the use of cluster-tree topology in these networks hampers a fair and uniform coverage in the sensing area. Clusters more distant from the base station are eventually adversely affected, with messages from its sensors delayed and discarded. In this paper, we propose a framework, entitled GLHOVE, whose goal is to make a trade-off between a minimum and uniform coverage area and the energy consumption of the network. The simulation results show an increase up to 20% of the fairness metric (w.r.t. messages received by base station). (c) 2013 IEEE.

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.

Whenever reliable transmissions are assured by retransmission mechanisms, higher packet error incur in additional energy consumption due to packet retransmissions, even though many monitoring applications can tolerate some loss in the quality of the received images. In fact, visual information retrieved from source nodes may have different relevancies for the applications, according to the desired monitoring tasks and the current sensors' poses and fields of view. We propose a semi-reliable energy-efficient hop-by-hop retransmission mechanism, where the reliability level of each packet is function of the relevance of the source nodes associated with DWT subbands. Doing so, some of the corrupted packets will not be retransmitted, saving energy of intermediate nodes with low impact to the visual monitoring quality. © 2012 IEEE.

In this paper we assess the interference caused by external (uncontrolled) traffic sources upon real-time flows in IEEE 802.11-based mesh networks. Through a set of simulations, we assess the impact of external traffic sources by analyzing the end-to-end delay, frame loss ratio and deadline miss ratio as performance metrics for a set of real-time flows. We infer the maximum interfering traffic load that can be supported so that it does not negatively impact upon the behavior of the real-time flows. We highlight that there is a critical threshold load for the network above which the network can no longer reliably support real-time flows. Â(c) 2012 IEEE.

In this paper we present an admission control mechanism to handle real-time traffic in IEEE 802.11 networks operating in open communication environments. The proposal is based on a non-preemptive EDF scheduling algorithm, combined with a measurement-based mechanism that assesses blockage times on medium access of real-time stations due to retransmissions and delays. This proposal will be part of the upper layer of the RT-WiFi architecture that was proposed by us in previous works. The main goal is to achieve a better compromise between medium utilization and timeliness. Â(c) 2012 IEEE.

When packets are transmitted over braided-paths in visual sensor networks some intermediate nodes may relay most part of the traffic, turning part or the entire network inactive when they run out of energy. Due to the nature of visual monitoring, source nodes may have different relevancies for the application, according to the desired monitoring tasks and the current sensors' poses and fields of view. Based on such relevancies, packets transmitted from different source nodes will have different relaying priorities, which are associated with energy thresholds. We propose an energy-efficient relay scheme where packets are forwarded to the next hop toward the sink only if the associated energy threshold is below the current energy level of the relaying node. Doing so, energy saving is achieved potentially prolonging the network lifetime, but with reduced impact to the overall monitoring quality of the application. © 2012 IEEE.

In this paper is proposed a novel communication approach for implementation of parallel data fusion techniques in Wireless Sensor Networks. The approach is carried out by a distributed algorithm implemented in each network sensor node. In this approach, the network configures itself in order to adjust the number of messages sent periodically, establishing a tradeoff between the number of sent messages and the quality of data fusion (QoF). A prototype was implemented and experimental results show the effectiveness of this proposal.

Camera-enabled sensor nodes deployed for visual monitoring can considerably enlarge the applicability of wireless sensor networks. Due to the stringent requirements of visual data transmission and processing, when compared with scalar wireless sensor networks, quality assessment becomes a relevant issue. Although academic investigation has been focused on QoS parameters such as end-to-end delay, throughput and packet error rate, what is being seen by source nodes may be more important for the application than the quality of received data. In such way, we propose the novel concept of Quality of Viewing (QoV) to be employed as an important QoS parameter when assessing the monitoring quality in visual sensor networks. Some issues for the establishment of the QoV of monitoring applications will be presented, as well as practical exploitation of this parameter for dynamic verification, control and management of wireless sensor networks composed of camera-enabled source nodes. Â(c) 2012 IEEE.

In this paper is proposed a communication approach for implementation of parallel data fusion techniques in IEEE 802.15.4 star networks. In the approach, the network configures itself in order to adjust the number of messages sent periodically by sensor nodes, establishing a trade-off between the number of sent messages and the dependability of data fusion in base station. Conventional techniques for data fusion can be employed using the proposed approach, such as Dempster-Shafer or Kalman filter. A prototype was implemented and experiments were carried out to evaluate the approach. Results showed the effectiveness of the proposal.

In this paper we propose the use of a coordination layer to handle real-time communication in infrastructured WiFi networks. This layer combines a TDMA scheme with a traffic separation mechanism (FCR MAC), which enables the prioritization of real-time (RT) traffic over uncontrolled (external) traffic sources. The target of this paper is to assess the behavior of this coordination layer when supporting RT communication and to compare these results with those obtained with IEEE 802.11e EDCA. The simulation assessment considers an open communication environment, where a set of RT and non-RT stations share the same coverage area and frequency band. A realistic error-prone channel was used to measure the impact of interferences against an error-free channel. We show that the proposed solution offers a significant improvement when compared with EDCA, in what concerns average deadline losses and delay.

Nowadays, most complex embedded systems follow a distributed approach in which a network interconnects potentially large numbers of nodes. One technology that is being increasingly used is switched Ethernet, but real-time variants of this protocol typically limit scalability. In this paper, we focus on the scalability of the Flexible Time Triggered communication over Switched Ethernet (FTT-SE), which has been proposed to support hard real-time applications in a flexible and predictable manner. Moreover, time-triggered and event-triggered communication methods are supported in this protocol. FTT-SE has already been explored and investigated for small scale networked applications. In this paper we address the protocol scalability and suggest three different solutions with a qualitative assessment. Â(c) 2011 IEEE.

In this paper, we propose a TDMA-based communication approach to be used upon the EDCA communication mechanism defined in the IEEE 802.11e standard. This approach allows the coexistence of real-time (RT) traffic together with uncontrolled (external) traffic sources. In the context of this paper, RT traffic means small sized packets generated in periodic intervals, which must be delivered before the end of the message stream period. The target of this paper is to highlight some limitations of the EDCA mechanism when supporting RT communication and to compare these results with those obtained with the proposed TDMA approach. We have assessed these two mechanisms considering an open communication environment, where there are RT and non-RT stations operating in the same frequency band. Furthermore, a realistic error-prone model channel was used to measure the impact of interferences against an error-free channel. We show that the proposed TDMA approach offers an almost constant access delay and it also improves the EDCA behavior in what concerns the average functional throughput and the average deadline losses.

The purpose of this paper is to survey the state-of-the-art on real-time (RT) communication in CSMA-based networks and to identify the most suitable approaches to deal with the requirements imposed by next generation communication environments. The paper focuses in the two of the most relevant solutions that operate in shared broadcast environments, according to the CSMA medium access protocol (IEEE 802.3/802.11). RT communication solutions are classified according to two classification axes. The first axis is related to how collisions are dealt with. A second classification axis is related to the compatibility degree achieved by each of the proposed approaches. Finally, a RT communication framework that is adequate to support RT communication in shared environments is briefly discussed.

The timing behavior of the EDCA mechanism defined in the IEEE 802.11e standard is analyzed. More specifically, the target of this paper is to evaluate the limitations of the highest priority level of the EDCA mechanism (voice category) when supporting real-time (RT) communication. By RT communication, we mean small-sized packets generated in periodic intervals that must be delivered before the end of the message stream period. Otherwise, the message is considered to be delayed and a deadline loss occurs. We have assessed the EDCA mechanism considering an open communication environment, where both RT and non-RT stations share the same frequency band. Furthermore, a realistic error-prone model channel was used to measure the impact of interferences against an error-free channel. We show that, for most part of the evaluated scenarios, when using the default parameters of the EDCA mechanism both the number of packet losses and the average packet delays forecast an unacceptable number of deadline losses. However, if adequate Contention Windows (CW) parameters are configured in the set of RT stations, it becomes possible to adequately handle RT traffic. As a conclusion of this paper, we present some potential future directions toward improved QoS in wireless networks.

Characterization of the behaviour of link-layer retransmissions is helpful when designing MAC protocols and scheduling algorithms for Factory Automation WLANs. In this paper, we measure retransmission rates and consecutive retransmission occurrences of IEEE 802.11g communication links in an industrial indoor environment. The employed wireless channel at 2.4 GHz is characterized. Experimental results show that the distribution of consecutive retransmission occurrences tends to concentrate around just one retry when devices operate within their transmission range. It is also shown that smaller frames result in fewer retransmissions.