scholarly journals Balancing Energy Consumption in Clustered Wireless Sensor Networks

2013 ◽  
Vol 2013 ◽  
pp. 1-14 ◽  
Author(s):  
Tony Ducrocq ◽  
Michaël Hauspie ◽  
Nathalie Mitton

Clustering in wireless sensor networks is an efficient way to structure and organize the network. It aims at identifying a subset of nodes within the network and binding it to a leader (i.e., cluster head). The leader becomes in charge of specific additional tasks like gathering data from all nodes in its cluster and sending them using a longer range communication to a sink. As a consequence, a cluster head exhausts its battery more quickly than regular nodes. In this paper, we present four variants of BLAC, a novel battery level aware clustering family of schemes. BLAC considers the battery level combined with another metric to elect the cluster-head. The cluster-head role is taken alternately by each node to balance energy consumption. Due to the local nature of the algorithms, keeping the network stable is easier. BLAC aims at maximizing the time with all nodes alive to satisfy the application requirements. Simulation results show that BLAC improves the full network lifetime three times more than the traditional clustering schemes by balancing energy consumption over nodes and still deliveres high data ratio.

2013 ◽  
Vol 442 ◽  
pp. 532-537
Author(s):  
Xian Li Li ◽  
Jia Wei Zhang ◽  
Liang Bing Liu

Considering the shortage of LEACH protocol, a novel dynamic multi-hop routing protocol named Balance Energy-efficient and Real-time with Reliable communication protocol based on Connected Dominant Set (BERR-CDS) is proposed in this paper. BERR-CDS protocol fully takes account of the energy consumption of an individual node and entire network, a rational transmission path from source node to sink node is searched, aiming at the network topology changes which are caused by the death of cluster head, the invalidation of cluster member nodes and new nodes joining, BERR-CDS designs the corresponding valid mechanism to respond, and it can rapidly adapt to the topology change of network. Simulation results show that BERR-CDS protocol has better performances in term of energy consumption, network lifetime and reliability, it is an ideal routing protocol in wireless sensor networks.


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


2021 ◽  
Vol 27 (3) ◽  
pp. 225-235
Author(s):  
Xiaotao Ju

This research was conducted to enhance the energy performance of wireless sensor networks (WSN) and improve the performance of end-to-end delay and packet receiving rate of network operation. In this study, the low-energy data collection routing algorithm and adaptive environment sensing method in WSN were mainly examined. The node centrality, energy surplus, and node temperature were calculated for cluster head selection to reduce the energy consumption of nodes and improve the reliability of network data. The research results have shown that the parameter setting guided by the theoretical analysis makes each node selfishly achieve the maximum expected benefit while the whole network runs reliably, and the energy consumption is reduced by the selfishness of the node. As a result, the proposed algorithm can effectively reduce the network energy consumption and increase the network life cycle of wireless sensor networks. It can be seen that the machine learning methods such as support vector machine are used to model and analyze the state of the sensing node, and to obtain more accurate wireless channel availability judgment based on the historical state data, thereby adaptively adjusting the working duty ratio and reducing the invalidity data sent.


Sensors ◽  
2019 ◽  
Vol 19 (8) ◽  
pp. 1835 ◽  
Author(s):  
Ruan ◽  
Huang

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.


Sensors ◽  
2015 ◽  
Vol 15 (10) ◽  
pp. 26583-26605 ◽  
Author(s):  
Zhezhuang Xu ◽  
Liquan Chen ◽  
Ting Liu ◽  
Lianyang Cao ◽  
Cailian Chen

2014 ◽  
Vol 2014 ◽  
pp. 1-7 ◽  
Author(s):  
Jianpo Li ◽  
Xue Jiang ◽  
I-Tai Lu

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


2014 ◽  
Vol 81 (3) ◽  
pp. 1303-1320 ◽  
Author(s):  
Samira Yessad ◽  
Louiza Bouallouche-Medjkoune ◽  
Djamil Aïssani

2015 ◽  
Vol 785 ◽  
pp. 744-750
Author(s):  
Lei Gao ◽  
Qun Chen

In order to solve the energy limited problem of sensor nodes in the wireless sensor networks (WSN), a fast clustering algorithm based on energy efficiency for wire1ess sensor networks is presented in this paper. In the system initialization phase, the deployment region is divided into several clusters rapidly. The energy consumption ratio and degree of the node are chosen as the selection criterion for the cluster head. Re-election of the cluster head node at this time became a local trigger behavior. Because of the range of the re-election is within the cluster, which greatly reduces the complexity and computational load to re-elect the cluster head node. Theoretical analysis indicates that the timing complexity of the clustering algorithm is O(1), which shows that the algorithm overhead is small and has nothing to do with the network size n. Simulation results show that clustering algorithm based on energy efficiency can provide better load balancing of cluster heads and less protocol overhead. Clustering algorithm based on energy efficiency can reduce energy consumption and prolong the network lifetime compared with LEACH protocol.


Complexity ◽  
2020 ◽  
Vol 2020 ◽  
pp. 1-13
Author(s):  
Jun Wang ◽  
Zhuangzhuang Du ◽  
Zhengkun He ◽  
Xunyang Wang

Balancing energy consumption using the clustering routing algorithms is one of the most practical solutions for prolonging the lifetime of resource-limited wireless sensor networks (WSNs). However, existing protocols cannot adequately minimize and balance the total network energy dissipation due to the additional tasks of data acquisition and transmission of cluster heads. In this paper, a cluster-head rotating election routing protocol is proposed to alleviate the problem. We discovered that the regular hierarchical clustering method and the scheme of cluster-head election area division had positive effects on reducing the energy consumption of cluster head election and intracluster communication. The election criterion composed of location and residual energy factor was proved to lower the probability of premature death of cluster heads. The chain multihop path of intercluster communication was performed to save the energy of data aggregation to the base station. The simulation results showed that the network lifetime can be efficiently extended by regulating the adjustment parameters of the protocol. Compared with LEACH, I-LEACH, EEUC, and DDEEC, the algorithm demonstrated significant performance advantages by using the number of active nodes and residual energy of nodes as the evaluation indicators. On the basis of these results, the proposed routing protocols can be utilized to increase the capability of WSNs against energy constraints.


Sign in / Sign up

Export Citation Format

Share Document