A novel double sparse structure dictionary learning–based compressive data-gathering algorithm in wireless sensor networks

Sensor Review ◽  
2021 ◽  
Vol 41 (1) ◽  
pp. 65-73
Author(s):  
Junying Chen ◽  
Zhanshe Guo ◽  
Fuqiang Zhou ◽  
Jiangwen Wan ◽  
Donghao Wang
Keyword(s):  
Wireless Sensor Networks ◽  
Energy Consumption ◽  
Sensor Networks ◽  
Sparse Representation ◽  
Dictionary Learning ◽  
Data Gathering ◽  
Experimental Results ◽  
Wireless Sensor ◽  
Learning Stage ◽  
Content Type

Purpose As the limited energy of wireless sensor networks (WSNs), energy-efficient data-gathering algorithms are required. This paper proposes a compressive data-gathering algorithm based on double sparse structure dictionary learning (DSSDL). The purpose of this paper is to reduce the energy consumption of WSNs. Design/methodology/approach The historical data is used to construct a sparse representation base. In the dictionary-learning stage, the sparse representation matrix is decomposed into the product of double sparse matrices. Then, in the update stage of the dictionary, the sparse representation matrix is orthogonalized and unitized. The finally obtained double sparse structure dictionary is applied to the compressive data gathering in WSNs. Findings The dictionary obtained by the proposed algorithm has better sparse representation ability. The experimental results show that, the sparse representation error can be reduced by at least 3.6% compared with other dictionaries. In addition, the better sparse representation ability makes the WSNs achieve less measurement times under the same accuracy of data gathering, which means more energy saving. According to the results of simulation, the proposed algorithm can reduce the energy consumption by at least 2.7% compared with other compressive data-gathering methods under the same data-gathering accuracy. Originality/value In this paper, the double sparse structure dictionary is introduced into the compressive data-gathering algorithm in WSNs. The experimental results indicate that the proposed algorithm has good performance on energy consumption and sparse representation.

Secured data aggregation in wireless sensor networks

Sensor Review ◽  
2018 ◽  
Vol 38 (3) ◽  
pp. 369-375 ◽  
Author(s):  
Sathya D. ◽  
Ganesh Kumar P.
Keyword(s):  
Wireless Sensor Networks ◽  
Energy Consumption ◽  
Sensor Networks ◽  
Data Aggregation ◽  
Computation Time ◽  
Wireless Sensor ◽  
Content Type ◽  
Homomorphic Cryptosystem ◽  
Secured Data ◽  
Time And Energy

PurposeThis study aims to provide a secured data aggregation with reduced energy consumption in WSN. Data aggregation is the process of reducing communication overhead in wireless sensor networks (WSNs). Presently, securing data aggregation is an important research issue in WSNs due to two facts: sensor nodes deployed in the sensitive and open environment are easily targeted by adversaries, and the leakage of aggregated data causes damage in the networks, and these data cannot be retrieved in a short span of time. Most of the traditional cryptographic algorithms provide security for data aggregation, but they do not reduce energy consumption.Design/methodology/approachNowadays, the homomorphic cryptosystem is used widely to provide security with low energy consumption, as the aggregation is performed on the ciphertext without decryption at the cluster head. In the present paper, the Paillier additive homomorphic cryptosystem and Bonehet al.’s aggregate signature method are used to encrypt and to verify aggregate data at the base station.FindingsThe combination of the two algorithms reduces computation time and energy consumption when compared with the state-of-the-art techniques.Practical implicationsThe secured data aggregation is useful in health-related applications, military applications, etc.Originality/valueThe new combination of encryption and signature methods provides confidentiality and integrity. In addition, it consumes less computation time and energy consumption than existing methods.

scholarly journals Novel Energy-Efficient Data Gathering Scheme Exploiting Spatial-Temporal Correlation for Wireless Sensor Networks

2019 ◽  
Vol 2019 ◽  
pp. 1-10 ◽  
Author(s):  
Ying Zhou ◽  
Lihua Yang ◽  
Longxiang Yang ◽  
Meng Ni
Keyword(s):  
Wireless Sensor Networks ◽  
Energy Consumption ◽  
Sensor Networks ◽  
Energy Efficient ◽  
Data Gathering ◽  
Temporal Correlation ◽  
Wireless Sensor ◽  
Selection Scheme ◽  
Efficient Data ◽  
Transmission Energy Consumption

A novel energy-efficient data gathering scheme that exploits spatial-temporal correlation is proposed for clustered wireless sensor networks in this paper. In the proposed method, dual prediction is used in the intracluster transmission to reduce the temporal redundancy, and hybrid compressed sensing is employed in the intercluster transmission to reduce the spatial redundancy. Moreover, an error threshold selection scheme is presented for the prediction model by optimizing the relationship between the energy consumption and the recovery accuracy, which makes the proposed method well suitable for different application environments. In addition, the transmission energy consumption is derived to verify the efficiency of the proposed method. Simulation results show that the proposed method has higher energy efficiency compared with the existing schemes, and the sink can recover measurements with reasonable accuracy by using the proposed method.

