scholarly journals Data Compression Based on Stacked RBM-AE Model for Wireless Sensor Networks

Sensors ◽  
2018 ◽  
Vol 18 (12) ◽  
pp. 4273 ◽  
Author(s):  
Jianlin Liu ◽  
Fenxiong Chen ◽  
Dianhong Wang
Keyword(s):  
Wireless Sensor Networks ◽  
Energy Consumption ◽  
Sensor Networks ◽  
Data Compression ◽  
Compression Ratio ◽  
Sensor Nodes ◽  
Learning Ability ◽  
Wireless Sensor ◽  
Compression Efficiency ◽  
Sensing Data

Data compression is very important in wireless sensor networks (WSNs) with the limited energy of sensor nodes. Data communication results in energy consumption most of the time; the lifetime of sensor nodes is usually prolonged by reducing data transmission and reception. In this paper, we propose a new Stacked RBM Auto-Encoder (Stacked RBM-AE) model to compress sensing data, which is composed of a encode layer and a decode layer. In the encode layer, the sensing data is compressed; and in the decode layer, the sensing data is reconstructed. The encode layer and the decode layer are composed of four standard Restricted Boltzmann Machines (RBMs). We also provide an energy optimization method that can further reduce the energy consumption of the model storage and calculation by pruning the parameters of the model. We test the performance of the model by using the environment data collected by Intel Lab. When the compression ratio of the model is 10, the average Percentage RMS Difference value is 10.04%, and the average temperature reconstruction error value is 0.2815 °C. The node communication energy consumption in WSNs can be reduced by 90%. Compared with the traditional method, the proposed model has better compression efficiency and reconstruction accuracy under the same compression ratio. Our experiment results show that the new neural network model can not only apply to data compression for WSNs, but also have high compression efficiency and good transfer learning ability.

scholarly journals Increasing network lifetime using data compression in wireless sensor networks with energy harvesting

2017 ◽  
Vol 13 (1) ◽  
pp. 155014771668968 ◽  
Author(s):  
Sunyong Kim ◽  
Chiwoo Cho ◽  
Kyung-Joon Park ◽  
Hyuk Lim
Keyword(s):  
Wireless Sensor Networks ◽  
Energy Consumption ◽  
Sensor Networks ◽  
Energy Harvesting ◽  
Data Compression ◽  
Network Lifetime ◽  
Average Energy ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Entire Network

In wireless sensor networks powered by battery-limited energy harvesting, sensor nodes that have relatively more energy can help other sensor nodes reduce their energy consumption by compressing the sensing data packets in order to consequently extend the network lifetime. In this article, we consider a data compression technique that can shorten the data packet itself to reduce the energies consumed for packet transmission and reception and to eventually increase the entire network lifetime. First, we present an energy consumption model, in which the energy consumption at each sensor node is derived. We then propose a data compression algorithm that determines the compression level at each sensor node to decrease the total energy consumption depending on the average energy level of neighboring sensor nodes while maximizing the lifetime of multihop wireless sensor networks with energy harvesting. Numerical simulations show that the proposed algorithm achieves a reduced average energy consumption while extending the entire network lifetime.

scholarly journals CBN-VAE: A Data Compression Model with Efficient Convolutional Structure for Wireless Sensor Networks

Sensors ◽  
2019 ◽  
Vol 19 (16) ◽  
pp. 3445 ◽  
Author(s):  
Jianlin Liu ◽  
Fenxiong Chen ◽  
Jun Yan ◽  
Dianhong Wang
Keyword(s):  
Neural Network ◽  
Neural Networks ◽  
Wireless Sensor Networks ◽  
Energy Consumption ◽  
Sensor Networks ◽  
Data Compression ◽  
Wireless Sensor ◽  
Reconstruction Accuracy ◽  
Sensing Data ◽  
Proposed Model

Data compression is a useful method to reduce the communication energy consumption in wireless sensor networks (WSNs). Most existing neural network compression methods focus on improving the compression and reconstruction accuracy (i.e., increasing parameters and layers), ignoring the computation consumption of the network and its application ability in WSNs. In contrast, we pay attention to the computation consumption and application of neural networks, and propose an extremely simple and efficient neural network data compression model. The model combines the feature extraction advantages of Convolutional Neural Network (CNN) with the data generation ability of Variational Autoencoder (VAE) and Restricted Boltzmann Machine (RBM), we call it CBN-VAE. In particular, we propose a new efficient convolutional structure: Downsampling-Convolutional RBM (D-CRBM), and use it to replace the standard convolution to reduce parameters and computational consumption. Specifically, we use the VAE model composed of multiple D-CRBM layers to learn the hidden mathematical features of the sensing data, and use this feature to compress and reconstruct the sensing data. We test the performance of the model by using various real-world WSN datasets. Under the same network size, compared with the CNN, the parameters of CBN-VAE model are reduced by 73.88% and the floating-point operations (FLOPs) are reduced by 96.43% with negligible accuracy loss. Compared with the traditional neural networks, the proposed model is more suitable for application on nodes in WSNs. For the Intel Lab temperature data, the average Signal-to-Noise Ratio (SNR) value of the model can reach 32.51 dB, the average reconstruction error value is 0.0678 °C. The node communication energy consumption can be reduced by 95.83%. Compared with the traditional compression methods, the proposed model has better compression and reconstruction accuracy. At the same time, the experimental results show that the model has good fault detection performance and anti-noise ability. When reconstructing data, the model can effectively avoid fault and noise data.

