scholarly journals A Subspace Approach to Sparse Sampling Based Data Gathering in Wireless Sensor Networks

Sensors ◽  
2020 ◽  
Vol 20 (4) ◽  
pp. 985
Author(s):  
Jingfei He ◽  
Xiaoyue Zhang ◽  
Yatong Zhou ◽  
Miriam Maibvisira
Keyword(s):  
Wireless Sensor Networks ◽  
Energy Consumption ◽  
Sensor Networks ◽  
Network Lifetime ◽  
Time Slot ◽  
Data Gathering ◽  
Sparse Sampling ◽  
Wireless Sensor ◽  
Data Reconstruction ◽  
Sampled Data

Data gathering is an essential concern in Wireless Sensor Networks (WSNs). This paper proposes an efficient data gathering method in clustered WSNs based on sparse sampling to reduce energy consumption and prolong the network lifetime. For data gathering scheme, we propose a method that can collect sparse sampled data in each time slot with a fixed percent of nodes remaining in sleep mode. For data reconstruction, a subspace approach is proposed to enforce an explicit low-rank constraint for data reconstruction from sparse sampled data. Subspace representing spatial distributions of the WSNs data can be estimated from previous reconstructed data. Incorporating total variation constraint, the proposed reconstruction method reconstructs current time slot data efficiently. The results of experiments indicate that the proposed method can reduce the energy consumption and prolong the network lifetime with satisfying recovery accuracy.

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 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 EECDA: Energy Efficient Clustering and Data Aggregation Protocol for Heterogeneous Wireless Sensor Networks

2011 ◽  
Vol 6 (1) ◽  
pp. 113 ◽  
Author(s):  
Dilip Kumar ◽  
Trilok C. Aseri ◽  
R.B. Patel
Keyword(s):  
Energy Efficiency ◽  
Wireless Sensor Networks ◽  
Energy Consumption ◽  
Sensor Networks ◽  
Network Lifetime ◽  
Data Aggregation ◽  
Energy Efficient ◽  
Data Gathering ◽  
Wireless Sensor ◽  
Energy Efficient Clustering

In recent years, energy efficiency and data gathering is a major concern in many applications of Wireless Sensor Networks (WSNs). One of the important issues in WSNs is how to save the energy consumption for prolonging the network lifetime. For this purpose, many novel innovative techniques are required to improve the energy efficiency and lifetime of the network. In this paper, we propose a novel Energy Efficient Clustering and Data Aggregation (EECDA) protocol for the heterogeneous WSNs which combines the ideas of energy efficient cluster based routing and data aggregation to achieve a better performance in terms of lifetime and stability. EECDA protocol includes a novel cluster head election technique and a path would be selected with maximum sum of energy residues for data transmission instead of the path with minimum energy consumption. Simulation results show that EECDA balances the energy consumption and prolongs the network lifetime by a factor of 51%, 35% and 10% when compared with Low-Energy Adaptive Clustering Hierarchy (LEACH), Energy Efficient Hierarchical Clustering Algorithm (EEHCA) and Effective Data Gathering Algorithm (EDGA), respectively.

QoS Aware Multi-hop Multi-path Routing Approach in Wireless Sensor Networks

2019 ◽  
Vol 9 (1) ◽  
pp. 43-52
Author(s):  
Omkar Singh ◽  
Vinay Rishiwal
Keyword(s):  
Wireless Sensor Networks ◽  
Energy Consumption ◽  
Sensor Networks ◽  
Network Lifetime ◽  
Life Time ◽  
Base Station ◽  
Environmental Data ◽  
Wireless Sensor ◽  
Delivery Ratio ◽  
End To End

Background & Objective: Wireless Sensor Network (WSN) consist of huge number of tiny senor nodes. WSN collects environmental data and sends to the base station through multi-hop wireless communication. QoS is the salient aspect in wireless sensor networks that satisfies end-to-end QoS requirement on different parameters such as energy, network lifetime, packets delivery ratio and delay. Among them Energy consumption is the most important and challenging factor in WSN, since the senor nodes are made by battery reserved that tends towards life time of sensor networks. Methods: In this work an Improve-Energy Aware Multi-hop Multi-path Hierarchy (I-EAMMH) QoS based routing approach has been proposed and evaluated that reduces energy consumption and delivers data packets within time by selecting optimum cost path among discovered routes which extends network life time. Results and Conclusion: Simulation has been done in MATLAB on varying number of rounds 400- 2000 to checked the performance of proposed approach. I-EAMMH is compared with existing routing protocols namely EAMMH and LEACH and performs better in terms of end-to-end-delay, packet delivery ratio, as well as reduces the energy consumption 13%-19% and prolongs network lifetime 9%- 14%.

scholarly journals A PSO-Based Uneven Dynamic Clustering Multi-Hop Routing Protocol for Wireless Sensor Networks

Sensors ◽  
2019 ◽  
Vol 19 (8) ◽  
pp. 1835 ◽  
Author(s):  
Ruan ◽  
Huang
Keyword(s):  
Wireless Sensor Networks ◽  
Energy Consumption ◽  
Sensor Networks ◽  
Network Lifetime ◽  
Routing Protocol ◽  
Cluster Head ◽  
Base Station ◽  
Wireless Sensor ◽  
Dynamic Clustering ◽  
Energy Efficient Routing

