scholarly journals Analysis and Design of a Wireless Sensor Network Based on the Residual Energy of the Nodes and the Harvested Energy from Mint Plants

2021 ◽  
Vol 2021 ◽  
pp. 1-26
Author(s):  
Hassel Aurora Alcalá-Garrido ◽  
Víctor Barrera-Figueroa ◽  
Mario E. Rivero-Ángeles ◽  
Yunia Verónica García-Tejeda ◽  
Hosanna Ramírez Pérez

Nowadays, the use of sensor nodes for the IoT is widespread; nodes that compose these networks must possess self-organizing capabilities and communication protocols that require less energy consumption during communication procedures. In this work, we propose the design and analysis of an energy harvesting system using bioelectricity harvested from mint plants that aids in powering a particular design of a wireless sensor operating in a continuous monitoring mode. The system is based on randomly turning nodes ON (active nodes) and OFF (inactive nodes) to avoid their energy depletion. While a node is in an inactive state, it is allowed to harvest energy from the surroundings. However, while the node is harvesting energy from its surroundings, it is unable to report data. As such, a clear compromise is established between the amount of information reported and the lifetime of the network. To finely tune the system’s parameters and offer an adequate operation, we derive a mathematical model based on a discrete Markov chain that describes the main dynamics of the system. We observe that with the use of mint plants, the harvested energy is of the order of a few Joules; nonetheless, such small energy values can sustain a wireless transmission if correctly adapted to drive a wireless sensor. If we consider the lowest mean harvested energy obtained from mint plants, such energy can be used to transmit up to 259,564 bits or can also be used to receive up to 301,036 bits. On the other hand, if we consider the greatest mean harvested energy, this energy can be used to transmit up to 2,394,737 bits or can also be used to receive up to 2,777,349 bits.

2020 ◽  
Vol 17 (12) ◽  
pp. 5447-5456
Author(s):  
R. M. Alamelu ◽  
K. Prabu

Wireless sensor network (WSN) becomes popular due to its applicability in distinct application areas like healthcare, military, search and rescue operations, etc. In WSN, the sensor nodes undergo deployment in massive number which operates autonomously in harsh environment. Because of limited resources and battery operated sensor nodes, energy efficiency is considered as a main design issue. To achieve, clustering is one of the effective technique which organizes the set of nodes into clusters and cluster head (CH) selection takes place. This paper presents a new Quasi Oppositional Glowworm Swarm Optimization (QOGSO) algorithm for energy efficient clustering in WSN. The proposed QOGSO algorithm is intended to elect the CHs among the sensor nodes using a set of parameters namely residual energy, communication cost, link quality, node degree and node marginality. The QOGSO algorithm incorporates quasi oppositional based learning (QOBL) concept to improvise the convergence rate of GSO technique. The QOGSO algorithm effectively selects the CHs and organizes clusters for minimized energy dissipation and maximum network lifetime. The performance of the QOGSO algorithm has been evaluated and the results are assessed interms of distinct evaluation parameters.


Author(s):  
Vrajesh Kumar Chawra ◽  
Govind P. Gupta

The formation of the unequal clusters of the sensor nodes is a burning research issue in wireless sensor networks (WSN). Energy-hole and non-uniform load assignment are two major issues in most of the existing node clustering schemes. This affects the network lifetime of WSN. Salp optimization-based algorithm is used to solve these problems. The proposed algorithm is used for cluster head selection. The performance of the proposed scheme is compared with the two-node clustering scheme in the term of residual energy, energy consumption, and network lifetime. The results show the proposed scheme outperforms the existing protocols in term of network lifetime under different network configurations.


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.


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.


Author(s):  
Slaheddine Chelbi ◽  
Majed Abdouli ◽  
Mourad Kaddes ◽  
Claude Duvallet ◽  
Rafik Bouaziz

<p>Wireless Sensor Networks (WSN) differ from traditional wireless communication networks in several characteristics. One of these characteristics is power awarness, due to the fact that the batteries of sensor nodes have a restricted lifetime and are difficult to be replaced. Therefore, all protocols must be designed to minimize energy consumption and preserve the longevity of the network. In this paper, we propose (i) to fairly balance the load among nodes. For this, we generate an unequal clusters size where the cluster heads (CH) election is based on energy availability, (ii) to reduce the energy consumption due to the transmission by using multiple metrics in the CH jointure process and taking into account the link cost, residual energy and number of cluster members to construct the routing tree and (iii) to minimize the number of transmissions by avoiding the unnecessary updates using sensitive data controller. Simulation results show that our Advanced Energy-Efficient Unequal Clustering (AEEUC) mechanism improves the fairness energy consumption among all sensor nodes and achieves an obvious improvement on the network lifetime.</p>