scholarly journals Performance Analysis of Data Compression Algorithms for Energy Efficient Wireless Sensor Networks

2019 ◽  
Vol 9 (1S) ◽  
pp. 404-408
Keyword(s):  
Wireless Sensor Networks ◽  
Energy Consumption ◽  
Sensor Networks ◽  
Data Compression ◽  
Energy Saving ◽  
Life Time ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Piecewise Linear Approximation ◽  
Compression Algorithms

Wireless Sensor Networks (WSN), is an intensive area of research which is often used for monitoring, sensing and tracking various environmental conditions. It consists of a number of sensor nodes that are powered with fixed low powered batteries. These batteries cannot be changed often as most of the WSN will be in remote areas. Life time of WSN mainly depends on the energy consumed by the sensor nodes. In order to prolong the networks life time, the energy consumption has to be reduced. Different energy saving schemes has been proposed over the years. Data compression is one among the proposed schemes that can scale down the amount of data transferred between nodes and results in energy saving. In this paper, an attempt is made to analyze the performances of three different data compression algorithms viz. Light Weight Temporal Compression (LTC), Piecewise Linear Approximation with Minimum Number of Line Segments (PLAMLIS) and Univariate Least Absolute Selection and Shrinkage Operator (ULASSO). These algorithms are tested on standard univariate datasets and evaluated using assessment metrics like Mean Square Error (MSE), compression ratio and energy consumption. The results show that the ULASSO algorithm outperforms other algorithms in all three metrics and contributes more towards energy consumption

Energy Efficient Group Based Linear Wireless Sensor Networks for Application in Pipeline Monitoring

2020 ◽  
Vol 10 ◽  
Author(s):  
Chinedu Duru ◽  
Neco Ventura ◽  
Mqhele Dlodlo
Keyword(s):  
Wireless Sensor Networks ◽  
Energy Consumption ◽  
Sensor Networks ◽  
Remote Monitoring ◽  
Linear Array ◽  
Minimum Energy ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Sink Node ◽  
Pipeline Monitoring

Background: Wireless Sensor Networks (WSNs) have been researched to be one of the ground-breaking technologies for the remote monitoring of pipeline infrastructure of the Oil and Gas industry. Research have also shown that the preferred deployment approach of the sensor network on pipeline structures follows a linear array of nodes, placed a distance apart from each other across the infrastructure length. The linear array topology of the sensor nodes gives rise to the name Linear Wireless Sensor Networks (LWSNs) which over the years have seen themselves being applied to pipelines for effective remote monitoring and surveillance. This paper aims to investigate the energy consumption issue associated with LWSNs deployed in cluster-based fashion along a pipeline infrastructure. Methods: Through quantitative analysis, the study attempts to approach the investigation conceptually focusing on mathematical analysis of proposed models to bring about conjectures on energy consumption performance. Results: From the derived analysis, results have shown that energy consumption is diminished to a minimum if there is a sink for every placed sensor node in the LWSN. To be precise, the analysis conceptually demonstrate that groups containing small number of nodes with a corresponding sink node is the approach to follow when pursuing a cluster-based LWSN for pipeline monitoring applications. Conclusion: From the results, it is discovered that energy consumption of a deployed LWSN can be decreased by creating groups out of the total deployed nodes with a sink servicing each group. In essence, the smaller number of nodes each group contains with a corresponding sink, the less energy consumed in total for the entire LWSN. This therefore means that a sink for every individual node will attribute to minimum energy consumption for every non-sink node. From the study, it can be concurred that energy consumption of a LWSN is inversely proportional to the number of sinks deployed and hence the number of groups created.

Improved DV-Hop Localization Scheme for Randomly Deployed WSNs

