scholarly journals Approach to minimizing consumption of energy in wireless sensor networks

2020 ◽  
Vol 10 (3) ◽  
pp. 2551
Author(s):  
Seddiki Noureddine ◽  
Benahmed Khelifa ◽  
Belgachi Mohammed
Keyword(s):  
Wireless Sensor Networks ◽  
Energy Consumption ◽  
Sensor Networks ◽  
Network Lifetime ◽  
Optimization Techniques ◽  
Global Network ◽  
Wireless Sensor ◽  
Central Position ◽  
Protocol Stack ◽  
Coverage Area

The Wireless Sensor Networks (WSN) technology has benefited from a central position in the research space of future emerging networks by its diversity of applications fields and also by its optimization techniques of its various constraints, more essentially, the minimization of nodal energy consumption to increase the global network lifetime. To answer this saving energy problem, several solutions have been proposed at the protocol stack level of the WSN. In this paper, after presenting a state of the art of this technology and its conservation energy techniques at the protocol stack level, we were interested in the network layer to propose a routing solution based on a localization aspect that allows the creation of a virtual grid on the coverage area and introduces it to the two most well-known energy efficiency hierarchical routing protocols, LEACH and PEGASIS. This allowed us to minimize the energy consumption and to select the clusters heads in a deterministic way unlike LEACH which is done in a probabilistic way and also to minimize the latency in PEGASIS, by decomposing its chain into several independent chains. The simulation results, under "MATLABR2015b", have shown the efficiency of our approach in terms of overall residual energy and network lifetime.

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.

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%.

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 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 Maximizing Network Lifetime Operator for Wireless Sensor Networks

2013 ◽  
Vol 4 (2) ◽  
pp. 267-272
Author(s):  
Dr. Deepali Virmani
Keyword(s):  
Wireless Sensor Networks ◽  
Energy Consumption ◽  
Sensor Networks ◽  
Network Lifetime ◽  
Topology Control ◽  
Performance Metrics ◽  
Minimum Energy ◽  
Energy Utilization ◽  
Wireless Sensor ◽  
Minimum Energy Consumption

Optimizing and enhancing network lifetime with minimum energy consumption is the major challenge in field of wireless sensor networks. Existing techniques for optimizing network lifetime are based on exploiting node redundancy, adaptive radio transmission power and topology control. Topology control protocols have a significant impact on network lifetime, available energy and connectivity. In this paper we categorize sensor nodes as strong and weak nodes based on their residual energy as well as operational lifetime and propose a Maximizing Network lifetime Operator (MLTO) that defines cluster based topology control mechanism to enhance network lifetime while guarantying the minimum energy consumption and minimum delay. Extensive simulations in Java-Simulator (J-Sim) show that our proposed operator outperforms the existing protocols in terms of various performance metrics life network lifetime, average delay and minimizes energy utilization.

scholarly journals Implementation of Enhanced AODV based Self-Organized Tree for Energy Balanced Routing in Wireless Sensor Networks

2020 ◽  
Vol 9 (3) ◽  
pp. 1926-1933
Keyword(s):  
Wireless Sensor Networks ◽  
Energy Consumption ◽  
Sensor Networks ◽  
Network Lifetime ◽  
Data Transmission ◽  
Cluster Head ◽  
Residual Energy ◽  
Wireless Sensor ◽  
Self Organized ◽  
Energy Balanced Routing

Wireless sensor networks (WSN) are gaining attention in numerous fields with the advent of embedded systems and IoT. Wireless sensors are deployed in environmental conditions where human intervention is less or eliminated. Since these are not human monitored, powering and maintaining the energy of the node is a challenging issue. The main research hotspot in WSN is energy consumption. As energy drains faster, the network lifetime also decreases. Self-Organizing Networks (SON) are just the solution for the above-discussed problem. Self-organizing networks can automatically configure themselves, find an optimalsolution, diagnose and self-heal to some extent. In this work, “Implementation of Enhanced AODV based Self-Organized Tree for Energy Balanced Routing in Wireless Sensor Networks” is introduced which uses self-organization to balance energy and thus reduce energy consumption. This protocol uses combination of number of neighboring nodes and residual energy as the criteria for efficient cluster head election to form a tree-based cluster structure. Threshold for residual energy and distance are defined to decide the path of the data transmission which is energy efficient. The improvement made in choosing robust parameters for cluster head election and efficient data transmission results in lesser energy consumption. The implementation of the proposed protocol is carried out in NS2 environment. The experiment is conducted by varying the node density as 20, 40 and 60 nodes and with two pause times 5ms, 10ms. The analysis of the result indicates that the new system consumes 17.6% less energy than the existing system. The routing load, network lifetime metrics show better values than the existing system.

scholarly journals Threshold Balanced Sampled DEEC Model for Heterogeneous Wireless Sensor Networks

2018 ◽  
Vol 2018 ◽  
pp. 1-12 ◽  
Author(s):  
Sercan Vançin ◽  
Ebubekir Erdem
Keyword(s):  
Wireless Sensor Networks ◽  
Energy Consumption ◽  
Sensor Networks ◽  
Network Lifetime ◽  
Energy Efficient ◽  
Wireless Sensor ◽  
Distributed Energy ◽  
Clustering Method ◽  
Clustering Protocol ◽  
Energy Efficient Clustering

Due to the restricted hardware resources of the sensor nodes, modelling and designing energy efficient routing methods to increase the overall network lifetime have become one of the most significant strategies in wireless sensor networks (WSNs). Cluster-based heterogeneous routing protocols, a popular part of routing technology, have proven effective in management of topology, energy consumption, data collection or fusion, reliability, or stability in a distributed sensor network. In this article, an energy efficient three-level heterogeneous clustering method (DEEC) based distributed energy efficient clustering protocol named TBSDEEC (Threshold balanced sampled DEEC) is proposed. Contrary to most other studies, this study considers the effect of the threshold balanced sampled in the energy consumption model. Our model is compared with the DEEC, EDEEC (Enhanced Distributed Energy Efficient Clustering Protocol), and EDDEEC (Enhanced Developed Distributed Energy Efficient Clustering Protocol) using MATLAB as two different scenarios based on quality metrics, including living nodes on the network, network efficiency, energy consumption, number of packets received by base station (BS), and average latency. After, our new method is compared with artificial bee colony optimization (ABCO) algorithm and energy harvesting WSN (EH-WSN) clustering method. Simulation results demonstrate that the proposed model is more efficient than the other protocols and significantly increases the sensor network lifetime.

Sign in / Sign up

Export Citation Format

Share Document