Lifetime Maximization Routing Based on Genetic Algorithm for Wireless Sensor Networks

2011 ◽  
Vol 230-232 ◽  
pp. 283-287
Author(s):  
You Rong Chen ◽  
Tiao Juan Ren ◽  
Zhang Quan Wang ◽  
Yi Feng Ping
Keyword(s):  
Genetic Algorithm ◽  
Wireless Sensor Networks ◽  
Energy Consumption ◽  
Sensor Networks ◽  
Network Lifetime ◽  
Data Gathering ◽  
Transmission Probability ◽  
Wireless Sensor ◽  
Total Energy Consumption ◽  
Lifetime Maximization

To prolong network lifetime, lifetime maximization routing based on genetic algorithm (GALMR) for wireless sensor networks is proposed. Energy consumption model and node transmission probability are used to calculate the total energy consumption of nodes in a data gathering cycle. Then, lifetime maximization routing is formulated as maximization optimization problem. The select, crosss, and mutation operations in genetic algorithm are used to find the optimal network lifetime and node transmission probability. Simulation results show that GALMR algorithm are convergence and can prolong network lifetime. Under certain conditions, GALMR outperforms PEDAP-PA, LET, Sum-w and Ratio-w algorithms.

scholarly journals Energy-efficient chain-based data gathering applied to communicating concrete

2020 ◽  
Vol 16 (8) ◽  
pp. 155014772093902
Author(s):  
Hang Wan ◽  
Michael David ◽  
William Derigent
Keyword(s):  
Wireless Sensor Networks ◽  
Energy Consumption ◽  
Wireless Sensor Network ◽  
Sensor Networks ◽  
Sensor Network ◽  
Hot Spot ◽  
Data Gathering ◽  
Information Modeling ◽  
Wireless Sensor ◽  
Energy Models

Wireless Sensor Networks are very convenient to monitor structures or even materials, as in McBIM project (Materials communicating with the Building Information Modeling). This project aims to develop the concept of “communicating concretes,” which are concrete elements embedding wireless sensor networks, for applications dedicated to Structure Health Monitoring in the construction industry. Due to applicative constraints, the topology of the wireless sensor network follows a chain-based structure. Node batteries cannot be replaced or easily recharged, it is crucial to evaluate the energy consumed by each node during the monitoring process. This area has been extensively studied leading to different energy models to evaluate energy consumption for chain-based structures. However, no simple, practical, and analytical network energy models have yet been proposed. Energy evaluation models of periodic data collection for chain-based structures are proposed. These models are compared and evaluated with an Arduino XBee–based platform. Experimental results show the mean prediction error of our models is 5%. Realizing aggregation at nodes significantly reduces energy consumption and avoids hot-spot problem with homogeneous consumptions along the chain. Models give an approximate lifetime of the wireless sensor network and communicating concretes services. They can also be used online by nodes for a self-assessment of their energy consumptions.

A Segment-based Tree Traversal Algorithm for Enhancing Data Gathering in Wireless Sensor Networks

2021 ◽  
Vol 20 ◽  
pp. 66-73
Author(s):  
Mohammad A. Jassim ◽  
Wesam A. Almobaideen
Keyword(s):  
Wireless Sensor Networks ◽  
Energy Consumption ◽  
Sensor Networks ◽  
Energy Efficient ◽  
Performance Metrics ◽  
Data Gathering ◽  
Wireless Sensor ◽  
Greedy Approach ◽  
Tree Traversal ◽  
Sensor Devices

Wireless Sensor Networks (WSNs) are sink-based networks in which assigned sinks gather all data sensed by lightweight devices that are deployed in natural areas. The sensor devices are energyscarce, therefore, energy-efficient protocols need to be designed for this kind of technology. PowerEfficient GAthering in Sensor Information Systems (PEGASIS) protocol is an energy-efficient data gathering protocol in which a chain is constructed using a greedy approach. This greedy approach has appeared to have unbalanced distances among the nodes which result in unfair energy consumption. Tree traversal algorithms have been used to improve the constructed chain to distribute the energy consumption fairly. In this research, however, a new segmentbased tree traversal approach is introduced to further improve the constructed chain. Our new proposed algorithm first constructs initial segments based on a list of nodes that are sorted according to post-order traversal. Afterwards, it groups these segments and concatenates them one by one according to their location; thus, our proposed approach uses location-awareness to construct a single balanced chain in order to use it for the data gathering process. This approach has been evaluated under various numbers of sensor devices in the network field with respect to various crucial performance metrics. It is shown in our conducted simulation results that our proposed segment-based chain construction approach produces shorter chains and shorter transmission ranges which as a result has improved the overall energy consumption per round, network lifetime, and end-to-end delay.

scholarly journals An Online Dictionary Learning-Based Compressive Data Gathering Algorithm in Wireless Sensor Networks