2020 ◽  
Vol 10 (1) ◽  
pp. 94-109 ◽  
Author(s):  
Rekha Goyat ◽  
Mritunjay Kumar Rai ◽  
Gulshan Kumar ◽  
Hye-Jin Kim ◽  
Se-Jung Lim
Keyword(s):  
Wireless Sensor Networks ◽  
Energy Consumption ◽  
Sensor Networks ◽  
Research Area ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Localization Error ◽  
Anchor Nodes ◽  
Least Energy ◽  
Range Free

Background: Wireless Sensor Networks (WSNs) is considered one of the key research area in the recent. Various applications of WSNs need geographic location of the sensor nodes. Objective: Localization in WSNs plays an important role because without knowledge of sensor nodes location the information is useless. Finding the accurate location is very crucial in Wireless Sensor Networks. The efficiency of any localization approach is decided on the basis of accuracy and localization error. In range-free localization approaches, the location of unknown nodes are computed by collecting the information such as minimum hop count, hop size information from neighbors nodes. Methods: Although various studied have been done for computing the location of nodes but still, it is an enduring research area. To mitigate the problems of existing algorithms, a range-free Improved Weighted Novel DV-Hop localization algorithm is proposed. Main motive of the proposed study is to reduced localization error with least energy consumption. Firstly, the location information of anchor nodes is broadcasted upto M hop to decrease the energy consumption. Further, a weight factor and correction factor are introduced which refine the hop size of anchor nodes. Results: The refined hop size is further utilized for localization to reduces localization error significantly. The simulation results of the proposed algorithm are compared with other existing algorithms for evaluating the effectiveness and the performance. The simulated results are evaluated in terms localization error and computational cost by considering different parameters such as node density, percentage of anchor nodes, transmission range, effect of sensing field and effect of M on localization error. Further statistical analysis is performed on simulated results to prove the validation of proposed algorithm. A paired T-test is applied on localization error and localization time. The results of T-test depicts that the proposed algorithm significantly improves the localization accuracy with least energy consumption as compared to other existing algorithms like DV-Hop, IWCDV-Hop, and IDV-Hop. Conclusion: From the simulated results, it is concluded that the proposed algorithm offers 36% accurate localization than traditional DV-Hop and 21 % than IDV-Hop and 13% than IWCDV-Hop.

scholarly journals Calculating the Number of Cluster Heads Based on the Rate-Distortion Function in Wireless Sensor Networks

2014 ◽  
Vol 2014 ◽  
pp. 1-7
Author(s):  
Mingxin Yang ◽  
Jingsha He ◽  
Yuqiang Zhang
Keyword(s):  
Wireless Sensor Networks ◽  
Energy Consumption ◽  
Sensor Networks ◽  
Data Fusion ◽  
Rate Distortion ◽  
Distortion Function ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Wireless Sensor Nodes ◽  
Cluster Heads

Due to limited resources in wireless sensor nodes, energy efficiency is considered as one of the primary constraints in the design of the topology of wireless sensor networks (WSNs). Since data that are collected by wireless sensor nodes exhibit the characteristics of temporal association, data fusion has also become a very important means of reducing network traffic as well as eliminating data redundancy as far as data transmission is concerned. Another reason for data fusion is that, in many applications, only some of the data that are collected can meet the requirements of the sink node. In this paper, we propose a method to calculate the number of cluster heads or data aggregators during data fusion based on the rate-distortion function. In our discussion, we will first establish an energy consumption model and then describe a method for calculating the number of cluster heads from the point of view of reducing energy consumption. We will also show through theoretical analysis and experimentation that the network topology design based on the rate-distortion function is indeed more energy-efficient.

scholarly journals Energy Consumption Based Low Energy Aware Gateway (LEAG) Protocol in Wireless Sensor Networks

2019 ◽  
Vol 8 (5S3) ◽  
pp. 128-132 ◽  
Keyword(s):  
Wireless Sensor Networks ◽  
Energy Consumption ◽  
Sensor Networks ◽  
Cluster Head ◽  
Base Station ◽  
Low Energy ◽  
Secure Routing ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Energy Aware

Wireless Sensor Networks (WSN) consists of a large amount of nodes connected in a self-directed manner. The most important problems in WSN are Energy, Routing, Security, etc., price of the sensor nodes and renovation of these networks is reasonable. The sensor node tools included a radio transceiver with an antenna and an energy source, usually a battery. WSN compute the environmental conditions such as temperature, sound, pollution levels, etc., WSN built the network with the help of nodes. A sensor community consists of many detection stations known as sensor nodes, every of which is small, light-weight and portable. Nodes are linked separately. Each node is linked into the sensors. In recent years WSN has grow to be an essential function in real world. The data’s are sent from end to end multiple nodes and gateways, the data’s are connected to other networks such as wireless Ethernet. MGEAR is the existing mechanism. It works with the routing and energy consumption. The principal problem of this work is choosing cluster head, and the selection is based on base station, so the manner is consumes energy. In this paper, develop the novel based hybrid protocol Low Energy Aware Gateway (LEAG). We used Zigbee techniques to reduce energy consumption and routing. Gateway is used to minimize the energy consumption and data is send to the base station. Nodes are used to transmit the data into the cluster head, it transmit the data into gateway and gateway compress and aggregate the data then sent to the base station. Simulation result shows our proposed mechanism consumes less energy, increased throughput, packet delivery ration and secure routing when compared to existing mechanism (MGEAR).