2012 ◽  
Vol 2012 ◽  
pp. 1-10 ◽  
Author(s):  
Asis Kumar Tripathy ◽  
Suchismita Chinara

Wireless sensor network swears an exceptional fine-grained interface between the virtual and physical worlds. The clustering algorithm is a kind of key technique used to reduce energy consumption. Many clustering, power management, and data dissemination protocols have been specifically designed for wireless sensor network (WSN) where energy awareness is an essential design issue. Each clustering algorithm is composed of three phases cluster head (CH) selection, the setup phase, and steady state phase. The hot point in these algorithms is the cluster head selection. The focus, however, has been given to the residual energy-based clustering protocols which might differ depending on the application and network architecture. In this paper, a survey of the state-of-the-art clustering techniques in WSNs has been compared to find the merits and demerits among themselves. It has been assumed that the sensor nodes are randomly distributed and are not mobile, the coordinates of the base station (BS) and the dimensions of the sensor field are known.


Sensors ◽  
2020 ◽  
Vol 20 (3) ◽  
pp. 619 ◽  
Author(s):  
Xiaoqiang Zhao ◽  
Yanpeng Cui ◽  
Zheng Guo ◽  
Zhanjun Hao

Sensor nodes perform missions based on the effectual invariable coverage of events, and it is commonly guaranteed by the determinate deployment for sensor nodes who deviate from the optimum site frequently. To reach the optimal coverage effect with the lowest costs is a primary goal of wireless sensor networks. In this paper, by splicing the sensing area optimally with cellular grids, the best deployment location for sensors and the required minimum number of them are revealed. The optimization problem of coverage rate and energy consumption is converted into a task assignment problem, and a dynamic partition algorithm for cellular grids is also proposed to improve the coverage effect when the number of sensors is variable. Furthermore, on the basis of solving the multi-objective problem of reducing and balancing the energy cost of sensors, the vampire bat optimizer is improved by introducing virtual bats and virtual preys, and finally solves the asymmetric assignment problem once the number of cellular grids is not equal to that of sensors. Simulation results indicate that the residual energy of sensors during redeployment is balanced notably by our strategy when compared to three other popular coverage-enhancement algorithms. Additionally, the total energy cost of sensor nodes and coverage rate can be optimized, and it also has a superior robustness when the number of nodes changes.


2020 ◽  
Vol ahead-of-print (ahead-of-print) ◽  
Author(s):  
Aaqil Somauroo ◽  
Vandana Bassoo

Due to its boundless potential applications, Wireless Sensor Networks have been subject to much research in the last two decades. WSNs are often deployed in remote environments making replacement of batteries not feasible. Low energy consumption being of prime requisite led to the development of energy-efficient routing protocols. The proposed routing algorithms seek to prolong the lifetime of sensor nodes in the relatively unexplored area of 3D WSNs. The schemes use chain-based routing technique PEGASIS as basis and employ genetic algorithm to build the chain instead of the greedy algorithm. Proposed schemes will incorporate an energy and distance aware CH selection technique to improve load balancing. Clustering of the network is also implemented to reduce number of nodes in a chain and hence reduce delay. Simulation of our proposed protocols is carried out for homogeneous networks considering separately cases for a static base-station inside and outside the network. Results indicate considerable improvement in lifetime over PEGASIS of 817% and 420% for base station inside and outside the network respectively. Residual energy and delay performance are also considered.


2019 ◽  
Vol 8 (1) ◽  
pp. 18 ◽  
Author(s):  
Kankan Li ◽  
Xuefeng He ◽  
Xingchang Wang ◽  
Senlin Jiang

The Internet of things requires long-life wireless sensor nodes powered by the harvested energy from environments. This paper proposes a nonlinear electromagnetic energy harvesting system which may be used to construct fully self-powered wireless sensor nodes. Based on a nonlinear electromagnetic energy harvester (EMEH) with high output voltage, the model of a nonlinear interface circuit is derived and a power management circuit (PMC) is designed. The proposed PMC uses a buck–boost direct current-direct current (DC–DC) converter to match the load resistance of the nonlinear interface circuit. It includes two open-loop branches, which is beneficial to the optimization of the impedance matching. The circuit is able to work even if the stored energy is completely drained. The energy harvesting system successfully powered a wireless sensor node. Experimental results show that, under base excitations of 0.3 g and 0.4 g (where 1 g = 9.8 m·s−2) at 8 Hz, the charging efficiencies of the proposed circuit are 172% and 28.5% higher than that of the classic standard energy-harvesting (SEH) circuit. The experimental efficiency of the PMC is 41.7% under an excitation of 0.3 g at 8 Hz.


Sign in / Sign up

Export Citation Format

Share Document