scholarly journals Routing with Renewable Energy Management in Wireless Sensor Networks

Sensors ◽  
2021 ◽  
Vol 21 (13) ◽  
pp. 4376
Author(s):  
João Junior ◽  
Moysés Lima ◽  
Leandro Balico ◽  
Richard Pazzi ◽  
Horácio Oliveira

In wireless sensor networks (WSNs), power consumption is an important aspect when designing routing protocols. When compared to other components of a sensor node, the power required by radio transmitters is responsible for most of the consumption. One way to optimize energy consumption is by using energy-aware protocols. Such protocols take into consideration the residual energy information (i.e., remaining battery power) when making decisions, providing energy efficiency through the careful management of energy consumption. In this work, we go further and propose a new routing protocol that uses not only the residual energy information, but also the available renewable energy information from renewable energy sources such as solar cells. We then present the Renewable Energy-Based Routing (REBORN) algorithm, an energy-aware geographic routing algorithm, capable of managing both the residual and the available energy. Our results clearly show the advantages and the efficiency achieved by our REBORN algorithm when compared to other proposed energy-aware approaches.

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.


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


Author(s):  
Fuseini Jibreel ◽  
Emmanuel Tuyishimire ◽  
I M Daabo

Wireless Sensor Networks (WSNs) continue to provide essential services for various applications such as surveillance, data gathering, and data transmission from the hazardous environments to safer destinations. This has been enhanced by the energy-efficient routing protocols that are mostly designed for such purposes. Gateway-based Energy-Aware Multi-hop Routing protocol (MGEAR) is one of the homogenous routing schemes that was recently designed to more efficiently reduce the energy consumption of distant nodes. However, it has been found that the protocol has a high energy consumption rate, lower stability period, less data transmission to the Base station (BS). In this paper, an enhanced Heterogeneous Gateway-based Energy-Aware multi-hop routing protocol ( HMGEAR) is proposed. The proposed routing scheme is based on the introduction of heterogeneous nodes in the existing scheme, selection of the head based on the residual energy, introduction of multi-hop communication strategy in all the regions of the network, and implementation of energy hole elimination technique. Results show that the proposed routing scheme outperforms two existing ones.


2013 ◽  
Vol 706-708 ◽  
pp. 635-638
Author(s):  
Yong Lv

Wireless Sensor Networks consisting of nodes with limited power are deployed to collect and distribute useful information from the field to the other sensor nodes. Energy consumption is a key issue in the sensor’s communications since many use battery power, which is limited. In this paper, we describe a novel energy efficient routing approach which combines swarm intelligence, especially the ant colony based meta-heuristic, with a novel variation of reinforcement learning for sensor networks (ARNet). The main goal of our study was to maintain network lifetime at a maximum, while discovering the shortest paths from the source nodes to the sink node using an improved swarm intelligence. ARNet balances the energy consumption of nodes in the network and extends the network lifetime. Simulation results show that compared with the traditional EEABR algorithm can obviously improve adaptability and reduce the average energy consumption effectively.


Sensor Review ◽  
2014 ◽  
Vol 34 (4) ◽  
pp. 374-381 ◽  
Author(s):  
Amjad Abu-Baker ◽  
Hong Huang ◽  
Satyajayant Misra

Purpose – The purpose of this paper is to investigate conditional and unconditional lifetime sequence of wireless sensor networks (WSN) that have many important practical applications. A significant limitation for WSN is its short lifetime due to the limited capacity of the battery. Renewable energy can significantly extend the lifetime of WSN. In this paper, we investigate the whole sequence of lifetimes of every sensor in WSN, as different application scenarios have different requirement on how many sensors can die until the WSN is no longer functional. Design/methodology/approach – Linear programming formulation was used to investigate both the conditional and unconditional lifetime sequence of WSN. The lifetime sequences of WSN without and with differ levels of solar power were studied. Findings – This investigation of lifetime sequences discovered three interesting phenomena: the sensors that die first are on the peripheral of the network, rather close to the base station; multiple sensors tend to die simultaneously; and the lifetimes of sensors that die later can be extended by renewable energy much more significantly than those that die early, which is very good news to applications that can tolerate the death of a fraction of sensors. Originality/value – In this paper, the first optimization formulation for maximizing both unconditional and conditional lifetime sequences of WSNs with renewable energy sources was provided. Only the conditional lifetime sequence has been investigated in a previous work, but this method runs n-times faster than the previous work, with n being the number of nodes in the WSN.


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.


Author(s):  
Sihem Souiki ◽  
Sidi Mohamed Hadj Irid ◽  
Mourad Hadjila

Extending the network lifetime is a very challenging problem that needs to be taken into account during routing data in wireless sensor networks in general and particularly in underwater wireless sensor networks (UWSN). For this purpose, the present paper proposes a multilayer chain based on genetic algorithm routing (MCGA) for routing data from nodes to the sink. This algorithm consists to create a limited number of local chains constructed by using genetic algorithm in order to obtain the shortest path between nodes; furthermore, a leader node (LN) is elected in each chain followed by constructing a global chain containing LNs. The selection of the LN in the closest chain to the sink is as follows: Initially, the closest node to sink is elected LN in this latter because all nodes have initially the same energy value; then the future selection of the LN is based on the residual energy of the nodes. LNs in the other chains are selected based on the proximity to the previous LNs. Data transmission is performed in two steps: intra-chain transmission and inter-chain transmission. Furthermore, MCGA is simulated for different scenarios of mobility and density of nodes in the networks. The performance evaluation of the proposed technique shows a considerable reduction in terms of energy consumption and network lifespan.


Author(s):  
VENKATESH S

In Wireless Sensor Networks (WSNs), Efficient clustering is key for optimal use of available nodes. Fault tolerance to any failure on the network or node level is an essential requirement in this context. Hence, a novel approach towards clustering and multiple object tracking in WSNs is being explored. The Proposed method employs judicious mix of burdening all available nodes including GH (Group Head) to earn energy efficiency and fault tolerance. Initially, node with the maximum residual energy in a cluster becomes group head and node with the second maximum residual energy becomes altruist node, but not mandatory. Later on, selection of cluster head will be based on available residual energy. We use Matlab software as simulation platform to check energy consumption at cluster by evaluation of proposed algorithm. Eventually we evaluated and compare this proposed method against previous method and we demonstrate our model is better optimization than other method such as Traditional clustering in energy consumption rate.


Sign in / Sign up

Export Citation Format

Share Document