Dependability of wireless sensor networks for industrial prognostics and health management

Maintenance is an important activity in industry. It is performed either to revive a machine/component or to prevent it from breaking down. Different strategies have evolved through time, bringing maintenance to its current state: condition-based and predictive maintenances. This evolution was due to the increasing demand of reliability in industry. The key process of condition-based and predictive maintenances is prognostics and health management, and it is a tool to predict the remaining useful life of engineering assets. Nowadays, plants are required to avoid shutdowns while offering safety and reliability. Nevertheless, planning a maintenance activity requires accurate information about the system/component health state. Such information is usually gathered by means of independent sensor nodes. In this study, we consider the case where the nodes are interconnected and form a wireless sensor network. As far as we know, no research work has considered such a case of study for prognostics. Regarding the importance of data accuracy, a good prognostics requires reliable sources of information. This is why, in this paper, we will first discuss the dependability of wireless sensor networks, and then present a state of the art in prognostic and health management activities.     

Receiver-initiated medium access control protocols for wireless sensor networks

One of the fundamental building blocks of a Wireless Sensor Network (WSN) is the Medium Access Control (MAC) protocol, that part of the system governing when and how two independent neighboring nodes activate their respective transceivers to directly interact. Historically, data exchange has always been initiated by the node willing to relay data, i.e. the sender. However, the Receiver-Initiated paradigm introduced by Lin et al. in 2004 with RICER and made popular by Sun et al. in 2008 with RI-MAC, has spawned a whole new stream of research, yielding tens of new MAC protocols. Within such paradigm, the receiver is the one in charge of starting a direct communication with an eligible sender. This allows for new useful properties to be satisfied, novel schemes to be introduced and new challenges to be tackled. In this paper, we present a survey comprising of all the MAC protocols released since the year 2004 that fall under the receiver-initiated category. In particular, keeping in mind the key challenges that receiver-initiated MAC protocols are meant to deal with, we analyze and discuss the different protocols according to common features and design goals. The aim of this paper is to provide a comprehensive and self-contained introduction to the fundamentals of the receiver-initiated paradigm, providing newcomers with a quick-start guide on the state of the art of this field and a palette of options, essential for implementing applications or designing new protocols.     

基于无线传感器网络的远距离结构健康监测

针对复合材料结构健康监测的特点和需求,实现了一套基于无线传感器网络(WSNs)的远距离结构健康监测系统。系统构成包括前端传感监测子系统、WSNs子系统和远终端监控子系统。为了扩大系统的监测范围,降低系统网络功耗及成本,提高系统的稳定性、智能性和抗毁性,研究了自制的无线传感节点、多跳路由技术及小型化配接电路,改进了终端程序和网络节点程序。实验证明:相对于传统有线的监测方式,基于WSNs的结构健康监测具有灵活性高、负重轻、成本低、搭建移动方便、维护容易等优点。     

Routing in wireless sensor networks for wind turbine monitoring

Smart wireless sensor devices are rapidly emerging as key enablers of the next evolution in wind turbine monitoring. The potential for in-situ monitoring of turbine elements, employing methodologies that are not possible with existing wired technology, make it possible to attain new levels of granularity and autonomy in the monitoring of these structures. Wireless sensor devices are limited in terms of communication by the range of their radio modules and, thus, need to form networks in order to transfer data from distant points. Routing protocols are primary enablers of such ad hoc wireless sensor networks and these require the implementation of reliable and energy-efficient mechanisms to maximize network reliability and availability. Existing routing protocols cannot be directly applied to the monitoring of wind turbines without addressing the unique context and operational characteristics of these structures in multi-hop wireless communication. This work identifies the potential effects associated with the operation, environment and structure of wind turbines in wireless sensor network multi-hop communication, and proposes and evaluates a reliable routing protocol for wireless sensor networks employed in these domains.     

面向农业的无线传感器网络应用及相关问题

将基于Microchip Zigbee协议栈的无线传感器网络与GPRS模块相结合,设计并实现了面向农业的远程监测系统。详细介绍了无线传感器网络中节点的工作流程,并给出了采集命令的格式和节点的节能措施。最后就无线传感器网络在农业应用中存在的问题进行了分析。     

