scholarly journals A Type of Annulus-Based Energy Balanced Data Collection Method in Wireless Rechargeable Sensor Networks

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.

2015 ◽  
Vol 2015 ◽  
pp. 1-9 ◽  
Author(s):  
Jia Xu ◽  
Chuan Ping Wang ◽  
Hua Dai ◽  
Da Qiang Zhang ◽  
Jing Jie Yu

TheMobile Sinkbased data collection in wireless sensor network can reduce energy consumption efficiently and has been a new data collection paradigm. In this paper, we focus on exploring polynomial algorithm to compute the constrained trajectory of theMobile Sinkfor data collection. We first present a universal system model for designing constrained trajectory in large-scale wireless sensor networks and formulate the problem as theMaximizing Energy Reduction for Constrained Trajectory(MERC) problem. We show that the MERC problem is NP-hard and design an approximation algorithm (CTMER), which follows the greedy approach to design the movement trajectory of theMobile Sinkby maximizing theeffective average energy reduction. Through both rigid theoretical analysis and extensive simulations, we demonstrate that our algorithm achieves high computation efficiency and is superior to otherMobile Sinkbased data collection methods in aspects of energy consumption and network lifetime.


Wireless sensor networks (WSNs) have become increasingly important in the informative development of communication technology. The growth of Internet of Things (IoT) has increased the use of WSNs in association with large scale industrial applications. The integration of WSNs with IoT is the pillar for the creation of an inescapable smart environment. A huge volume of data is being generated every day by the deployment of WSNs in smart infrastructure. The collaboration is applicable to environmental surveillance, health surveillance, transportation surveillance and many more other fields. A huge quantity of data which is obtained in various formats from varied applications is called big data. The Energy efficient big data collection requires new techniques to gather sensor-based data which is widely and densely distributed in WSNs and spread over wider geographical areas. In view of the limited range of communication and low powered sensor nodes, data gathering in WSN is a tedious task. The energy hole is another considerable issue that requires attention for efficient handling in WSN. The concept of mobile sink has been widely accepted and exploited, since it is able to effectively alleviate the energy hole problem. Scheduling a mobile sink with energy efficiency is still a challenge in WSNs time constraint implementation due to the slow speed of the mobile sink. The paper addresses the above issues and the proposal contains four-phase data collection model; the first phase is the identification of network subgroups, which are formed due to a restricted range of communication in sensor nodes in a wide network, second is clustering which is addressed on each identified subgroup for reducing energy consumption, third is efficient route planning and fourth is based on data collection. The two time-sensitive route planning schemes are presented to build a set of trajectories which satisfy the deadline constraint and minimize the overall delay. We have evaluated the performance of our schemes through simulation and compared them with the generic enhanced expectation-maximization (EEM) mobility based scenario of data collection. Simulation results reveal that our proposed schemes give much better results as compared to the generic EEM mobility approach in terms of selected performance metrics such as energy consumption, delay, network lifetime and packet delivery ratio.


2015 ◽  
Vol 2015 ◽  
pp. 1-11 ◽  
Author(s):  
Chao Sha ◽  
Tian-cheng Shen ◽  
Jin-yu Chen ◽  
Yao Zhang ◽  
Ru-chuan Wang

In view of the unbalanced energy consumption of traditional cluster-based sensor networks, this paper proposes a type of uneven clustering protocol in data collection. The network is divided into inner and outer regions according to the distance between nodes and the base station. The inner region is consisted of several layers and nodes in outer region are deployed in grids of different sizes. Sensor data is collected by nodes in outer region and then is be transmitted to the inner region. Nodes in the inner region do data fusion and forward data from the lower layer to the higher one. Simulation results show that, compared with MTP and CDFUD, the proposed algorithm performs well in balance of energy consumption and could effectively prolong the network lifetime.


Sensors ◽  
2019 ◽  
Vol 20 (1) ◽  
pp. 205
Author(s):  
Jia Yang ◽  
Jian-Shuang Bai ◽  
Qiang Xu

The node energy consumption rate is not dynamically estimated in the online charging schemes of most wireless rechargeable sensor networks, and the charging response of the charging-needed node is fairly poor, which results in nodes easily generating energy holes. Aiming at this problem, an energy hole avoidance online charging scheme (EHAOCS) based on a radical basis function (RBF) neural network, named RBF-EHAOCS, is proposed. The scheme uses the RBF neural network to predict the dynamic energy consumption rate during the charging process, estimates the optimal threshold value of the node charging request on this basis, and then determines the next charging node per the selected conditions: the minimum energy hole rate and the shortest charging latency time. The simulation results show that the proposed method has a lower node energy hole rate and smaller charging node charging latency than two other existing online charging schemes.


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.


2014 ◽  
Vol 2014 ◽  
pp. 1-12 ◽  
Author(s):  
Jian Chen ◽  
Jie Jia ◽  
Yingyou Wen ◽  
Dazhe Zhao

Energy hole is an inherent problem caused by heavier traffic loads of sensor nodes nearer the sink because of more frequent data transmission, which is strongly dependent on the topology induced by the sensor deployment. In this paper, we propose an autonomous sensor redeployment algorithm to balance energy consumption and mitigate energy hole for unattended mobile sensor networks. First, with the target area divided into several equal width coronas, we present a mathematical problem modeling sensor node layout as well as transmission pattern to maximize network coverage and reduce communication cost. And then, by calculating the optimal node density for each corona to avoid energy hole, a fully distributed movement algorithm is proposed, which can achieve an optimal distribution quickly only by pushing or pulling its one-hop neighbors. The simulation results demonstrate that our algorithm achieves a much smaller average moving distance and a much longer network lifetime than existing algorithms and can eliminate the energy hole problem effectively.


Sign in / Sign up

Export Citation Format

Share Document