scholarly journals Energy-Efficient Routing in Wireless Sensor Networks

2021 ◽  
Vol 25 (2) ◽  
pp. 421-434
Author(s):  
Dániel Pásztor ◽  
Péter Ekler ◽  
János Levendovszky

Efficient data collection is the core concept of implementing Industry4.0 on IoT platforms. This requires energy aware communication protocols for Wireless Sensor Networks (WSNs) where different functions, like sensing and processing on the IoT nodes must be supported by local battery power. Thus, energy aware network protocols, such as routing, became one of fundamental challenges in IoT data collection schemes.In our research, we have developed novel routing algorithms which guarantee minimum energy consumption data transfer which is achieved subject to pre-defined reliability constraints. We assume that data is transmitted in the form of packets and the routing algorithm identifies the paths over which the packets can reach the Base Station (BS) with minimum transmission energy, while the probability of successful packet transmission still exceeds a pre-defined reliability parameter. In this way, the longevity and the information throughput of the network is maximized and the low energy transmissions will considerably extend the lifetime of the IoT nodes. In this paper we propose a solution that maximizes the lifetime of the nodes.

2020 ◽  
Vol 13 (3) ◽  
pp. 353-361
Author(s):  
Veervrat Singh Chandrawanshi ◽  
Rajiv Kumar Tripathi ◽  
Rahul Pachauri ◽  
Nafis Uddin Khan

Background:Wireless Sensor Networks (WSNs) refer to a group of sensors used for sensing and monitoring the physical data of the environment and organizing the collected data at a central location. These networks enjoy several benefits because of their lower cost, smaller size and smarter sensors. However, a limited source of energy and lifetime of the sensors have emerged as the major setbacks for these networks.Methods:In this work, an energy-aware algorithm has been proposed for the transmission of variable data packets from sensor nodes to the base station according to the balanced energy consumption by all the nodes of a WSN.Results:Obtained simulation results verify that the lifetime of the sensor network is significantly enhanced in comparison to other existing clustering based routing algorithm.Conclusion:The proposed algorithm is comparatively easy to implement and achieves a higher gain in the lifetime of a WSN while keeping the throughput nearly same as LEACH protocol.


Author(s):  
Karuna Babber

Background: The advent of wireless sensor networks makes it possible to track the events even in the remotest areas that too without human intervention. But severe resource constraints, generally energy of sensor nodes push researchers worldwide to develop energy efficient protocols in order to accomplish the application objectives of these networks. Objective: However, till date there is no energy efficient routing protocol which provides uniformity with maximum resource utilization for WSNs. Methods: In this paper, a Uniform Clustering Algorithm for Energy Efficiency in Wireless Sensor Networks (UCAEE) has been proposed. UCAEE is a base station controlled algorithm where entire sensing area is partitioned into uniform clusters. The motive of the algorithm is to split the sensing area into uniform clusters and to select cluster heads and gate-way nodes within each cluster so that the network energy can be balanced in a best possible way. Conclusion: UCAEE achieves minimum energy consumption during data transmission and reception. Results: Simulation results indicate that proposed UCAEE algorithm conserves more energy than its contemporary clustering algorithms like LEACH, PEGASIS and SECA and promises better network lifetime of wireless sensor networks.


2011 ◽  
Vol 8 (4) ◽  
pp. 991-1007 ◽  
Author(s):  
Jin Wang ◽  
Tinghuai Ma ◽  
Jinsung Cho ◽  
Sungoung Lee

Many energy aware routing algorithms and protocols have been proposed for wireless sensor networks recently to achieve aims like minimum energy consumption, maximized network lifetime, reduced communication latency and overhead etc. The problem of hotspot can not be well addressed under many routing algorithms since some nodes which are on the shortest path or close to the base station tend to deplete their energy quickly and consequently cause network partition. In this paper, we propose a Ring-based Energy Aware Routing (REAR) algorithm for wireless sensor networks which can achieve both energy balancing and energy efficiency for all sensor nodes. Our algorithm considers not only the hop number and distance but also the residual energy of the next hop node during routing process. Simulation results validate that our algorithm outperforms some other routing algorithms in the aspects of energy consumption and network lifetime etc.


2015 ◽  
Vol 2015 ◽  
pp. 1-11
Author(s):  
Sohail Jabbar ◽  
Rabia Iram ◽  
Muhammad Imran ◽  
Awais Ahmad ◽  
Anand Paul ◽  
...  

Network lifetime is one of the most prominent barriers in deploying wireless sensor networks for large-scale applications because these networks employ sensors with nonrenewable scarce energy resources. Sensor nodes dissipate most of their energy in complex routing mechanisms. To cope with limited energy problem, we present EASARA, an energy aware simple ant routing algorithm based on ant colony optimization. Unlike most algorithms, EASARA strives to avoid low energy routes and optimizes the routing process through selection of least hop count path with more energy. It consists of three phases, that is, route discovery, forwarding node, and route selection. We have improved the route discovery procedure and mainly concentrate on energy efficient forwarding node and route selection, so that the network lifetime can be prolonged. The four possible cases of forwarding node and route selection are presented. The performance of EASARA is validated through simulation. Simulation results demonstrate the performance supremacy of EASARA over contemporary scheme in terms of various metrics.


2017 ◽  
Vol 13 (04) ◽  
pp. 45 ◽  
Author(s):  
Liping LV

<p class="0abstract"><span lang="EN-US">Wireless sensor network is a new field of computer science and technology research. It has a very broad application prospects. In order to improve the network survival time, it is very important to design efficient energy-constrained routing protocols. In this paper, we studied the characteristics of wireless sensor networks, and analyzed the design criteria of sensor network routing algorithms. In view of the shortcomings of traditional algorithms, we proposed an energy-aware multi-path algorithm. When selecting a data transmission path, the energy-aware multi-path algorithm can avoid nodes with low energy levels. At the same time, it takes the remaining energy of the node and the number of hops as one of the measures of the path selection. The multi-path routing algorithm realized the low energy consumption of the data transmission path, thus effectively prolonging the network lifetime. Compared with the traditional algorithm, the results show that our method has high reliability and energy efficiency.</span></p>


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.


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.


Sign in / Sign up

Export Citation Format

Share Document