Node coordination mechanism based on distributed estimation and control in wireless sensor and actuator networks

Wireless sensor and actuator networks （WSANs） have a wide range of applications. To perform effective sensing and acting tasks, multiple coordination mechanisms among the nodes are required. As attempt in this direction, this paper describes collaborative estimation and control algorithms design for WSANs. First, a sensor-actuator coordination model is proposed based on distributed Kalman filter in federated configuration. This method provides the capability of fault tolerance and multi-source information fusion. On this basis, an actuator-actuator coordination model based on even-driven task allocation is introduced. Actuators utilize fused sensory information to adjust their action that incur the minimum energy cost to the system subject to the constraints that user＇s preferences regarding the states of the system are approximately satisfied. Finally, according to system requirements, a distributed algorithm is proposed to solve the task allocation problem. Simulations demonstrate the effectiveness of our proposed methods.     

Link scheduling in wireless sensor networks: Distributed edge-coloring revisited

We consider the problem of link scheduling in a sensor network employing a TDMA MAC protocol. Our algorithm consists of two phases. The first phase involves edge-coloring: an assignment of a color to each edge in the network such that no two edges incident on the same node are assigned the same color. Our main result for the first phase is a distributed edge-coloring algorithm that needs at most (Δ+1) colors, where Δ is the maximum degree of the network. To our knowledge, this is the first distributed algorithm that can edge-color a graph using at most (Δ+1) colors. The second phase uses the edge-coloring solution for link scheduling. We map each color to a unique timeslot and attempt to assign a direction of transmission along each edge such that the hidden terminal problem is avoided; an important result we obtain is a characterization of network topologies for which such an assignment exists. Next, we consider topologies for which a feasible transmission assignment does not exist for all edges, and obtain such an assignment using additional timeslots. Finally, we show that reversing the direction of transmission along every edge leads to another feasible direction of transmission. Using both the transmission assignments, we obtain a TDMA MAC schedule which enables two-way communication between every pair of adjacent sensor nodes. For acyclic topologies, we prove that at most 2(Δ+1) timeslots are required. Results for general topologies are demonstrated using simulations; for sparse graphs, we show that the number of timeslots required is around 2(Δ+1). We show that the message and time complexity of our algorithm is O(nΔ²+n²m), where n is the number of nodes and m is the number of edges in the network. Through simulations, we demonstrate that the energy consumption of our solution increases linearly with Δ. We also propose extensions to account for non-ideal radio characteristics.     

Distributed data source verification in wireless sensor networks

In-network data aggregation is favorable for wireless sensor networks (WSNs): It allows in-network data processing while reducing the network traffic and hence saving the sensors energy. However, due to the distributed and unattended nature of WSNs, several attacks aiming at compromising the authenticity of the collected data could be perpetrated. For example, an adversary could capture a node to create clones of the captured one. These clones disseminated through the network could provide malicious data to the aggregating node, thus poisoning/disrupting the aggregation process. In this paper we address the problem of detecting cloned nodes; a requirement to be fulfilled to provide authenticity of the data fusion process.First, we analyze the desirable properties a distributed clone detection protocol should meet. Specifically: It should avoid having a single point of failure; the load should be totally distributed across the nodes in the network; the position of the clones in the network should not influence the detection probability. We then show that current solutions do not meet the exposed requirements. Next, we propose the Information Fusion Based Clone Detection Protocol (ICD). ICD is a probabilistic, completely distributed protocol that efficiently detects clones. ICD combines two cryptographic mechanisms: The pseudo-random key pre-distribution, usually employed to secure node pairwise communications, with a sparing use of asymmetric crypto primitives. We show that ICD matches all the requirements above mentioned and compare its performance with current solutions in the literature; experimental results show that ICD has better performance than existing solutions for all the cost parameters considered: Number of messages sent, per sensor storage requirement, and signature verification. These savings allow to increase the network operating lifetime. Finally, note that ICD protocol could be used as an independent layer by any data aggregation mechanism.     

