scholarly journals Energy-Efficient Cluster Management Using a Mobile Charger for Solar-Powered Wireless Sensor Networks

Sensors ◽  
2020 ◽  
Vol 20 (13) ◽  
pp. 3668 ◽  
Author(s):  
Youngjae Son ◽  
Minjae Kang ◽  
Younghyun Kim ◽  
Ikjune Yoon ◽  
Dong Kun Noh

In solar-powered wireless sensor networks (SP-WSNs), sensor nodes can continuously harvest energy to relieve the energy constraint problem in battery-powered WSNs. With the advent of wireless power transmission (WPT) technology, the nodes can be charged remotely if the energy harvested is insufficient. However, even in SP-WSNs with WPT, an energy imbalance problem is observed, in which the energy consumption of the nodes around a sink node increases abnormally if the sink node is stationary. To solve this problem, recent studies have been conducted using a mobile sink node instead of a stationary one. Generally, a clustering scheme is used for the efficient utilization of a mobile sink. However, even in the case of mobile sinks, it is still necessary to minimize the energy burden of the cluster heads and their surrounding nodes. In this study, we propose a scheme that mitigates the energy imbalance problem of SP-WSNs by using a WPT-capable mobile sink and an efficient clustering scheme. In the proposed scheme, the energy imbalance is minimized by electing the cluster heads effectively after considering the energy state of the nodes, and by enabling the sink node to charge the energy of the cluster heads while collecting data from them. Consequently, this scheme allows the sink node to collect more data with fewer blackouts of the sensor nodes.

2015 ◽  
Vol 2015 ◽  
pp. 1-10 ◽  
Author(s):  
Zhenjiang Zhang ◽  
Yanan Wang ◽  
Fuxing Song ◽  
Wenyu Zhang

In wireless sensor networks (WSNs), energy-constrained sensor nodes are always deployed in hazardous and inaccessible environments, making energy management a key problem for network design. The mechanism of RNTA (redundant node transmission agents) lacks an updating mechanism for the redundant nodes, causing an unbalanced energy distribution among sensor nodes. This paper presents an energy-balanced mechanism for hierarchical routing (EBM-HR), in which the residual energy of redundant nodes is quantified and made hierarchic, so that the cluster head can dynamically select the redundant node with the highest residual energy grade as a relay to complete the information transmission to the sink node and achieve an intracluster energy balance. In addition, the network is divided into several layers according to the distances between cluster heads and the sink node. Based on the energy consumption of the cluster heads, the sink node will decide to recluster only in a certain layer so as to achieve an intercluster energy balance. Our approach is evaluated by a simulation comparing the LEACH algorithm to the HEED algorithm. The results demonstrate that the BEM-HR mechanism can significantly boost the performance of a network in terms of network lifetime, data transmission quality, and energy balance.


Sensors ◽  
2019 ◽  
Vol 19 (2) ◽  
pp. 272 ◽  
Author(s):  
Minjae Kang ◽  
Ikjune Yoon ◽  
Dong Noh

By utilizing mobile sinks in wireless sensor networks (WSNs), WSNs can be deployed in more challenging environments that cannot connect with the Internet, such as those that are isolated or dangerous, and can also achieve a balanced energy consumption among sensors which leads to prolonging the network lifetime. However, an additional overhead is required to check the current location of the sink in order for a node to transmit data to the mobile sink, and the size of the overhead is proportional to that of the network. Meanwhile, WSNs composed of solar-powered nodes have recently been actively studied for the perpetual operation of a network. This study addresses both of these research topics simultaneously, and proposes a method to support an efficient location service for a mobile sink utilizing the surplus energy of a solar-powered WSN. In this scheme, nodes that have a sufficient energy budget can constitute rings, and the nodes belonging to these rings (which are called ring nodes) maintain up-to-date location information on the mobile sink node and serve this information to the other sensor nodes. Because each ring node only uses surplus energy to serve location information, this does not affect the performance of a node’s general operations (e.g., sensing, processing, and data delivery). Moreover, because multiple rings can exist simultaneously in the proposed scheme, the overhead for acquiring the position information of the sink can be significantly reduced, and also hardly increases even if the network size becomes larger.


2015 ◽  
Vol 2015 ◽  
pp. 1-11 ◽  
Author(s):  
Youngtae Jo

To effectively transfer sensing data to a sink node, system designers should consider the characteristic of wireless sensor networks in the way of data transmission. In particular, sensor nodes surrounding a fixed sink node have routinely suffered from concentrated network traffic so that their battery energy is rapidly exhausted. The lifetime of wireless sensor networks decreases due to the rapid power consumption of these sensor nodes. To address the problem, a mobile sink model has recently been chosen for traffic load distribution among sensor nodes. However, since a mobile sink continuously changes its location in sensor networks, it has a time limitation to communicate with each sensor node and unstable signal strength from each sensor node. Therefore, fair and stable data collection policy between a mobile sink and sensor nodes is necessary in this circumstance. In this paper, we propose a new scheduling policy to support fair and stable data collection for a mobile sink in wireless sensor networks. The proposed policy performs data collection scheduling based on the communication availability of data transmission between sensor nodes and a mobile sink.


Author(s):  
Chinedu Duru ◽  
Neco Ventura ◽  
Mqhele Dlodlo

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.


