An objective based classification of aggregation techniques for wireless sensor networks

Wireless Sensor Networks have gained immense popularity in recent years due to their ever increasing capabilities and wide range of critical applications. A huge body of research efforts has been dedicated to find ways to utilize limited resources of these sensor nodes in an efficient manner. One of the common ways to minimize energy consumption has been aggregation of input data. We note that every aggregation technique has an improvement objective to achieve with respect to the output it produces. Each technique is designed to achieve some target e.g. reduce data size, minimize transmission energy, enhance accuracy etc. This paper presents a comprehensive survey of aggregation techniques that can be used in distributed manner to improve lifetime and energy conservation of wireless sensor networks. Main contribution of this work is proposal of a novel classification of such techniques based on the type of improvement they offer when applied to WSNs. Due to the existence of a myriad of definitions of aggregation, we first review the meaning of term aggregation that can be applied to WSN. The concept is then associated with the proposed classes. Each class of techniques is divided into a number of subclasses and a brief literature review of related work in WSN for each of these is also presented

Sparse Localization with a Mobile Beacon Based on LU Decomposition in Wireless Sensor Networks

Node localization is the core in wireless sensor network. It can be solved by powerful beacons, which are equipped with global positioning system devices to know their location information. In this article, we present a novel sparse localization approach with a mobile beacon based on LU decomposition. Our scheme firstly translates node localization problem into a 1-sparse vector recovery problem by establishing sparse localization model. Then, LU decomposition pre-processing is adopted to solve the problem that measurement matrix does not meet the re¬stricted isometry property. Later, the 1-sparse vector can be exactly recovered by compressive sensing. Finally, as the 1-sparse vector is approximate sparse, weighted Cen¬troid scheme is introduced to accurately locate the node. Simulation and analysis show that our scheme has better localization performance and lower requirement for the mobile beacon than MAP+GC, MAP-M, and MAP-M&N schemes. In addition, the obstacles and DOI have little effect on the novel scheme, and it has great localization performance under low SNR, thus, the scheme proposed is robust

Change Sensor Topology When Needed: How to Efficiently Use System Resources in Control and Estimation Over Wireless Networks

New control paradigms are needed for large networks of wireless sensors and actuators in order to efficiently utilize system resources. In this paper we consider when feedback control loops are formed locally to detect, monitor, and counteract disturbances that hit a plant at random instances in time and space. A sensor node that detects a disturbance dynamically forms a local multi-hop tree of sensors and fuse the data into a state estimate. It is shown that the optimal estimator over a sensor tree is given by a Kalman filter of certain structure. The tree is optimized such that the overall transmission energy is minimized but guarantees a specified level of estimation accuracy. A sensor network reconfiguration algorithm is presented that leads to a suboptimal solution and has low computational complexity. A linear control law based on the state estimate is applied and it is argued that it leads to a closed-loop control system that minimizes a quadratic cost function. The sensor network reconfiguration and the feedback control law are illustrated on an example

Wireless Sensor Technology Selection for I4.0 Manufacturing Systems

The term smart manufacturing has surfaced as an industrial revolution in Germany known as Industry 4.0 (I4.0); this revolution aims to help the manufacturers adapt to turbulent market trends. Its main scope is implementing machine communication, both vertically and horizontally across the manufacturing hierarchy through Internet of things (IoT), technologies and servitization concepts. The main objective of this research is to help manufacturers manage the high levels of variety and the extreme turbulence of market trends through developing a selection tool that utilizes Analytic Hierarchy Process (AHP) techniques to recommend a suitable industrial wireless sensor network (IWSN) technology that fits their manufacturing requirements.In this thesis, IWSN technologies and their properties were identified, analyzed and compared to identify their potential suitability for different industrial manufacturing system application areas. The study included the identification and analysis of different industrial system types, their application areas, scenarios and respective communication requirements. The developed tool’s sensitivity is also tested to recommend different IWSN technology options with changing influential factors. Also, a prioritizing protocol is introduced in the case where more than one IWSN technology options are recommended by the AHP tool.A real industrial case study with the collaboration of SPM Automation Inc. is presented, where the industrial systems’ class, communication traffic types, and communication requirements were analyzed to recommend a suitable IWSN technology that fits their requirements and assists their shift towards I4.0 through utilizing AHP techniques. The results of this research will serve as a step forward, in the transformation process of manufacturing towards a more digitalized and better connected cyber-physical systems; thus, enhancing manufacturing attributes such as flexibility, reconfigurability, scalability and easing the shift towards implementing I4.0

Graded Reliance Based Routing Scheme for Wireless Sensor Networks

In this paper Graded Reliance based routing algorithm is proposed to deal with defective nodes in Wireless Sensor Networks (WSN’s).The algorithm is intended to validated or build evidence that, by dynamically learning from previous experience and adapting the changes in the operational environment the application performance can be maximized and also enhance operative agility. Quality of service and social network measures are used to evaluate the confidence score of the sensor node. A dynamic model-based analysis is formulated for best reliance composition, aggregation, and formation to maximize routing performance. The results indicate that reliance based routing approaches yields better performance in terms of message delivery ratio and message delay without incurring substantial message overhead