A distributed energy-efficient clustering protocol for wireless sensor networks

Minimizing energy dissipation and maximizing network lifetime are among the central concerns when designing applications and protocols for sensor networks. Clustering has been proven to be energy-efficient in sensor networks since data routing and relaying are only operated by cluster heads. Besides, cluster heads can process, filter and aggregate data sent by cluster members, thus reducing network load and alleviating the bandwidth. In this paper, we propose a novel distributed clustering algorithm where cluster heads are elected following a three-way message exchange between each sensor and its neighbors. Sensor’s eligibility to be elected cluster head is based on its residual energy and its degree. Our protocol has a message exchange complexity of O(1) and a worst-case convergence time complexity of O(N). Simulations show that our algorithm outperforms EESH, one of the most recently published distributed clustering algorithms, in terms of network lifetime and ratio of elected cluster heads.     

Topology control for delay-constraint data collection in wireless sensor networks

Data collection is one of the most important operations in wireless sensor networks. Many practical applications require the real-time data transmission, such as monitoring, tracking, etc. In this paper, we import and define the topology control problem for delay-constraint data collection (TDDC), and then formalize this problem into an integer programming problem. As NP-Hardness of this problem, we present a load-aware power-increased topology control algorithm (namely LPTC) to heuristically solve the problem. The theoretical analysis shows that this algorithm can reach O(1)-approximation ratio for the linear networks. And we also analyze the impact of the delay-constraint on the worst-case for the planar networks. Moreover, this paper designs two localized algorithms, called as SDEL and DDEL, based on the area division for TDDC problem. The experimental results show that LPTC algorithm can save at least 17% power consumptions compared with HBH algorithm in many situations.     

Optimal replicator factor control in wireless sensor networks

For TDMA MAC protocols in wireless sensor networks (WSNs), redundancy and retransmission are two important methods to provide high end-to-end transmission reliability. Since reliable transmissions will lead to more energy consumption, there exists an intrinsic tradeoff between transmission reliability and energy efficiency. For each link, we name the number of its reserved time slots in each MAC superframe as a replicator factor. In the following paper, we propose a reliability-lifetime tradeoff framework (RLTF) for WSNs to study replicator factor control problem. First, for the redundancy TDMA MAC, we formulate replicator factor control problem as convex programming. By the gradient projection method, we develop a fully distributed algorithm to solve the convex programming. Second, for the retransmission TDMA MAC, we set the retransmission upper bound for each link according to the optimal replicator factors under the redundancy MAC and compute the total communication overhead for the retransmission MAC. Finally, we compare the communication overhead of these two MAC protocols under different channel conditions.     

From versatility to auto-adaptation of the medium access control in wireless sensor networks

Recent deployments of wireless sensor networks have targeted challenging monitoring and surveillance applications. The medium access control being the main source of energy wastage, energy-efficiency has always been kept in mind while designing the communication stack embedded in spread sensors. Especially, versatile protocols have emerged to offer a suitable solution over multiple deployment characteristics. In this study, we observe to what extent versatility applies to dynamic scenarios in which communications do not respect specific communication paradigms. We first provide a performance evaluation of two well-reputed versatile protocols (B-MAC (Polastre et al., 2004 [17]) and X-MAC (Buettner et al., 2006 [4])) under the conditions of such a scenario. The obtained results convinced us to propose more than versatility and pre-configured solutions, that is auto-adaptation. We then introduce the main contribution of this paper, an auto-adaptive algorithm that allows one to adjust the previously mentioned protocols while the network is operating. We analyze to what extent it outperforms the previously obtained results.     

Distributed control for energy-efficient and fast consensus in wireless sensor networks

The paper proposes a distributed control of nodes transmission radii in energy-harvesting wireless sensor networks for simultaneously coping with energy consumption and consensus responsiveness requirement. The stability of the closed-loop network under the proposed control law is proved. Simulation validations show the effectiveness of the proposed approach in nominal scenario as well as in the presence of uncertain node power requirements and harvesting system supply.     

An optimal control method for applications using wireless sensor/actuator networks