2014 ◽  
Vol 2014 ◽  
pp. 1-7
Author(s):  
Mingxin Yang ◽  
Jingsha He ◽  
Yuqiang Zhang

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.


2021 ◽  
Author(s):  
Ramin Danehchin

Abstract Data collection on Wireless Sensor Networks (WSNs) is a significant challenge to satisfy the requirements of various applications. Providing an energy-efficient routing technique is the primary step in data collection over WSNs. The existing data collection techniques in the WSNs field struggle with the imbalance load distribution and the short lifetime of the network. This paper proposes a novel mechanism to select cluster-heads, cluster the wireless sensor nodes, and determine the optimal route from source nodes to the sink. We employ the genetic algorithm to solve the routing problem considering the hop-count of the cluster-heads to the sink, the number of each cluster member, residual energy of cluster-heads, and the number of cluster-heads connected to the sink as the fitness criteria. Our proposed mechanism uses a greedy approach to calculate the hop-count of each cluster-head to the sink for integrating the clustering and routing process on WSNs. The simulation results demonstrate that our proposed mechanism improves the energy consumption, the number of live nodes, and the lifetime of the network compared to other data collection approaches on WSNs.


2020 ◽  
Vol 11 (1) ◽  
pp. 36-48
Author(s):  
Amiya Bhusan Bagjadab ◽  
Sushree Bibhuprada B. Priyadarshini

Wireless sensor networks are commonly used to monitor certain regions and to collect data for several application domains. Generally, in wireless sensor networks, data are routed in a multi-hop fashion towards a static sink. In this scenario, the nodes closer to the sink become heavily involved in packet forwarding, and their battery power is exhausted rapidly. This article proposes that a special node (i.e., mobile sink) will move in the specified region and collect the data from the sensors and transmit it to the base station such that the communication distance of the sensors will be reduced. The aim is to provide a track for the sink such that it covers maximum sensor nodes. Here, the authors compared two tracks theoretically and in the future will try to simulate the two tracks for the sink movement so as to identify the better one.


Author(s):  
Khalil Al-shqeerat

<p class="Abstract">In Wireless Sensor Networks, no physical backbone infrastructure used while all sensor nodes are energy constrained and impractical to recharge. The behavior of networks becomes unstable once the first node dies. The key challenge in such networks is how to reduce energy consumption to increase the network lifetime, especially with the different amount of energy in heterogeneity environments.</p><p class="Abstract">In this paper, the virtual backbone routing solution is suggested to reduce energy consumption in a wireless sensor network. An integrated approach combines both advantages of hierarchical cluster-based architecture and shortest spanning tree topology for constructing a virtual backbone with a mobile sink. The clustering solution is used to divide the network into clusters and reduces the number of nodes included in the communication. On the other hand, the shortest spanning tree technique is used to construct a backbone among all cluster heads and mobile sink every time the sink traverses to a new location. The proposed approach aims to construct an efficient data aggregation spanning tree used to send or receive data between the mobile sink and elected cluster heads in wireless sensor networks. It constructs an efficient virtual backbone to decrease the energy consumption and prolong the lifetime of the network.</p>Performance evaluation results demonstrate how the proposed approach prolongs the lifetime of wireless sensor networks compared to some conventional clustering protocols.


Complexity ◽  
2019 ◽  
Vol 2019 ◽  
pp. 1-10
Author(s):  
Fan Chao ◽  
Zhiqin He ◽  
Aiping Pang ◽  
Hongbo Zhou ◽  
Junjie Ge

In the water area monitoring of the traditional wireless sensor networks (WSNs), the monitoring data are mostly transmitted to the base station through multihop. However, there are many problems in multihop transmission in traditional wireless sensor networks, such as energy hole, uneven energy consumption, unreliable data transmission, and so on. Based on the high maneuverability of unmanned aerial vehicles (UAVs), a mobile data collection scheme is proposed, which uses UAV as a mobile sink node in WSN water monitoring and transmits data wirelessly to collect monitoring node data efficiently and flexibly. In order to further reduce the energy consumption of UAV, the terminal nodes are grouped according to the dynamic clustering algorithm and the nodes with high residual energy in the cluster are selected as cluster head nodes. Then, according to the characteristics of sensor nodes with a certain range of wireless signal coverage, the angular bisection method is introduced on the basis of the traditional ant colony algorithm to plan the path of UAV, which further shortens the length of the mobile path. Finally, the effectiveness and correctness of the method are proved by simulation and experimental tests.


Many researches have been proposed for efficiency of data transmission from sensor nodes to sink node for energy efficiency in wireless sensor networks. Among them, cluster-based methods have been preferred In this study, we used the angle formed with the sink node and the distance of the cluster members to calculate the probability of cluster head. Each sensor node sends measurement values to header candidates, and the header candidate node measures the probability value of the header with the value received from its candidate member nodes. To construct the cluster members, the data transfer direction is considered. We consider angle, distance, and direction as cluster header possibility value. Experimental results show that data transmission is proceeding in the direction of going to the sink node. We calculated and displayed the header possibility value of the neighbor nodes of the sensor node and confirmed the candidates of the cluster header for data transfer as the value. In this study, residual energy amount of each sensor node is not considered. In the next study, we calculate the value considering the residual energy amount of the node when measuring the header possibility value of the cluster.


Sign in / Sign up

Export Citation Format

Share Document