Since wireless sensor networks (WSNs) are powered by energy-constrained batteries, many energy-efficient routing protocols have been proposed to extend the network lifetime. However, most of the protocols do not well balance the energy consumption of the WSNs. The hotspot problem caused by unbalanced energy consumption in the WSNs reduces the network lifetime. To solve the problem, this paper proposes a PSO (Particle Swarm Optimization)-based uneven dynamic clustering multi-hop routing protocol (PUDCRP). In the PUDCRP protocol, the distribution of the clusters will change dynamically when some nodes fail. The PSO algorithm is used to determine the area where the candidate CH (cluster head) nodes are located. The adaptive clustering method based on node distribution makes the cluster distribution more reasonable, which balances the energy consumption of the network more effectively. In order to improve the energy efficiency of multi-hop transmission between the BS (Base Station) and CH nodes, we also propose a connecting line aided route construction method to determine the most appropriate next hop. Compared with UCCGRA, multi-hop EEBCDA, EEMRP, CAMP, PSO-ECHS and PSO-SD, PUDCRP prolongs the network lifetime by between 7.36% and 74.21%. The protocol significantly balances the energy consumption of the network and has better scalability for various sizes of network.

An Energy Aware Routing Based on Swarm Intelligence for Wireless Sensor Networks

2013 ◽  
Vol 706-708 ◽  
pp. 635-638
Author(s):  
Yong Lv
Keyword(s):  
Wireless Sensor Networks ◽  
Energy Consumption ◽  
Sensor Networks ◽  
Swarm Intelligence ◽  
Network Lifetime ◽  
Average Energy ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Energy Aware ◽  
Energy Efficient Routing

Wireless Sensor Networks consisting of nodes with limited power are deployed to collect and distribute useful information from the field to the other sensor nodes. Energy consumption is a key issue in the sensor’s communications since many use battery power, which is limited. In this paper, we describe a novel energy efficient routing approach which combines swarm intelligence, especially the ant colony based meta-heuristic, with a novel variation of reinforcement learning for sensor networks (ARNet). The main goal of our study was to maintain network lifetime at a maximum, while discovering the shortest paths from the source nodes to the sink node using an improved swarm intelligence. ARNet balances the energy consumption of nodes in the network and extends the network lifetime. Simulation results show that compared with the traditional EEABR algorithm can obviously improve adaptability and reduce the average energy consumption effectively.

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.

Research on Wireless Sensor Networks Data Fusion Algorithm Based on COA-BP

2014 ◽  
Vol 539 ◽  
pp. 247-250
Author(s):  
Xiao Xiao Liang ◽  
Li Cao ◽  
Chong Gang Wei ◽  
Ying Gao Yue
Keyword(s):  
Neural Network ◽  
Wireless Sensor Networks ◽  
Energy Consumption ◽  
Sensor Networks ◽  
Data Fusion ◽  
Network Lifetime ◽  
Bp Neural Network ◽  
Network Traffic ◽  
Bp Algorithm ◽  
Wireless Sensor

To improve the wireless sensor networks data fusion efficiency and reduce network traffic and the energy consumption of sensor networks, combined with chaos optimization algorithm and BP algorithm designed a chaotic BP hybrid algorithm (COA-BP), and establish a WSNs data fusion model. This model overcomes shortcomings of the traditional BP neural network model. Using the optimized BP neural network to efficiently extract WSN data and fusion the features among a small number of original date, then sends the extracted features date to aggregation nodes, thus enhance the efficiency of data fusion and prolong the network lifetime. Simulation results show that, compared with LEACH algorithm, BP neural network and PSO-BP algorithm, this algorithm can effectively reduce network traffic, reducing 19% of the total energy consumption of nodes and prolong the network lifetime.

scholarly journals Energy Balance Routing Algorithm Based on Virtual MIMO Scheme for Wireless Sensor Networks

2014 ◽  
Vol 2014 ◽  
pp. 1-7 ◽  
Author(s):  
Jianpo Li ◽  
Xue Jiang ◽  
I-Tai Lu
Keyword(s):  
Wireless Sensor Networks ◽  
Energy Consumption ◽  
Sensor Networks ◽  
Energy Balance ◽  
Network Lifetime ◽  
Routing Algorithm ◽  
Cluster Head ◽  
Wireless Sensor ◽  
Virtual Mimo ◽  
Head Node

Wireless sensor networks are usually energy limited and therefore an energy-efficient routing algorithm is desired for prolonging the network lifetime. In this paper, we propose a new energy balance routing algorithm which has the following three improvements over the conventional LEACH algorithm. Firstly, we propose a new cluster head selection scheme by taking into consideration the remaining energy and the most recent energy consumption of the nodes and the entire network. In this way, the sensor nodes with smaller remaining energy or larger energy consumption will be much less likely to be chosen as cluster heads. Secondly, according to the ratio of remaining energy to distance, cooperative nodes are selected to form virtual MIMO structures. It mitigates the uneven distribution of clusters and the unbalanced energy consumption of the whole network. Thirdly, we construct a comprehensive energy consumption model, which can reflect more realistically the practical energy consumption. Numerical simulations analyze the influences of cooperative node numbers and cluster head node numbers on the network lifetime. It is shown that the energy consumption of the proposed routing algorithm is lower than the conventional LEACH algorithm and for the simulation example the network lifetime is prolonged about 25%.

Sign in / Sign up

Export Citation Format

Share Document