scholarly journals Energy-efficient hierarchical routing in wireless sensor networks based on Fog Computing

2020 ◽  
Author(s):  
Ademola Abidoye ◽  
Boniface Kabaso
Keyword(s):  
Wireless Sensor Networks ◽  
Energy Consumption ◽  
Sensor Networks ◽  
Routing Protocol ◽  
Data Transmission ◽  
Energy Efficient ◽  
Fog Computing ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Hierarchical Routing

Abstract Wireless sensor networks (WSNs) have been recognized as one of the most essential technologies of the 21st century. The applications of WSNs are rapidly increasing in almost every sector because they can be deployed in areas where cable and power supply are difficult to use. In the literature, different methods have been proposed to minimize energy consumption of sensor nodes so as to prolong WSNs utilization. In this article, we propose an efficient routing protocol for data transmission in WSNs; it is called Energy-Efficient Hierarchical routing protocol for wireless sensor networks based on Fog Computing (EEHFC). Fog computing is integrated into the proposed scheme due to its capability to optimize the limited power source of WSNs and its ability to scale up to the requirements of the Internet of Things applications. In addition, we propose an improved ant colony optimization (ACO) algorithm that can be used to construct optimal path for efficient data transmission for sensor nodes. The performance of the proposed scheme is evaluated in comparison with P-SEP, EDCF, and RABACO schemes. The results of the simulations show that the proposed approach can minimize sensor nodes’ energy consumption, data packet losses and extends the network lifetime

Efficient Energy Conservation and Faulty Node Detection on Machine Learning-Based Wireless Sensor Networks

2021 ◽  
Vol 13 (2) ◽  
pp. 1-20
Author(s):  
Amarasimha T. ◽  
V. Srinivasa Rao
Keyword(s):  
Machine Learning ◽  
Wireless Sensor Networks ◽  
Energy Consumption ◽  
Sensor Networks ◽  
Data Communication ◽  
Energy Utilization ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Support Vector ◽  
Faulty Node

Wireless sensor networks are used in machine learning for data communication and classification. Sensor nodes in network suffer from low battery power, so it is necessary to reduce energy consumption. One way of decreasing energy utilization is reducing the information transmitted by an advanced machine learning process called support vector machine. Further, nodes in WSN malfunction upon the occurrence of malicious activities. To overcome these issues, energy conserving and faulty node detection WSN is proposed. SVM optimizes data to be transmitted via one-hop transmission. It sends only the extreme points of data instead of transmitting whole information. This will reduce transmitting energy and accumulate excess energy for future purpose. Moreover, malfunction nodes are identified to overcome difficulties on data processing. Since each node transmits data to nearby nodes, the misbehaving nodes are detected based on transmission speed. The experimental results show that proposed algorithm provides better results in terms of reduced energy consumption and faulty node detection.

Nature-Inspired Algorithms in Wireless Sensor Networks

2019 ◽  
pp. 246-275
Author(s):  
Ajay Kaushik ◽  
S. Indu ◽  
Daya Gupta
Keyword(s):  
Wireless Sensor Networks ◽  
Big Data ◽  
Energy Consumption ◽  
Sensor Networks ◽  
Energy Efficient ◽  
Sensor Node ◽  
Optimization Problem ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Nature Inspired Algorithms

Wireless sensor networks (WSNs) are becoming increasingly popular due to their applications in a wide variety of areas. Sensor nodes in a WSN are battery operated which outlines the need of some novel protocols that allows the limited sensor node battery to be used in an efficient way. The authors propose the use of nature-inspired algorithms to achieve energy efficient and long-lasting WSN. Multiple nature-inspired techniques like BBO, EBBO, and PSO are proposed in this chapter to minimize the energy consumption in a WSN. A large amount of data is generated from WSNs in the form of sensed information which encourage the use of big data tools in WSN domain. WSN and big data are closely connected since the large amount of data emerging from sensors can only be handled using big data tools. The authors describe how the big data can be framed as an optimization problem and the optimization problem can be effectively solved using nature-inspired algorithms.

Sign in / Sign up

Export Citation Format

Share Document