scholarly journals An Analysis Scheme of Balancing Energy Consumption with Mobile Velocity Control Strategy for Wireless Rechargeable Sensor Networks

Sensors ◽  
2020 ◽  
Vol 20 (16) ◽  
pp. 4494
Author(s):  
Shun-Miao Zhang ◽  
Sheng-Bo Gao ◽  
Thi-Kien Dao ◽  
De-Gen Huang ◽  
Jin Wang ◽  
...  

Wireless Rechargeable Sensor Networks (WRSN) are not yet fully functional and robust due to the fact that their setting parameters assume fixed control velocity and location. This study proposes a novel scheme of the WRSN with mobile sink (MS) velocity control strategies for charging nodes and collecting its data in WRSN. Strip space of the deployed network area is divided into sub-locations for variant corresponding velocities based on nodes energy expenditure demands. The points of consumed energy bottleneck nodes in sub-locations are determined based on gathering data of residual energy and expenditure of nodes. A minimum reliable energy balanced spanning tree is constructed based on data collection to optimize the data transmission paths, balance energy consumption, and reduce data loss during transmission. Experimental results are compared with the other methods in the literature that show that the proposed scheme offers a more effective alternative in reducing the network packet loss rate, balancing the nodes’ energy consumption, and charging capacity of the nodes than the competitors.

Sensors ◽  
2018 ◽  
Vol 18 (9) ◽  
pp. 3150 ◽  
Author(s):  
Chao Sha ◽  
Qin Liu ◽  
Si-Yi Song ◽  
Ru-Chuan Wang

With the increasing number of ubiquitous terminals and the continuous expansion of network scale, the problem of unbalanced energy consumption in sensor networks has become increasingly prominent in recent years. However, a node scheduling strategy or an energy consumption optimization algorithm may be not enough to meet the requirements of large-scale application. To address this problem a type of Annulus-based Energy Balanced Data Collection (AEBDC) method is proposed in this paper. The circular network is divided into several annular sectors of different sizes. Nodes in the same annulus-sector form a cluster. Based on this model, a multi-hop data forwarding strategy with the help of the candidate cluster headers is proposed to balance energy consumption during transmission and to avoid buffer overflow. Meanwhile, in each annulus, there is a Wireless Charging Vehicle (WCV) that is responsible for periodically recharging the cluster headers as well as the candidate cluster headers. By minimizing the recharging cost, the energy efficiency is enhanced. Simulation results show that AEBDC can not only alleviate the “energy hole problem” in sensor networks, but also effectively prolong the network lifetime.


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.


2020 ◽  
Vol 16 (3) ◽  
pp. 155014772091100
Author(s):  
Gong Bencan ◽  
Dong Panpan ◽  
Chen Peng ◽  
Ren Dong

In wireless sensor networks, if sink node is stationary, the nodes close to sink will deplete energy faster than those in other areas. The unbalanced energy consumption among the nodes will lead to the energy hole problem, which shortens the network lifetime. To solve the problem, evolutionary game–based trajectory design algorithm for mobile sink in wireless sensor networks is proposed in this article. In evolutionary game model, the average residual energy of each cluster, average intra-cluster energy consumption, and average inter-cluster energy consumption are used to design utility function. The sink will select the cluster with more utility value as its new location and move to the cluster head which has the largest residual energy and the shortest distance to other cluster heads. The simulation results show that the algorithm can effectively balance network load, reduce network energy consumption, prolong the network lifetime, and increase the number of data packets that sink receives.


2014 ◽  
Vol 2014 ◽  
pp. 1-13 ◽  
Author(s):  
Chuan Zhu ◽  
Yao Wang ◽  
Guangjie Han ◽  
Joel J. P. C. Rodrigues ◽  
Jaime Lloret

This paper exploits sink mobility to prolong the lifetime of sensor networks while maintaining the data transmission delay relatively low. A location predictive and time adaptive data gathering scheme is proposed. In this paper, we introduce a sink location prediction principle based on loose time synchronization and deduce the time-location formulas of the mobile sink. According to local clocks and the time-location formulas of the mobile sink, nodes in the network are able to calculate the current location of the mobile sink accurately and route data packets timely toward the mobile sink by multihop relay. Considering that data packets generating from different areas may be different greatly, an adaptive dwelling time adjustment method is also proposed to balance energy consumption among nodes in the network. Simulation results show that our data gathering scheme enables data routing with less data transmission time delay and balance energy consumption among nodes.


2012 ◽  
Vol 490-495 ◽  
pp. 1392-1396 ◽  
Author(s):  
Chu Hang Wang

Topology control is an efficient approach which can reduce energy consumption for wireless sensor networks, and the current algorithms mostly focus on reducing the nodes’ energy consumption by power adjusting, but pay little attention to balance energy consumption of the whole network, which results in premature death of many nodes. Thus, a distributed topology control algorithm based on path-loss and residual energy (PRTC) is designed in this paper. This algorithm not only maintains the least loss links between nodes but also balances the energy consumption of the network. The simulation results show that the topology constructed by PRTC can preserve network connectivity as well as extend the lifetime of the network and provide good performance of energy consumption.


2019 ◽  
Vol 63 (2) ◽  
pp. 283-294
Author(s):  
Hong-Yi Chang ◽  
Zih-Huan Hang ◽  
Yih-Jou Tzang

Abstract Wireless-charging technology can utilize a mobile wireless charging vehicle (WCV) to rescue dying nodes by supplementing their remaining energy, and using WCVs in this way forms wireless rechargeable sensor networks (WRSNs). However, a WCV in a WRSN encounters several challenges, collectively called the optimized charging problem. This problem involves a set of sensor nodes randomly distributed on the ground for which the WCV must determine an appropriate travel path to charge the sensor nodes. Because these sensor nodes have different workloads, they exhibit different energy consumption profiles over time. Resolving the above-mentioned problem requires the determination of the priority of charging the sensor nodes based on the order in which they are expected to die and subsequently finding the most efficient path to charge the sensor nodes such that sensor death is avoided for as long as possible. Furthermore, the most efficient placement of the charging point needs to be considered when planning the charging path. To address this, the proposed multinode virtual point-based charging scheme (MNVPCS) considers both the planning of an efficient charging and the best location for the charging point. Experimental results show that MNVPCS can improve the lifetime of the entire WRSN and substantially outperform other methods on this measure.


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

2014 ◽  
Vol 681 ◽  
pp. 235-238
Author(s):  
Xin Xin Zhou ◽  
Yan Zhao

Wireless sensor networks (WSNs) is taking an increasing role in our lives. Because the energy of the sensors is limited how to efficiently use the energy to prolong the lifecycle of the sensor networks is very important. In this paper, a novel energy-balanced dynamic routing algorithm based on ACO is proposed. The novel routing algorithm can dynamically choose routing according to the residual energy of the sensors and the sensors with more power is taken more data transfer tasks. The simulation results show that the proposed routing algorithm can effectively balance energy consumption and prolong the lifecycle of the networks.


Sign in / Sign up

Export Citation Format

Share Document