A Survey on IT-Techniques for a Dynamic Emergency Management in Large Infrastructures

This deliverable is a survey on the IT techniques that are relevant to the three use cases of the project EMILI. It describes the state-of-the-art in four complementary IT areas: Data cleansing, supervisory control and data acquisition, wireless sensor networks and complex event processing. Even though the deliverable’s authors have tried to avoid a too technical language and have tried to explain every concept referred to, the deliverable might seem rather technical to readers so far little familiar with the techniques it describes

Reliable routing scheme for indoor sensor networks

Indoor Wireless sensor networks require a highly dynamic, adaptive routing scheme to deal with the high rate of topology changes due to fading of indoor wireless channels. Besides that, energy consumption rate needs to be consistently distributed among sensor nodes and efficient utilization of battery power is essential. If only the link reliability metric is considered in the routing scheme, it may create long hops routes, and the high quality paths will be frequently used. This leads to shorter lifetime of such paths; thereby the entire network's lifetime will be significantly minimized. This paper briefly presents a reliable load-balanced routing (RLBR) scheme for indoor ad hoc wireless sensor networks, which integrates routing information from different layers. The proposed scheme aims to redistribute the relaying workload and the energy usage among relay sensor nodes to achieve balanced energy dissipation; thereby maximizing the functional network lifetime. RLBR scheme was tested and benchmarked against the TinyOS-2.x implementation of MintRoute on an indoor testbed comprising 20 Mica2 motes and low power listening (LPL) link layer provided by CC1000 radio. RLBR scheme consumes less energy for communications while reducing topology repair latency and achieves better connectivity and communication reliability in terms of end-to-end packets delivery performance

Publish/subscribe protocol in wireless sensor networks: improved reliability and timeliness

The rapidly-evolving demand of applications using wireless sensor networks in several areas such as building and industrial automation or smart cities, among other, makes it necessary to determine and provide QoS support mechanisms which can satisfy the requirements of applications. In this paper we propose a mechanism that establishes different QoS levels, based on Publish/Subscribe model for wireless networks to meet application requirements, to provide reliable delivery of packet and timeliness. The first level delivers packets in a best effort way. The second one intends to provide reliable packet delivery with a novel approach for Retransmission Timeout (RTO) calculation, which adjusts the RTO depending on the subscriber Packet Delivery Ratio (PDR). The third one provides the same reliable packet delivery as the second one, but in addition, it provides data aggregation trying to be efficient in terms of energy consumption and the use of network bandwidth. The last one provides timeliness in the packet delivery. We evaluate each QoS Level with several performance metrics such as PDR, Message Delivery Ratio, Duplicated and Retransmitted Packet Ratio and Packet Timeliness Ratio to demonstrate that our proposal provides significant improvements based on the increase of the PDR obtained.Peer ReviewedPostprint (author's final draft

Distributed Object Tracking Using a Cluster-Based Kalman Filter in Wireless Camera Networks

Local data aggregation is an effective means to save sensor node energy and prolong the lifespan of wireless sensor networks. However, when a sensor network is used to track moving objects, the task of local data aggregation in the network presents a new set of challenges, such as the necessity to estimate, usually in real time, the constantly changing state of the target based on information acquired by the nodes at different time instants. To address these issues, we propose a distributed object tracking system which employs a cluster-based Kalman filter in a network of wireless cameras. When a target is detected, cameras that can observe the same target interact with one another to form a cluster and elect a cluster head. Local measurements of the target acquired by members of the cluster are sent to the cluster head, which then estimates the target position via Kalman filtering and periodically transmits this information to a base station. The underlying clustering protocol allows the current state and uncertainty of the target position to be easily handed off among clusters as the object is being tracked. This allows Kalman filter-based object tracking to be carried out in a distributed manner. An extended Kalman filter is necessary since measurements acquired by the cameras are related to the actual position of the target by nonlinear transformations. In addition, in order to take into consideration the time uncertainty in the measurements acquired by the different cameras, it is necessary to introduce nonlinearity in the system dynamics. Our object tracking protocol requires the transmission of significantly fewer messages than a centralized tracker that naively transmits all of the local measurements to the base station. It is also more accurate than a decentralized tracker that employs linear interpolation for local data aggregation. Besides, the protocol is able to perform real-time estimation because our implementation takes into consideration the sparsit- - y of the matrices involved in the problem. The experimental results show that our distributed object tracking protocol is able to achieve tracking accuracy comparable to the centralized tracking method, while requiring a significantly smaller number of message transmissions in the network

Resilient networking in wireless sensor networks

This report deals with security in wireless sensor networks (WSNs), especially in network layer. Multiple secure routing protocols have been proposed in the literature. However, they often use the cryptography to secure routing functionalities. The cryptography alone is not enough to defend against multiple attacks due to the node compromise. Therefore, we need more algorithmic solutions. In this report, we focus on the behavior of routing protocols to determine which properties make them more resilient to attacks. Our aim is to find some answers to the following questions. Are there any existing protocols, not designed initially for security, but which already contain some inherently resilient properties against attacks under which some portion of the network nodes is compromised? If yes, which specific behaviors are making these protocols more resilient? We propose in this report an overview of security strategies for WSNs in general, including existing attacks and defensive measures. In this report we focus at the network layer in particular, and an analysis of the behavior of four particular routing protocols is provided to determine their inherent resiliency to insider attacks. The protocols considered are: Dynamic Source Routing (DSR), Gradient-Based Routing (GBR), Greedy Forwarding (GF) and Random Walk Routing (RWR)

Real-life performance of protocol combinations for wireless sensor networks

Wireless sensor networks today are used for many and diverse applications like nature monitoring, or process and wireless building automation. However, due to the limited access to large testbeds and the lack of benchmarking standards, the real-life evaluation of network protocols and their combinations remains mostly unaddressed in current literature. To shed further light upon this matter, this paper presents a thorough experimental performance analysis of six protocol combinations for TinyOS. During these protocol assessments, our research showed that the real-life performance often differs substantially from the expectations. Moreover, we found that combining protocols is far from trivial, as individual network protocols may perform very different in combination with other protocols. The results of our research emphasize the necessity of a flexible generic benchmarking framework, powerful enough to evaluate and compare network protocols and their combinations in different use cases

Supporting protocol-independent adaptive QoS in wireless sensor networks

Next-generation wireless sensor networks will be used for many diverse applications in time-varying network/environment conditions and on heterogeneous sensor nodes. Although Quality of Service (QoS) has been ignored for a long time in the research on wireless sensor networks, it becomes inevitably important when we want to deliver an adequate service with minimal efforts under challenging network conditions. Until now, there exist no general-purpose QoS architectures for wireless sensor networks and the main QoS efforts were done in terms of individual protocol optimizations. In this paper we present a novel layerless QoS architecture that supports protocol-independent QoS and that can adapt itself to time-varying application, network and node conditions. We have implemented this QoS architecture in TinyOS on TmoteSky sensor nodes and we have shown that the system is able to support protocol-independent QoS in a real life office environment