Sensors ◽  
2016 ◽  
Vol 16 (10) ◽  
pp. 1547 ◽  
Author(s):  
Donghao Wang ◽  
Jiangwen Wan ◽  
Junying Chen ◽  
Qiang Zhang
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Dictionary Learning ◽  
Data Gathering ◽  
Wireless Sensor ◽  
Online Dictionary Learning

scholarly journals Maximizing Lifetime of Wireless Sensor Networks with Mobile Sink Nodes

2014 ◽  
Vol 2014 ◽  
pp. 1-13 ◽  
Author(s):  
Yourong Chen ◽  
Zhangquan Wang ◽  
Tiaojuan Ren ◽  
Yaolin Liu ◽  
Hexin Lv
Keyword(s):  
Wireless Sensor Networks ◽  
Energy Consumption ◽  
Sensor Networks ◽  
Network Lifetime ◽  
Optimization Model ◽  
Data Gathering ◽  
Mobile Sink ◽  
Path Selection ◽  
Wireless Sensor ◽  
Lifetime Optimization

In order to maximize network lifetime and balance energy consumption when sink nodes can move, maximizing lifetime of wireless sensor networks with mobile sink nodes (MLMS) is researched. The movement path selection method of sink nodes is proposed. Modified subtractive clustering method, k-means method, and nearest neighbor interpolation method are used to obtain the movement paths. The lifetime optimization model is established under flow constraint, energy consumption constraint, link transmission constraint, and other constraints. The model is solved from the perspective of static and mobile data gathering of sink nodes. Subgradient method is used to solve the lifetime optimization model when one sink node stays at one anchor location. Geometric method is used to evaluate the amount of gathering data when sink nodes are moving. Finally, all sensor nodes transmit data according to the optimal data transmission scheme. Sink nodes gather the data along the shortest movement paths. Simulation results show that MLMS can prolong network lifetime, balance node energy consumption, and reduce data gathering latency under appropriate parameters. Under certain conditions, it outperforms Ratio_w, TPGF, RCC, and GRND.

scholarly journals 1-Bit Compressive Data Gathering for Wireless Sensor Networks

2014 ◽  
Vol 2014 ◽  
pp. 1-8 ◽  
Author(s):  
Jiping Xiong ◽  
Qinghua Tang
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Compressive Sensing ◽  
State Of The Art ◽  
Data Gathering ◽  
Reconstruction Algorithm ◽  
Experimental Results ◽  
Wireless Sensor ◽  
Communication Overhead ◽  
Reconstruction Algorithms

Compressive sensing (CS) has been widely used in wireless sensor networks for the purpose of reducing the data gathering communication overhead in recent years. In this paper, we firstly apply 1-bit compressive sensing to wireless sensor networks to further reduce the communication overhead that each sensor needs to send. Furthermore, we propose a novel blind 1-bit CS reconstruction algorithm which outperforms other state-of-the-art blind 1-bit CS reconstruction algorithms under the settings of WSN. Experimental results on real sensor datasets demonstrate the efficiency of our method.

Genetic optimization of hybrid clustering algorithm in mobile wireless sensor networks

Sensor Review ◽  
2018 ◽  
Vol 38 (4) ◽  
pp. 526-533 ◽  
Author(s):  
Sangeetha M. ◽  
Sabari A.
Keyword(s):  
Genetic Algorithm ◽  
Wireless Sensor Networks ◽  
Energy Consumption ◽  
Sensor Networks ◽  
Network Lifetime ◽  
Clustering Algorithm ◽  
Wireless Sensor ◽  
Mobile Wireless ◽  
Content Type ◽  
Mobile Wireless Sensor

Purpose This paper aims to provide a prolonging network lifetime and optimizing energy consumption in mobile wireless sensor networks (MWSNs). MWSNs have characteristics of dynamic topology due to the factors such as energy consumption and node movement that lead to create a problem in lifetime of the sensor network. Node clustering in wireless sensor networks (WSNs) helps in extending the network life time by reducing the nodes’ communication energy and balancing their remaining energy. It is necessary to have an effective clustering algorithm for adapting the topology changes and improve the network lifetime. Design/methodology/approach This work consists of two centralized dynamic genetic algorithm-constructed algorithms for achieving the objective in MWSNs. The first algorithm is based on improved Unequal Clustering-Genetic Algorithm, and the second algorithm is Hybrid K-means Clustering-Genetic Algorithm. Findings Simulation results show that improved genetic centralized clustering algorithm helps to find the good cluster configuration and number of cluster heads to limit the node energy consumption and enhance network lifetime. Research limitations/implications In this work, each node transmits and receives packets at the same energy level throughout the solution. The proposed approach was implemented in centralized clustering only. Practical implications The main reason for the research efforts and rapid development of MWSNs occupies a broad range of circumstances in military operations. Social implications The research highly gains impacts toward mobile-based applications. Originality/value A new fitness function is proposed to improve the network lifetime, energy consumption and packet transmissions of MWSNs.

Sign in / Sign up

Export Citation Format

Share Document