The wireless sensor/actuator networks (WSANs) can be used for spatially distributed control systems. With smart sensors and actuators, the WSANs are able to not only sense the control system states and report measurements, but also perform control and actuation. This paper investigates WSANs on their ability of control. A centralized controller is introduced into WSANs to make up closed-loop control systems, in which control decisions are made based on global network-wide information. A model of the control and communication over WSANs is made theoretically, based on which we achieved an optimal control method. It is demonstrated by simulations that the control method proposed could stabilize the control system quickly.     

A framework for use of wireless sensor networks in forest fire detection and monitoring

Forest fires are one of the main causes of environmental degradation nowadays. Current surveillance systems for forest fires lack in supporting real-time monitoring of every point of a region at all times and early detection of fire threats. Solutions using wireless sensor networks, on the other hand, can gather sensory data values, such as temperature and humidity, from all points of a field continuously, day and night, and, provide fresh and accurate data to the fire-fighting center quickly. However, sensor networks face serious obstacles like limited energy resources and high vulnerability to harsh environmental conditions, that have to be considered carefully. In this paper, we propose a comprehensive framework for the use of wireless sensor networks for forest fire detection and monitoring. Our framework includes proposals for the wireless sensor network architecture, sensor deployment scheme, and clustering and communication protocols. The aim of the framework is to detect a fire threat as early as possible and yet consider the energy consumption of the sensor nodes and the environmental conditions that may affect the required activity level of the network. We implemented a simulator to validate and evaluate our proposed framework. Through extensive simulation experiments, we show that our framework can provide fast reaction to forest fires while also consuming energy efficiently.     

A statistical analysis of interference and effective deployment strategies for facility-specific wireless sensor networks

Sensors are essential to industrial automation as they provide vital links between control systems and the physical world. Recently, wireless sensor networks (WSNs) attract more attention as they become feasible solutions for facility management. Unlike simulated environments, however, there are challenges in developing reliable WSNs for monitoring real facilities, including reduced accuracy, reliability and performance due to unpredictable interferences. This paper investigates deployment of automation facility-specific WSNs, called facility sensor networks (FSNs). First, interferences at multiple sensing nodes are analyzed to see if FSNs are vulnerable to interference. Second, interference sources are identified by applying statistical methods to collected data, in order to find the appropriate FSN configuration. Finally, an interference model is proposed to obtain optimal deployment strategies that minimize influence of interference. The strategy yields the lowest interference level compared to others. The results also suggest the appropriate number of sensors to be deployed.     

无线传感器网络的覆盖控制

覆盖控制作为无线传感器网络中的一个基本问题,在国内外已经取得了一些研究成果。根据不同的性质,覆盖控制问题可以划分为不同的类型(如,静态覆盖和动态覆盖、确定性覆盖和随机性覆盖)。主要针对静态覆盖(区域覆盖、点覆盖、栅栏覆盖)问题中一些典型算法,分类进行了描述,并比较了它们之间的优缺点,最后,指出了需要进一步的研究工作。     

Application-aware integration of data collection and power management in wireless sensor networks

Sensors are typically deployed to gather data about the physical world and its artifacts for a variety of purposes that range from environment monitoring, control, to data analysis. Since sensors are resource constrained, often sensor data is collected into sensor databases that reside at (more powerful) servers. A natural tradeoff exists between resources (bandwidth, energy) consumed and the quality of data collected at the server. Blindly transmitting sensor updates at a fixed periodicity to the server results in a suboptimal solution due to the differences in stability of sensor values and due to the varying application needs that impose different quality requirements across sensors. In order to adapt to these variations while at the same time optimizing the energy consumption of sensors, this paper proposes three different models and corresponding data collection protocols. We analyze all three models with a Markov state machine formulation, and either derive closed forms for the operation point of the data collection application or suggest algorithms for estimating this operating point to achieve a minimal energy consumption. We observe that the operating point depends on environmental characteristics and application quality requirements, which the proposed algorithms aim to accommodate. Our experimental results show significant energy savings compared to the naive approach to data collection.